English
Related papers

Related papers: Dynamical uniform boundedness and the $abc$-conjec…

200 papers

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

Probability · Mathematics 2015-05-15 Shuyang Bai , Murad S. Taqqu

The Mordell--Lang conjecture for abelian varieties states that the intersection of an algebraic subvariety $X$ with a subgroup of finite rank is contained in a finite union of cosets contained in $X$. In this article, we prove a uniform…

Number Theory · Mathematics 2026-03-27 Ziyang Gao , Tangli Ge , Lars Kühne

For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…

Complex Variables · Mathematics 2018-10-24 Igor Pritsker , Koushik Ramachandran

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

Symbolic Computation · Computer Science 2017-05-09 Amir Hashemi , Werner M. Seiler

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

Commutative Algebra · Mathematics 2025-12-02 Anuvinda J , Ranjana Mehta , Kamalesh Saha

We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…

Algebraic Geometry · Mathematics 2017-02-22 Dragos Ghioca , Holly Krieger , Khoa Nguyen , Hexi Ye

The classical $abc$ theorem for polynomials (often called Mason's theorem) deals with nontrivial polynomial solutions to the equation $a+b=c$. It provides a lower bound for the number of distinct zeros of the polynomial $abc$ in terms of…

Complex Variables · Mathematics 2010-04-22 Konstantin M. Dyakonov

We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an…

Probability · Mathematics 2017-10-10 Omer Angel , Tom Hutchcroft

In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…

Combinatorics · Mathematics 2022-08-30 Adrian Dumitrescu

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

Numerical Analysis · Mathematics 2008-10-16 Marco Caminati

We extend an earlier result by Dan Abramovich, showing that a conjecture of S. Lang's implies the existence of a uniform bound on the number of $K$-rational points over all smooth curves of genus $g$ defined over $K$, where $K$ is any…

alg-geom · Mathematics 2008-02-03 Patricia L. Pacelli

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…

Number Theory · Mathematics 2015-07-02 József Vass

We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial…

Combinatorics · Mathematics 2007-05-23 Patricia Hersh , Isabella Novik

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

Number Theory · Mathematics 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…

Number Theory · Mathematics 2025-07-08 Runbo Li

The goal of this article is to prove a rigidity result for unicritical polynomials with parabolic cycles. More precisely, we show that if two unicritical polynomials have conformally conjugate parabolic germs, then the polynomials are…

Dynamical Systems · Mathematics 2021-01-19 Luna Lomonaco , Sabyasachi Mukherjee

We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C)…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Thomas Place , Marc Zeitoun