Limiting convex examples for nonconvex subdifferential calculus.
Evaluation of triple Euler sums.
Legendre functions and the method of random Bregman projections.
Dynamics of a continued fraction of Ramanujan with random coefficients.
Integer powers of arcsin.
Bounded linear regularity, strong CHIP, and CHIP are distinct properties.
Experimental evaluation of Euler sums.
Experimental determination of Apéry-like identities for .
Recent Results on Douglas–Rachford Methods
Recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems are described. 2010 Mathematics Subject Classification: 90C27, 90C59, 47N10.
Combinatorial aspects of multiple zeta values.
On the binary expansions of algebraic numbers
Employing concepts from additive number theory, together with results on binary evaluations and partial series, we establish bounds on the density of 1’s in the binary expansions of real algebraic numbers. A central result is that if a real has algebraic degree , then the number of 1-bits in the expansion of through bit position satisfies for a positive number (depending on ) and sufficiently large . This in itself establishes the transcendency of a class of...
Page 1