English
Related papers

Related papers: The Least Common Multiple of Polynomial Values ove…

200 papers

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

Computational Complexity · Computer Science 2020-05-04 Xiaoming Sun , Yuan Sun , Jiaheng Wang , Kewen Wu , Zhiyu Xia , Yufan Zheng

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

Number Theory · Mathematics 2025-12-23 Nicole R. Looper

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…

Classical Analysis and ODEs · Mathematics 2021-10-13 el Houcein el Abdalaoui

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Algebraic Geometry · Mathematics 2013-10-08 Robert M. Guralnick , Michael E. Zieve

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

Number Theory · Mathematics 2021-11-30 P Vanchinathan , Krithika M

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Number Theory · Mathematics 2024-01-24 Clemens Fuchs , Vincenzo Mantova , Umberto Zannier

In 1938, Skolem conjectured that $\mathbf{SL}_n(\mathbb{Z})$ is not a polynomial family for any $n \ge 2$. Carter and Keller disproved Skolem's conjecture for all $n \ge 3$ by proving that $\mathbf{SL}_n(\mathbb{Z})$ is boundedly generated…

Number Theory · Mathematics 2015-11-05 Dong Quan Ngoc Nguyen

Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no…

Number Theory · Mathematics 2010-08-12 Greg Martin , Charles L. Samuels

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

Rings and Algebras · Mathematics 2007-05-23 A. P. Petravchuk , O. G. Iena

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett

This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…

Classical Analysis and ODEs · Mathematics 2020-04-21 K. A. Kopotun , D. Leviatan , I. Petrova , I. A. Shevchuk

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Group Theory · Mathematics 2020-11-30 Gioacchino Antonelli , Enrico Le Donne

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

We study the function field analogue of Shanks bias. For Liouville function $\lambda(f)$, we compare the number of monic polynomials $f$ with $\lambda(f) \chi_m(f) = 1$ and $\lambda(f) \chi_m(f) = -1$ for a nontrivial quadratic character…

Number Theory · Mathematics 2025-12-22 Seewoo Lee

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

Number Theory · Mathematics 2022-04-25 Ofir Gorodetsky

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

Number Theory · Mathematics 2010-11-23 Liping Wang , Qiang Wang

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault