Related papers: A simple proof of Sullivan's complex bounds

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If…

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

Building on work by Chabauty from 1941, Coleman proved in 1985 an explicit bound for the number of rational points of a curve $C$ of genus $g\ge 2$ defined over a number field $F$, with Jacobian of rank at most $g-1$. Namely, in the case…

We propose a novel a posteriori error estimator for conforming finite element discretizations of two- and three-dimensional Helmholtz problems. The estimator is based on an equilibrated flux that is computed by solving patchwise mixed…

We establish the convergence theory of multiplicative Diophantine approximation for all non-degenerate, smooth manifolds. We also settle said convergence theory for all affine subspaces satisfying a highly generic and essentially optimal…

We establish estimates for the number of solutions of certain affine congruences. These estimates are then used to prove Manin's conjecture for a cubic surface split over Q and whose singularity type is D_4. This improves on a result of…

We study the complex property $\partial\partial = 0$ of the boundary operator $\partial$ on a weighted, infinite, and possibly non-locally finite simplicial complex. We give a characterization of this property in $\ell^2$ in terms of the…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

In 1984, Dancis proved that any $d$-dimensional simplicial manifold is determined by its $(\lfloor d/2 \rfloor + 1)$-skeleton. This paper adapts his proof to the setting of cubical complexes that can be embedded into a cube of arbitrary…

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

We prove that various arithmetic quotients of the unit ball in $\mathbb{C}^n$ are Mordellic, in the sense that they have only finitely many rational points over any finitely generated field extension of $\mathbb{Q}$. In the previously known…

We describe a new and robust method to prove rigidity results in complex dynamics. The new ingredient is the geometry of the critical puzzle pieces: under control of geometry and ``complex bounds'', two generalized polynomial-like maps…

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

We present a solution of the algebraic version of Birkhoff Conjecture on integrable billiards. Namely we show that every polynomially integrable real bounded convex planar billiard with smooth boundary is an ellipse. We extend this result…

The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…

In pointed braided fusion categories knowing the self-symmetry braiding of simples is theoretically enough to reconstruct the associator and braiding on the entire category (up to twisting by a braided monoidal auto-equivalence). We address…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…