Related papers: A simple proof of Sullivan's complex bounds
The paper combines several fortunate mini miracles to achieve its two objectives. These were woven together in a several year's effort to answer a question raised by Iz Singer a decade ago. Our answer is accessible to the topologist, to the…
By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…
In a recent paper almost sure unisolvence of RBF interpolation at random points with no polynomial addition was proved, for Thin-Plate Splines and Radial Powers with noninteger exponent. The proving technique left unsolved the case of odd…
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that…
We present a much simplified proof of Dehn's theorem on the infinitesimal rigidity of convex polytopes. Our approach is based on the ideas of Trushkina and Schramm.
We establish a quasi-monotonicity formula {for an intrinsic frequency function related to solutions to} thin obstacle problems with zero obstacle driven by quadratic energies with Sobolev $W^{1,p}$ coefficients, with $p$ bigger than the…
The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…
We consider the class of stable solutions to semilinear equations $-\Delta u=f(u)$ in a bounded smooth domain of $\mathbb{R}^n$. Since 2010 an interior a priori $L^\infty$ bound for stable solutions is known to hold in dimensions $n \leq 4$…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…
We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…
It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…
We prove that the number of connected components of a smooth hypersurface in the positive orthant of $\mathbb{R}^n$ defined by a real polynomial with $d + k + 1$ monomials, where $d$ is the dimension of the affine span of the exponent…
We consider small nonlinear perturbations of linear systems on a time scale with the phase space being finite or infinite-dimensional. For $\Delta$-differential operators, corresponding to linear dynamic systems we consider their…
In this short note we give a construction of an infinite series of Delone simplices whose relative volume grows super-exponentially with their dimension. This dramatically improves the previous best lower bound, which was linear.
We prove that every simplicial complex is the dual complex of some simple normal crossing divisor in a smooth variety. As an application, we simplify and extend the results of Kapovich--Koll\'ar (math.AG:1109.4047) on the existence of…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
We establish the strong asymptotics for Bergman orthogonal polynomials defined over Jordan domains with corners. This complements an investigation started in 1923 by T. Carleman, who derived the strong asymptotics for domains bounded by…
First proved my Donald Martin in 1975, the result of Borel determinacy has been the subject of multiple revised proofs. Following Martin's book [1], we present a recent streamlined proof which implements ideas of Martin, Moschovakis, and…