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

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…

A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

We consider the series of the Bergman orthogonal polynomials associated with a bounded simply-connected domain in the complex plane, whose boundary is a Jordan curve. These are the polynomials that are orthonormal with respect to the area…

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We formulate and prove a profinite rigidity theorem for the twisted Alexander polynomials up to several types of finite ambiguity. We also establish torsion growth formulas of the twisted homology groups in a $\mathbb{Z}$-cover of a…

We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…

We prove that any smooth cubic surface defined over any number field satisfies the lower bound predicted by Manin's conjecture possibly after an extension of small degree.

We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

We construct complex a-priori bounds for certain infinitely renormalizable Lorenz maps. As a corollary, we show that renormalization is a real-analytic operator on the corresponding space of Lorenz maps.

For a complete noncompact connected Riemannian manifold with bounded geometry, we prove a compactness result for sequences of finite perimeter sets with uniformly bounded volume and perimeter in a larger space obtained by adding limit…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

We show that a smooth bounded domain in $\mathbb{C}^n$ admitting partial pseudoconvex exhaustion remains partial pseudoconvex. The main ingredient of the proof is based on a new characterization of hyper-$q$-convex domains. Furthermore, we…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

D.Sullivan (1977) (see also the book by H.Whitney "Geometric Integration Theory",1957) considered a new model for underlying cochain complex for classical cohomologies with rational coefficients for arbitrary simplicial spaces that gives…