English
Related papers

Related papers: Rational values of transcendental functions and ar…

200 papers

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…

Algebraic Geometry · Mathematics 2011-04-14 Stéphane Ballet , Robert Rolland

Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…

Number Theory · Mathematics 2026-05-14 Henry Shin

We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…

Symbolic Computation · Computer Science 2025-05-13 Manuel Kauers , Raphael Pages

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

Algebraic Geometry · Mathematics 2024-08-27 Rida Ait El Manssour , Anna-Laura Sattelberger , Bertrand Teguia Tabuguia

In this paper, we show the existence of a transcendental function $f\in\mathbb{Z}\{z\}$ with coefficients that are almost all bounded such that $f$ and all its derivatives assume algebraic values at algebraic points. Furthermore, we…

Number Theory · Mathematics 2025-02-25 Ricardo Francisco , Diego Marques

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

Symbolic Computation · Computer Science 2021-06-18 Xavier Caruso , Marc Mezzarobba , Nobuki Takayama , Tristan Vaccon

In an earlier work, the first author and Petsche used potential theoretic techniques to establish a lower bound for the height of algebraic numbers that satisfy splitting conditions, such as being totally real or p-adic, improving on…

Number Theory · Mathematics 2021-05-11 Paul Fili , Lukas Pottmeyer

In this paper we obtain estimates for certain transcendence measures of an entire function $f$. Using these estimates, we prove Bernstein, doubling and Markov inequalities for a polynomial $P(z,w)$ in ${\Bbb C}^2$ along the graph of $f$.…

Complex Variables · Mathematics 2007-05-23 Dan Coman , Evgeny A. Poletsky

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin…

Number Theory · Mathematics 2025-02-11 Ignazio Longhi , Nadir Murru , Francesco Maria Saettone

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…

Computational Complexity · Computer Science 2016-05-16 Michael A. Forbes , Mrinal Kumar , Ramprasad Saptharishi

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

Number Theory · Mathematics 2012-04-10 Martin Widmer

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

Combinatorics · Mathematics 2025-10-30 Christof Beierle , Tim Beyne

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

Combinatorics · Mathematics 2026-03-06 Mizuki Akeno

In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…

Number Theory · Mathematics 2022-12-08 Bakir Farhi

We study the Dehn function at infinity in the mapping class group, finding a polynomial upper bound of degree four. This is the same upper bound that holds for arbitrary right-angled Artin groups.

Group Theory · Mathematics 2012-05-04 Aaron Abrams , Noel Brady , Pallavi Dani , Moon Duchin , Robert Young

We consider complex projective schemes $X\subset\Bbb{P}^{r}$ defined by quadratic equations and satisfying a technical hypothesis on the fibres of the rational map associated to the linear system of quadrics defining $X$. Our assumption is…

Algebraic Geometry · Mathematics 2010-07-01 Alberto Alzati , José Carlos Sierra

In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…

Number Theory · Mathematics 2015-07-08 Paul Fili , Igor Pritsker

We prove a lower bound of $\Omega\left(n^{1.5}\right)$ for the number of product gates in non-commutative arithmetic circuits for an explicit $n$-variate degree-$n$ polynomial $f_{n}$ (over every field). We observe that this implies that…

Computational Complexity · Computer Science 2026-04-27 Ran Raz