In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above Diophantine system has an integer parametric solution for $f(X)=X(X+a)$ with nonzero integers $a$, if there are integers $m,n,k$ such that \[\begin{cases} \begin{split} (n^2-m^2) (4mnk(k+a+1) + a(m^2+2mn-n^2)) &\equiv0\pmod{(m^2+n^2)^2},\\ (m^2+2mn-n^2) ((m^2-2mn-n^2)k(k+a+1) - 2amn) &\equiv0 \pmod{(m^2+n^2)^2}, \end{split} \end{cases}\] where $k\equiv0\pmod{4}$ when $a$ is even, and $k\equiv2\pmod{4}$ when $a$ is odd. Third, we get that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)=\frac{f(r)}{f(s)}\] has a five-parameter rational solution for $f(X)=X(X+a)$ with nonzero rational number $a$ and infinitely many nontrivial rational parametric solutions for $f(X)=X(X+a)(X+b)$ with nonzero integers $a,b$ and $a\neq b$. At last, we raise some related questions.
In this note we prove that certain polynomial mappings $P_\mathfrak{g}^k(\mathbf{x}) \in \mathbf{Z}[\mathbf{x}]$ in $n$-variables obtained from simple complex Lie algebras $\mathfrak{g}$ of arbitrary rank $n \ge 1$, are exceptional.
In this paper we prove Hasse local-global principle for polynomials with coefficients in Mordell-Weil type groups over number fields like S-units, abelian varieties with trivial ring of endomorphisms and odd algebraic K-theory groups.
We study the variance of sums of the indicator function of square-full polynomials in both arithmetic progressions and short intervals. Our work is in the context of the ring $F_{q}[T]$ of polynomials over a finite field $F_{q}$ of $q$ elements, in the limit $q\rightarrow\infty$. We use a recent equidistribution result due to N. Katz to express these variances in terms of triple matrix integrals over the unitary group, and evaluate them.
In this paper, we derive a new computational algorithm for Barrett technique for modular polynomial multiplication, termed BA-P. BA-P is then applied to a new residue arithmetic based Barrett algorithm for modular polynomial multiplication (BA-MPM). The focus of the work is an algorithm that carries out the entire computation using only modular arithmetic without conversion to large degree polynomials. There are several parts to this work. First, we set up a new BA-P using polynomials other than u^alfa. Second, residue arithmetic based BA-MPM is described. A complete mathematical framework is …
The modified Bernoulli numbers \begin{equation*} B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 \end{equation*} introduced by D. Zagier in 1998 were recently extended to the polynomial case by replacing $B_{r}$ by the Bernoulli polynomials $B_{r}(x)$. Arithmetic properties of the coefficients of these polynomials are established. In particular, the 2-adic valuation of the modified Bernoulli numbers is determined. A variety of analytic, umbral, and asymptotic methods is used to analyze these polynomials.
We determine necessary conditions for when powers corresponding to positive/negative coefficients of $Φ_{n}$ are in arithmetic progression. When $n = pq$ for any primes $q>p>2$, our conditions are also sufficient. Finally, we generalize the result when $n = pq$ to the so-called inclusion-exclusion polynomials first introduced by Bachman.
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of irreducible factors, the number of irreducible factors, as well as for the number of such sequences of fixed length in which all the polynomials are irreducible.
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive to the combinatorics of partitions of the integers. The representing elements are recursive sequences of Schur polynomials evaluated at subrings of the complex numbers. The multiplicative arithmetic functions are units in the Dirichlet ring of arithmetic functions, and their properties can be described locally, that is, at each prime number $p$. Our represe…
This is the second paper in a series of two in which a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. In this paper, to any real number $θ$ we associate its polynomial diophantine approximation ring: a tri-filtered subring of a nonstandard model of the ring $\mathbb{Z}[X]$. We characterize the filtration structure of the polynomial diophantine approximation ring according to the Mahler class and the Mahler type of $θ$. The arithmetic of polynomial diophantine approximation groups is intro…
For each integer $n\geq 1$ we consider the unique polynomials $P, Q\in\mathbb{Q}[x]$ of smallest degree $n$ that are solutions of the equation $P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$. We derive numerous properties of these polynomials and their derivatives, including explicit expansions, differential equations, recurrence relations, generating functions, resultants, discriminants, and irreducibility results. We also consider some related polynomials and their properties.
In 1997 the author found a criterion for the Riemann hypothesis for the Riemann zeta function, involving the nonnegativity of certain coefficients associated with the Riemann zeta function. In 1999 Bombieri and Lagarias obtained an arithmetic formula for these coefficients using the ``explicit formula'' of prime number theory. In this paper, the author obtains an arithmetic formula for corresponding coefficients associated with the Euler product of Hecke polynomials, which is essentially a product of L-functions attached to weight 2 cusp forms (both newforms and oldforms) over Hecke congruence…
Let $\mathbb{A}=\mathbb{F}_{q}[T]$ be the polynomial ring over finite field $\mathbb{F}_{q}$, and $\mathbb{A}_{+}$ be the set of monic polynomials in $\mathbb{A}$. In this paper, we show that a large class of arithmetic functions in multi-variables over $\mathbb{A}_{+}$ can be expanded through the polynomial Ramanujan sums and the unitary polynomial Ramanujan sums. These are analogues of classical results over $\mathbb{N}$ by Winter, Delange and Tóth.
Inspired by Rearick (1968), we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving generalized Lucas polynomials. The EXP is the inverse of LOG. In particular, LOG takes a convolution product of generalized Fibonacci polynomials to a sum of generalized Lucas polynomials and EXP takes the sum to the convolution product. We use this structure to produce a theory of logarithms and exponentials within arithmetic functions giving another proof of the fact that the group of multiplicative functions under convolution product is isomorphic to the grou…
Fekete polynomials associate with each prime number $p$ a polynomial with coefficients $-1$ or $1$ except the constant term, which is 0. These coefficients reflect the distribution of quadratic residues modulo $p$. These polynomials were first considered in the 19th century in relation to the studies of Dirichlet $L$-functions. In our paper, we introduce two closely related polynomials. We then express their special values at several integers in terms of certain class numbers and generalized Bernoulli numbers. Additionally, we study the splitting fields and the Galois group of these polynomial…
For rings $\mathcal{O}_K$ of totally real algebraic integers, J. Robinson defined a set which is always $\{+\infty\}$ or of the form $[λ,+\infty)$ or $(λ,+\infty)$ for some real number $λ\ge4$. All known examples give either $\{+\infty\}$ or $[4,+\infty)$. In this paper, we construct infinitely many fields such that the set is an interval, but not equal to $[4,+\infty)$.
We investigate from a statistical perspective the arithmetic properties of the dynamics of polynomials of fixed degree and defined over the field of rational numbers. To start with, ordering their affine conjugacy classes by height, we show that their average number of rational preperiodic points is equal to zero, thereby proving a strong average version of the uniform boundedness conjecture of Morton and Silverman. Next, inspired by the analogy with the successive minima of a lattice we define the dynamical successive minima of a polynomial. Noting that these quantities are invariant under th…
In this paper we investigate growth properties and the zero distribution of polynomials attached to arithmetic functions $g$ and $h$, where $g$ is normalized, of moderate growth, and $0<h(n) \leq h(n+1)$. We put $P_0^{g,h}(x)=1$ and \begin{equation*} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation*} As an application we obtain the best known result on the domain of the non-vanishing of the Fourier coefficients of powers of the Dedekind $η$-function. Here, $g$ is the sum of divisors and $h$ the identity function. Kostant's result on the representation of si…
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must have density zero, regardless of choice of a_0. The proof relies on tools from group theory and probability theory to develop a zero-density criterion in terms of arithmetic properties of the forward orbit of the critical point of f. This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critica…
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A direct generalization of Bernoulli numbers and their polynomials follows. On the way to find the Faulhaber formula for these sums of powers in terms of generalized Bernoulli polynomials one is led to a one parameter generalization of Bernoulli numbers and their polynomials. Generalized Lah numbers are also considered.
We calculate the mean and variance of sums of the Möbius function and the indicator function of the squarefrees, in both short intervals and arithmetic progressions, in the context of the ring of polynomials over a finite field of $q$ elements, in the limit $q\to \infty$. We do this by relating the sums in question to certain matrix integrals over the unitary group, using recent equidistribution results due to N. Katz, and then by evaluating these integrals. In many cases our results mirror what is either known or conjectured for the corresponding problems involving sums over the integers, whi…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and power sum symmetric polynomials. We investigate properties of these families and focus on constructing their rational roots under a product induced by convolution. A direct application of the latter is to the description of the roots of certain multiplicative arithmetic functions (the core functions) under the convolution product.
We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: $B_{0}(t)=0, B_{1}(t)=1, B_{2n}(t)=tB_{n}(t)$, and $B_{2n+1}(t)=B_{n}(t)+B_{n+1}(t)$. We study also the sequence $e(n)=\op{deg}_{t}B_{n}(t)$ and give various of its properties.
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider rational roots. This leads to the study of an infinite class of integer sequences which have interesting properties and satisfy linear recurrence relations.
The $(u,v)$-Padé approximation to a function $f$ is the (unique, up to scaling) rational approximation $f(x) = P(x)/Q(x) + O(x^{u+v+1})$, where $P$ has degree $u$ and $Q$ has degree $v$. Motivated by recent work of Molin, Pazuki, and Rabarison, we study the arithmetic of the Padé approximants of the exponential polynomials. By viewing the approximants as certain Generalized Laguerre Polynomials, we determine the Galois groups of the diagonal approximants and prove some special cases of irreducibility.
The purpose of this paper consists to study the sums of the type $P(n) + P(n - d) + P(n - 2 d) + \dots$, where $P$ is a real polynomial, $d$ is a positive integer and the sum stops at the value of $P$ at the smallest natural number of the form $(n - k d)$ ($k \in \mathbb{N}$). Precisely, for a given $d$, we characterize the $\mathbb{R}$-vector space ${\mathscr{E}}_d$ constituting of the real polynomials $P$ for which the above sum is polynomial in $n$. The case $d = 2$ is studied in more details. In the last part of the paper, we approach the problem through formal power series; this inspires …
An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an application, in Section 2, we give an interesting characterization of Mersenne numbers.
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of this conjecture for polynomial rings over pseudo algebraically closed fields. This implies results over large finite fields. A main tool in the proof is an irreducibility theorems à la Hilbert.
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic polynomial, computed using any faitfhful representation, has Galois group isomorphic to the Weyl group of the underlying algebraic group. Besides tools such as the large sieve, which we had already used, we introduce some probabilistic ideas (large deviation estimates for finite Markov chains) and the general case involves a more precise understanding of the way…
Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $θ$ be a generator of the cyclic group $\mathbb F_q^*$. For each $a\in \mathbb F_q^*$, let $\log_θ a$ be the unique integer $i\in \{1, \ldots, q-1\}$ such that $a=θ^i$. Given polynomials $P_1, \ldots, P_k\in \mathbb F_q[x]$ and divisors $1<d_1, \ldots, d_k$ of $q-1$, we discuss the distribution of the functions $$F_{i}:y\mapsto \log_θP_i(y)\pmod {d_i}, $$ over the set $\mathbb F_q\setminus \cup_{i=1}^k\{y\in \mathbb F_q\,|\, P_i(y)=0\}$. Our main result entails that, under a natural multiplicative conditi…
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 prime variant can be interpreted as a multi-dimensional, polynomial extension of Linnik's Theorem. This version is a revision of the published version. Most notably, the properness hypotheses have been removed from Theorems 2 and 3, and the numerology in Theorem 2 has been improved.
In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)_{\ell} on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to compute the denominators of Igusa class polynomials, which has important applications to the construction of genus 2 curves for use in cryptography. Bruinier and Yang conjectured a formula for intersection numbers on an arithmetic Hilbert modular surface, and as a consequence obtained a conjectural formula for the intersection number (CM(K).G1)_{\ell} under str…
Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results between the number of partitions of an integer $n$ whose parts are taken from the sequence $\{f(\ell)\}_{\ell=1}^{\infty}$ and the number of parts of those partitions which are in a certain arithmetic progression.
Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th coefficient in the polynomial $B_{n}(t)$ counts the number of hyperbinary representations of $n-1$ containing exactly $i$ digits 1. In this note we investigate the existence of odd solutions of the congruence \begin{equation*} B_{n}(t)\equiv 1+rt\frac{t^{e(n)}-1}{t-1}\pmod{m}, \end{equation*} where $m\in\N_{\geq 2}$ and $r\in\{0,\ldots,m-1\}$ are fixed and $e(n)=\op{…
We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation} For special $g$ and $h$, we obtain the D'Arcais polynomials, which are equal to the coefficients of the $-z$th powers of the Dedekind $η$-function and are also given by Nekrasov and Okounkov as a hook length formula. Examples are offered by Pochhammer polynomials, Chebyshev polynomials of the second kind, and associated Laguerre polynomials. We present explici…
We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that polynomials are $0,-1,-1/2,-1/3$. We give complete characterization of $n$ such that $deg( B_n) = deg( B_{n+1}) $ and $deg( B_n) =deg( B_{n+1}) =deg( B_{n+2}) $. Moreover, we present some result concerning reciprocal Stern polynomials.
We reformulate Lehmer's question from 1933 and a question due to Schinzel and Zassenhaus from 1965 in terms of a comparison of the Mahler measures and the houses, respectively, of monic integer reciprocal and skew-reciprocal polynomials of the same degree. This entails that understanding the difference between orientation-preserving and orientation-reversing mapping classes is at least as complicated as answering these questions.
We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by $a_i$ the coefficient of $q^i$ in the above polynomial and suppose that $b$ is an integer. We prove that $$\Big|\sum_{i\equiv b\ \text{mod}\ 2pn}a_i-\frac{v(b)p^{sn}}{2pn}\Big|\leq p^{sn/2},$$ where $v(b)=p-1$ if $b$ divisible by $p$ and $v(b)=-1$ otherwise. This improves a recent result of Goswami and Pantangi.
Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work of Kedlaya and Umans about modular composition of polynomials, we achieve quasi-linear time algorithms in the parameters n and N, and quasi-linear or quasi-quadratic time in log p, for most basic operations on these fields, including Galois conjugation, Teichmuller lifting and computing minimal polynomials.
Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence $\{e(n)\}_{n=1}^{\infty}$. We also study the sequence $d(n)=\op{ord}_{t=0}B_{n}(t)$. Among other things we prove that $d(n)=ν(n)$, where $ν(n)$ is the maximal power of 2 which dividies the number $n$. We also count the number of the solutions of the equations $e(m)=i$ and $e(m)-d(m)=i$ in the interval $[1,2^{n}]$. We also obtain an interesting closed expression for a …
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$ in $\mathbb{P}^r$. By means of a study of the finite dimensional vector spaces of global sections, we reduce the problem of constructing and finding efficiently computable polynomial maps defining the addition morphism or isogenies to linear algebra. We demonstrate the effectiveness of the method by improving the best known complexity for doubling and tripli…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first is a recursion formula for the $n$-diameter of an interval, which uses properties of Jacobi polynomials. The second is a numerical criterion which allows one to the give a bound on the degree of any algebraic integer having all of its complex embeddings in a real interval of length less than $4$.
We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this result the dynamical André-Oort conjecture for curves in the moduli space of polynomials, by describing one-dimensional families in this parameter space containing infinitely many post-critically finite parameters.
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends to infinity. We then adapt this method to count such polynomials in arithmetic progressions and short intervals, and by making use of Weil's `Riemann hypothesis' for curves over $\mathbb{F}_q$, obtain better ranges for these formulae than are currently known for their analogues in the number field setting. Finally, we briefly discuss the regime in which $q$ t…
