English
Related papers

Related papers: An explicit height bound for the classical modular…

200 papers

We obtain explicit upper and lower bounds on the size of the coefficients of the Drinfeld modular polynomials $\Phi_N$ for any monic $N\in\mathbb{F}_q[t]$. These polynomials vanish at pairs of $j$-invariants of Drinfeld…

Number Theory · Mathematics 2024-10-16 Florian Breuer , Fabien Pazuki , Zhenlin Ran

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…

Algebraic Geometry · Mathematics 2022-03-09 Jean Kieffer

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Number Theory · Mathematics 2007-05-23 N. A. Carella

In 2006, Kawaguchi proved a lower bound for height of h(f(P)) when f is a regular affine automorphism of A^2, and he conjectured that a similar estimate is also true for regular affine automorphisms of A^n for n>2. In this paper we prove…

Number Theory · Mathematics 2009-09-18 ChongGyu Lee

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

We give an example of a polynomial of degree 4 in 5 variables that is the sum of squares of 8 polynomials and cannot be decomposed as the sum of 7 squares. This improves the current existing lower bound of 7 polynomials for the Pythagoras…

Algebraic Geometry · Mathematics 2023-06-12 Santiago Laplagne

Given polynomials $f_1,\ldots,f_n$ in $m$ variables with integral coefficients, we give upper bounds for the number of integral $m$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_n$ of bounded height such that $f_1(\mathbf{u}_1), \ldots,…

Number Theory · Mathematics 2024-02-22 Marley Young

We provide a direct computation of the $F$-pure threshold of degree four homogeneous polynomial in two variables and, more generally, of certain homogeneous polynomials with four distinct roots. The computation depends on whether the cross…

Commutative Algebra · Mathematics 2022-07-28 Gilad Pagi

Let F be a Siegel cusp form of weight k and genus n>1 with Fourier-Jacobi coefficients f_m. In this article, we estimate the growth of the Petersson norms of f_m, where m runs over an arithmetic progression. This result sharpens a recent…

Number Theory · Mathematics 2013-12-06 Sanoli Gun , Narasimha Kumar

Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7…

Algebraic Geometry · Mathematics 2007-09-18 Joel Gomez , Andrew Niles , J. Maurice Rojas

A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…

Number Theory · Mathematics 2015-01-23 Shigeki Akiyama , Jörg M. Thuswaldner , Toufik Zaïmi

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x\in \mathbb{R}^n:\, A x =…

Optimization and Control · Mathematics 2026-02-12 Bento Natura

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

Number Theory · Mathematics 2011-11-24 Lola Thompson

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

Commutative Algebra · Mathematics 2020-07-15 William Simmons , Henry Towsner

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup…

Number Theory · Mathematics 2022-07-28 Hutao Song , Hua Guo , Xiyong Zhang , Yapeng Wu , Jianwei Liu

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

Numerical Analysis · Computer Science 2016-06-09 Terence Coelho , Bahman Kalantari

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

Number Theory · Mathematics 2025-11-10 Nicolae Ciprian Bonciocat