English
Related papers

Related papers: Counting solvable $S$-unit equations

200 papers

In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of…

Algebraic Geometry · Mathematics 2007-05-23 David McKinnon

We provide a new upper bound on the number of conjugacy classes in the group $U_n(q)$ of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of $U_n(q)$.

Group Theory · Mathematics 2015-04-01 Andrew Soffer

New upper and lower limits are given for the number of S-wave bound states yielded by an attractive (monotonic) potential in the context of the Schrodinger or Klein-Gordon equation.

Mathematical Physics · Physics 2009-11-07 F. Brau , F. Calogero

Let $q_1, \ldots , q_t$ be distinct prime numbers. Let $a_1, \ldots , a_t$ be nonnegative integers and $x$ a positive integer. We establish an effective lower bound for the greatest prime divisor of $|x^2 - q_1^{a_1} \ldots q_t^{a_t}|$,…

Number Theory · Mathematics 2025-04-24 Yann Bugeaud

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

We use an estimate of Aksoy Yazici, Murphy, Rudnev and Shkredov (2016) on the number of solutions of certain equations involving products and differences of sets in prime finite fields to give an explicit upper bound on trilinear…

Number Theory · Mathematics 2017-02-10 Giorgis Petridis , Igor E. Shparlinski

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

Algebraic Geometry · Mathematics 2021-01-22 Hao Wen , Chunhui Liu

In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…

Number Theory · Mathematics 2022-03-09 Piotr Miska , Maciej Ulas

We establish some upper and lower bounds for the number of rational points of Prym varieties over finite fields.

Number Theory · Mathematics 2007-06-04 Marc Perret

Let $k$ be a number field and $S$ a finite set of places of $k$ containing the archimedean ones. We count the number of algebraic points of bounded height whose coordinates lie in the ring of $S$-integers of $k$. Moreover, we give an…

Number Theory · Mathematics 2014-09-12 Fabrizio Barroero

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

Combinatorics · Mathematics 2020-12-16 Simon Macourt , Giorgis Petridis , Ilya D. Shkredov , Igor E. Shparlinski

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Number Theory · Mathematics 2018-08-20 Apoloniusz Tyszka

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

Combinatorics · Mathematics 2014-08-01 M. Aaghabali , S. Akbari , S. Friedland , K. Markstrom , Z. Tajfirouz

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Number Theory · Mathematics 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

We establish uniform a-priori estimates for solutions of the semilinear Dirichlet problem \begin{equation} \begin{cases} (-\Delta)^m u=h(x,u)\quad&\mbox{in }\Omega,\\ u=\partial_nu=\cdots=\partial_n^{m-1}u=0\quad&\mbox{on }\partial\Omega,…

Analysis of PDEs · Mathematics 2025-07-23 Gabriele Mancini , Giulio Romani

This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…

Analysis of PDEs · Mathematics 2020-05-21 Martin Fencl , Julián López-Gómez

We apply a variant of the square-sieve to produce a uniform upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over the projective line, whose general fibre is a hyperelliptic…

Number Theory · Mathematics 2021-09-28 Dante Bonolis , Tim Browning

Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…

Number Theory · Mathematics 2015-01-27 Dohyeong Kim

Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates…

Number Theory · Mathematics 2014-02-26 Harm Derksen , David Masser