In this note we compute a constant $N$ that bounds the number of non--primitive divisors in elliptic divisibility sequences over function fields of any characteristic. We improve a result of Ingram--Mah{é}--Silverman--Stange--Streng, 2012, and we show that the constant can be chosen independently of the specific point and to some extent of the specific curve, as predicted in loc. cit.
We prove several statements about arithmetic hyperbolicity of certain blow-up varieties. As a corollary we obtain multiple examples of simply connected quasi-projective varieties that are pseudo-arithmetically hyperbolic. This generalizes results of Corvaja and Zannier obtained in dimension 2 to arbitrary dimension. The key input is an application of the Ru-Vojta's strategy. We also obtain the analogue results for function fields and Nevanlinna theory with the goal to apply them in a future paper in the context of Campana's conjectures.
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials that divide their compositions with every positive integer power. We completely characterize such polynomials in terms of their factorizations into cyclotomic polynomials using labeled Hasse diagrams, and construct new integer divisibility sequences based on them. We also show that, unlike the Fibonacci numbers, these non-classical sequences do not have the p…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition analogous to that of intersective polynomials in the case of integers. We then extend our result to consider linear combinations of such polynomials as well.
It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study the generalized Fibonacci polynomials and classify them in two types depending on their Binet formula. We give a complete characterization for those polynomials that satisfy the strong divisibility property. We also giveformulas to calculate the $\gcd$ of those polynomials that do not satisfy the strong divisibility property. Note. This paper is now published…
Let $f(x) \in \bbz[x]$ and consider the index divisibility set $D = \{n \in \bbn : n \mid f^n(0)\}$. We present a number of properties of $D$ in the case that $(f^n(0))_{n=1}^\infty$ is a rigid divisibility sequence, generalizing a number of results of Chen, Stange, and the first author. We then study the polynomial $x^d + x^e + c \in \bbz[x]$, where $d > e \ge 2$ and determine all cases where this map has a finite index divisibility set.
In this paper, we generalize Bernoulli-Goss polynomials, and give a criterion on the divisibility of zeta functions of cyclotomic function fields. As an application of our criterion, for a given polynomial $f(u)$, we prove that there are infinitely many cyclotomic function fields whose zeta polynomial is divided by $f(u)$.
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 multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients in the polynomial $$ \sum_{k=0}^{n-1}\varepsilon^k(2k+1) S_k^{(r)}(x_0,\ldots,x_k)^m $$ are multiples of $n$. This generalizes a recent result of Pan on the divisibility of sums of Apéry polynomials.
We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new interesting connection between linear divisibility sequences and Salem numbers. Specifically, we generate linear divisibility sequences of order 4 by means of Salem numbers modulo 1.
We study some divisibility properties related to the factors of the discriminant of the characteristic polynomial of generalized Fibonacci sequences $(G_n)_{n\ge0}$ defined by $G_0=0$, $G_1=1$ and $G_n=pG_{n-1}+qG_{n-2}$ for $n\ge2$, where $p,q$ are given integers. As corollaries, we give some divisibility properties on some well known sequences.
In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.
Let $C$ be a smooth genus one curve described by a quartic polynomial equation over the rational field $\mathbb Q$ with $P\in C(\mathbb Q)$. We give an explicit criterion for the divisibility-by-$2$ of a rational point on the elliptic curve $(C,P)$. This provides an analogue to the classical criterion of the divisibility-by-$2$ on elliptic curves described by Weierstrass equations. We employ this criterion to investigate the question of extending a rational $D(q)$-quadruple to a quintuple. We give concrete examples to which we can give an affirmative answer. One of these results implies that a…
We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility Sequence". Our proof is based on an interesting determinant identity related to impulse sequences, arising from the evaluation of a generalized Vandermonde determinant. As a consequence of this new proof we can find a more precise form for the resultant sequence presented in their paper, in the general case of non--degenerate divisibility sequences having minimal …
The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also found a quadratic recursion for the alternating major index $q$-analog of the alternating descent polynomials. As an interesting application of this quadratic recursion, we show that $(1+q)^{\lfloor n/2\rfloor}$ divides $\sum_{π\in\mathfrak{S}_n}q^{\rm{altmaj}(π)}$, where $\mathfrak{S}_n$ is the set of all permutations of $\{1,2,\ldots,n\}$ and $\rm{altmaj}(π…
In this note we shall give conditions which guarantee that $\frac{1-q^b}{1-q^a}{n\brack m}\in\mathbb{Z}[q]$ holds. We shall provide a full characterisation for $\frac{1-q^b}{1-q^a}{ka\brack m}\in\mathbb{Z}[q]$. This unifies a variety of results already known in literature. We shall prove new divisibility properties for the binomial coefficients and a new divisibility result for a certain finite sum involving the roots of the unity.
We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(ζ_1,\ldots,ζ_N)$, where $ζ_1,\ldots,ζ_N$ range over all $n$'th roots of unity with $f(ζ_1,\ldots,ζ_N)\ne0$. More generally, we define $W_Λ(f)$ analogously for any finite subgroup $Λ\subset(\mathbb C^*)^N$. We investigate divisibility, factorization, and growth properties of $W_Λ(f)$ as a function of $Λ$. In particular, we give the complete factorization of $W_Λ(f)$ when $f$ has generic coefficients, and we prove an analytic …
Let $p$ denote an odd prime. In this paper, we are concerned with the $p$-divisibility of additive exponential sums associated to one variable polynomials over a finite field of characteristic $p$, and with (the very close question of) determining the Newton polygons of some families of Artin-Schreier curves, i.e. $p$-cyclic coverings of the projective line in characteristic $p$. We first give a lower bound on the $p$-divisibility of exponential sums associated to polynomials of fixed degree. Then we show that an Artin-Schreier curve defined over a finite field of characteristic $p$ cannot be …
We investigate some aspects of the $m$-division field $K({\mathcal{E}}[m])$, where $\mathcal{E}$ is an elliptic curve defined over a field $K$ with ${\textrm{char}}(K)\neq 2,3$ and $m$ is a positive integer. When $m=p^r$, with $p\geq 5$ a prime and $r$ a positive integer, we prove $K(\mathcal{E}[p^r])=K(x_1,ζ_p,y_2)$, where $\{(x_1, y_1),(x_2,y_2)\}$ is a generating system of ${\mathcal{E}}[p^r]$ and $ζ_p$ is a primitive $p$-th root of the unity. If $\mathcal{E}$ has a $K$-rational point of order $p$, then $K(\mathcal{E}[p^r])=K(ζ_{p^r},\sqrt[m_1]{a})$, with $a\in K(ζ_{p^r})$ and $m_1|p^r$. In…
We provide an elementary proof to a conjecture by Robinson that multiples of (powers of) primes in the Somos-4 sequence are equally spaced. We also show, almost as a corollary, for the generalised Somos-4 sequence defined by $τ_{n+2}τ_{n-2}=ατ_{n+1}τ_{n-1}+βτ_n^2$ and initial values $τ_1=τ_2=τ_3=τ_4=1$, that the polynomial $τ_n(α,β)$ is a divisor of $τ_{n+k(2n-5)}(α,β)$ for all $n,k\in\mathbb Z$ and establish a similar result for the generalized Somos-5 sequence.
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and Kronecker polynomials. Further, we derive some related arithmetic function identities involving the unitary analog of the Dirichlet convolution.
Periods modulo $p$ of integer sequences associated with division polynomials of genus $2$ curves
Institute of Mathematics for Industry, Kyushu University(九州大学产业数学研究所);Department of Mathematics, Faculty of Science, Kyoto University(京都大学理学部数学科);Department of Mathematics, Cooperative Faculty of Education, Gunma University(群马大学教育学部协同数学科);Department of Mathematics, Graduate School of Science, Kobe University(神户大学理学研究数理学科);Department of Mathematical Sciences, Graduate School of Science, Tokyo Metropolitan University(东京都立大学理学研究科数学科学系)
We define the interpolated polynomial multiple zeta values as a generalization of all of multiple zeta values, multiple zeta-star values, interpolated multiple zeta values, symmetric multiple zeta values, and polynomial multiple zeta values. We then compute the generating function of the sum of interpolated polynomial multiple zeta values of fixed weight, depth, and height.
Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $α$ under certain assumptions on $α$. We prove a theorem which introduces an auxiliary polynomial for giving lower bounds on the height of any algebraic number. Our theorem contains, as corollaries, a slight generalization of the above results as well as some new lower bounds in other special cases.
Let $ϕ(x) = x^d + c$ be an integral polynomial of degree at least 2, and consider the sequence $(ϕ^n(0))_{n=0}^\infty$, which is the orbit of $0$ under iteration by $ϕ$. Let $D_{d,c}$ denote the set of positive integers $n$ for which $n \mid ϕ^n(0)$. We give a characterization of $D_{d,c}$ in terms of a directed graph and describe a number of its properties, including its cardinality and the primes contained therein. In particular, we study the question of which primes $p$ have the property that the orbit of $0$ is a single $p$-cycle modulo $p$. We show that the set of such primes is finite wh…
We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting square-free parts of polynomial discriminants via two complementing approaches. In turn, this leads to a lower bound on the number of distinct discriminants of fields generated by roots of polynomials of degree $n$ and height at most $H$. We also give an upper bound for the number of trinomials of bounded height with given square-free part of the discriminant…
In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is called degenerate if it has two distinct roots whose quotient is a root of unity. In particular, our bounds imply that non-degenerate linear recurrence sequences can be generated randomly.
Let K be a number field, X/K a curve, and f/X a family of endomorphisms of projective N-space. It follows from a result of Call and Silverman that the canonical height associated to the family f, evaluated along a section, differs from a Weil height on the base by little-o of a Weil height. In the case where f is a family with an invariant hyperplane, whose restriction to this invariant hyperplane is isotrivial, we improve this by showing that the canonical height along a section differs from a Weil height on the base by a bounded amount.
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 well-known bounds obtained from interpolation algorithms given values at $d+1$ (resp. $2d+1$) points, and obtain tighter results when considering a larger number of evaluation points.
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and the number of places of bad reduction.
Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to problems involving the Weil height. The height appears as a solution to a certain extremal problem involving polynomials. We further generalize the above techniques to acquire both the projective height and the height on subspaces in the same way. We further obtain lower bounds on the heights of points on some subvarieties of $\mathbb P^{N-1}(\overline{\mathbb Q})$…
We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical results along this line. Our theorems are closely related to earlier results of Akiyama and Pethő, and also yield extensions of recent results of Dubickas and Sha.