Related papers: The Elekes-Szab\'{o} Problem and the Uniformity Co…

Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential…

We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, P_c :z \mapsto z^d+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the…

We give conditions ensuring that the Fatou set and the complement of the fast escaping set of an exponential polynomial $f$ have finite Lebesgue measure. Essentially, these conditions are designed such that $|f(z)|\ge\exp(|z|^\alpha)$ for…

This work is motivated by the papers [EG85] and [Ngu15] in which the following two problems are solved. Let $\mathcal{O}$ is a finitely generated $\mathbb{Z}$-algebra that is an integrally closed domain of characteristic zero, consider the…

Let $k\geq 2$ be an integer. In the spirit of Kolesnikov-Werner \cite{KW}, for each $j\in\{2,\ldots,k\}$, we conjecture a sharp Santal\'{o} type inequality (we call it $j$-Santal\'{o} conjecture) for many sets (or more generally for many…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Let $X$ be a normal variety. Assume that for some reduced divisor $D \subset X$, logarithmic 1-forms defined on the snc locus of $(X, D)$ extend to a log resolution $\tilde X \to X$ as logarithmic differential forms. We prove that then the…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

A classical inequality of Sz\'asz bounds polynomials with no zeros in the upper half plane entirely in terms of their first few coefficients. Borcea-Br\"and\'en generalized this result to several variables as a piece of their…

We prove the non-uniform continuity of the data-to-solution map of the incompressible Euler equations in Besov spaces $B_{p,q}^{s}$, where the parameters $p, q$ and $s$ considered here are such that the local existence and uniqueness result…

We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…

A second order finite-difference equation has two linearly independent solutions. It is shown here that, like in the continuous case, at most one of the two can be a polynomial solution. The uniqueness in the classical continuous…

Let $f_t(z)=z^2+t$. For any $z\in\mathbb{Q}$, let $S_z$ be the collection of $t\in\mathbb{Q}$ such that $z$ is preperiodic for $f_t$. In this article, assuming a well-known conjecture of Flynn, Poonen, and Schaefer, we prove a uniform…

Motivated by the variations of Sarnak's conjecture due to El Abdalaoui, Kulaga-Przymus, Lemanczyk, De La Rue and by the observation that the Mobius function is a good weight (with limit zero) for the polynomial pointwise ergodic theorem in…

We note that Pillay's result on the stability of an algebraically closed field with a predicate for a group of Lang type implies that number uniformity follows formally from the finiteness results analogous to Faltings' Theorem.

In this paper, we study the regularity of solutions to uniformly degenerate elliptic equations in bounded domains under the condition that the characteristic polynomials have varying characteristic exponents.

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

Let $E$ be an elliptic curve defined over a number field $k$ and $\ell$ a prime integer. When $E$ has at least one $k$-rational point of exact order $\ell$, we derive a uniform upper bound $\exp(C \log B / \log \log B)$ for the number of…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…