We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) = 0$ for all $n \geq 0$ then there exists infinitely many $m \in \mathbb{N}$, not divisible by $k$, such that $g(mk^n) = 0$ for some $n \geq 0$. As a consequence, we obtain a complete characterisation of sequences which are simultaneously automatic and generalised polynomial.
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials. In particular, there exist generalised polynomial sequences which take only finitely many values without being periodic; examples of such sequences include the Sturmian words, as well as more complicated sequences like $[ 2\{ πn^2 + \sqrt{2}n[\sqrt{3}n] \}]$. The purpose of this paper is to investigate letter-to-letter codings of finitely-valued generalised p…
We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type. To this end, we introduce the notion of a generalised polynomial on a number field. We establish a connection between the existence of generalised polynomial expressions for sets of values of linear recurrent sequences and for subsemigroups of multiplicative groups of number fields.
We investigate generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) which take the value $0$ on all integers except for a set of density $0$. Our main result is that the set of integers where a sparse generalised polynomial takes non-zero value cannot contain a translate of an IP set. We also study some explicit constructions, and show that the characteristic functions of the Fibonacci and Tribonacci numbers are given by generalised polynomails. Finally, we show that any sufficiently sparse $\{0,1\}$-valued sequence is given by a generalised polyno…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set. In particular, we show that for a polynomial $p(n)$ with at least one irrational coefficient (except for the constant one) and integer $m$, the sequence $\lfloor p(n) \rfloor \bmod{m}$ is never automatic. We also obtain a conditional resul…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set. In particular, we show that for a polynomial $p(n)$ with at least one irrational coefficient (except for the constant one) and integer $m\geq 2$, the sequence $\lfloor p(n) \rfloor \bmod{m}$ is never automatic. We also prove that the conjecture is equ…
For real number $α,$ Generalised Laguerre Polynomials (GLP) is a family of polynomials defined by \begin{align*} L_n^{(α)}(x)=(-1)^n\displaystyle\sum_{j=0}^{n}\binom{n+α}{n-j}\frac{(-x)^j}{j!}. \end{align*}These orthogonal polynomials are extensively studied in Numerical Analysis and Mathematical Physics. In 1926, Schur initiated the study of algebraic properties of these polynomials. We consider the Galois group of Generalised Laguerre Polynomials $ L_n^{(\frac{1}{2}+u)}(x^2)$ when $u$ is a negative integer.
It is a well known result that for $β\in(1,\frac{1+\sqrt{5}}{2})$ and $x\in(0,\frac{1}{β-1})$ there exists uncountably many $(ε_{i})_{i=1}^{\infty}\in {0,1}^{\mathbb{N}}$ such that $x=\sum_{i=1}^{\infty}ε_{i}β^{-i}.$ When $β\in(\frac{1+\sqrt{5}}{2},2]$ there exists $x\in (0,\frac{1}{β-1})$ for which there exists a unique $(ε_{i})_{i=1}^{\infty}\in {0,1}^{\mathbb{N}}$ such that $x=\sum_{i=1}^{\infty}ε_{i}β^{-i}.$ In this paper we consider the more general case when our sequences are elements of ${0,...,m}^{\mathbb{N}}.$ We show that an analogue of the golden ratio exists and give an explicit fo…
We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that Rado's criterion and an intersectivity condition completely characterise which equations of this form admit monochromatic solutions with respect to an arbitrary finite colouring of the positive integers. Furthermore, we obtain a Roth-type theorem for these equations, showing that they admit non-constant solutions over any set of integers with positive upper densi…
We continue our recent work on additive problems with prime summands: we already studied the \emph{average} number of representations of an integer as a sum of two primes, and also considered individual integers. Furthermore, we dealt with representations of integers as sums of powers of prime numbers. In this paper, we study a Cesàro weighted partial \emph{explicit} formula for generalised Hardy-Littlewood numbers (integers that can be written as a sum of a prime power and a square) thus extending and improving our earlier results.
We consider the irreducibility of Generalised Laguerre Polynomials for negative integral values given by $L_n^{(-1-n-s)}(x)=\displaystyle\sum_{j=0}^{n}\binom{n-j+s}{n-j}\frac{x^j}{j!}.$ For different values of $s,$ this family gives polynomials which are of great interest. It was proved earlier that for $0 \leq s \leq 60,$ these polynomials are irreducible over $\mathbb{Q}.$ In this paper we improve this result upto $s \leq 88.$
We use bounds of mixed character sums modulo a prime $p$ to estimate the density of integer points on the hypersurface $$ f_1(x_1) + \ldots + f_n(x_n) =a x_1^{k_1} \ldots x_n^{k_n} $$ for some polynomials $f_i \in {\mathbb Z}[X]$, nonzero integer $a$ and positive integers $k_i$ $i=1, \ldots, n$. In the case of $$ f_1(X) = \ldots = f_n(X) = X^2 \quad \text{and}\quad k_1 = \ldots = k_n =1 $$ the above congruence is known as the Markoff-Hurwitz hypersurface, while for $$ f_1(X) = \ldots = f_n(X) = X^n\quad \text{and}\quad k_1 = \ldots = k_n =1 $$ it is known as the Dwork hypersurface. Our result …
We use bounds of mixed character sums modulo a square-free integer $q$ of a special structure to estimate the density of integer points on the hypersurface $$ f_1(x_1) + \ldots + f_n(x_n) =a x_1^{k_1} \ldots x_n^{k_n} $$ for some polynomials $f_i \in {\mathbb Z}[X]$ and nonzero integers $a$ and $k_i$, $i=1, \ldots, n$. In the case of $$ f_1(X) = \ldots = f_n(X) = X^2\quad \text{and} \quad k_1 = \ldots = k_n =1 $$ the above hypersurface is known as the Markoff-Hurwitz hypersurface, while for $$ f_1(X) = \ldots = f_n(X) = X^n\quad \text{and} \quad k_1 = \ldots = k_n =1 $$ it is known as the Dwor…
We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution of the residues of any fixed number of negative and positive powers of integers in prescribed arithmetic progressions. In particular, we improve and generalise a recent result of Y. Yi and W. Zhang.
A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $Φ_2$ such that $f(t)$ is real-rooted if and only if $Φ_2$ is positive semidefinite. In this note, for every positive integer $m$, an $2m$-adic form $Φ_{2m}$ is constructed such that $f(t)$ is real-rooted if and only if $Φ_{2m}$ is positive semidefinite for some $m$ if and only if $Φ_{2m}(x_1,\ldots, x_n)$ is positive semidefinite for all $m$.
We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$. Under an additional difference condition on the weight function, these sequences can be interpreted as generalised Rudin-Shapiro sequences, and we prove that they have the same correlations of order 2 as sequences of symbols chosen uniformly and independently at random. The speed of convergence is very fast and is independent of the prime factor decomposition …
A generalised Weber function is given by $\w_N(z) = η(z/N)/η(z)$, where $η(z)$ is the Dedekind function and $N$ is any integer; the original function corresponds to $N=2$. We classify the cases where some power $\w_N^e$ evaluated at some quadratic integer generates the ring class field associated to an order of an imaginary quadratic field. We compare the heights of our invariants by giving a general formula for the degree of the modular equation relating $\w_N(z)$ and $j(z)$. Our ultimate goal is the use of these invariants in constructing reductions of elliptic curves over finite fields suit…
We consider the generalised root identities introduced in [1] for simple functions, and also for Γ(z+1) and ζ(s). In this paper, unlike [1], we focus on the case of noninteger μ. For the simplest function f(z)=z, and hence for arbitrary polynomials, we show that they are satisfied for arbitrary real μ (and hence for arbitrary complex μ by analytic continuation). Using this, we then develop an asymptotic formula for the derivative side of the root identities for Γ(z+1) at arbitrary real μ, from which we are able to demonstrate numerically that Γ(z+1) also satisfies the generalised root identiti…
For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper, we find all integers $c$ having at least two representations as a difference between a $k$--generalized Fibonacci number and a powers of 2 for any fixed $k \geqslant 4$. This paper extends previous work from [9] for the case $k=2$ and [6] for the case $k=3$.
We describe a computationally efficient approach to resolving equations of the form $C_1x^2 + C_2 = y^n$ in coprime integers, for fixed values of $C_1$, $C_2$ subject to further conditions. We make use of a factorisation argument and the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier.
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these regular solutions are presented. In particular we see how factors of the four numbers satisfy relations which generalise the Stern-Brocot Tree. There is also an update on the search for rational Diophantine sextuples with five new examples.
We study a refined version of the Linnik problem on the asymptotic behavior of the number of representations of integer $m$ by an integral polynomial as $m$ tends to infinity. We assume that the polynomial arises from invariant theory, and use methods from the theory of unipotent flows.
We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring of integers of $\mathbb{K}$. Our results provide an effective variant of a recent result of A.Bérczes, A.Ostafe, I.E.Shparlinski and J.H.Silverman (arXiv:1811.04971) on multiplicative dependence modulo a finitely generated subgroup by eliminating the use of non-effective results by K.F.Roth and G.Faltings.
Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to prove that certain rational sums involving even powers of those polynomials are integers whenever they are evaluated at integers. This confirms two conjectures of Z.-W. Sun. We also conjecture that many of these results have neat $q$-analogues.
In this paper, we show that for each $n\geq 1$, the generalised Hermite-Laguerre Polynomials $G_{\frac{1}{4}}$ and $G_{\frac{3}{4}}$ are either irreducible or linear polynomial times an irreducible polynomial of degree $n-1$.
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.
The following problem was posed by user "Kevin" on Mathoverflow. How to prove this polynomial always has integer values at all integers? $$P_m(x)=\sum_{i=0}^{m}\sum_{j=0}^{m} \binom{x+j}{j} \binom{x-1}{j} \binom{j}{i} \binom{m}{i} \binom{i}{m-j} \frac{3}{(2i-1)(2j+1)(2m-2i-1)}.$$ We provide an answer.
We obtain a close to the best possible version of the large sieve inequality with amplitudes given by the values of a polynomial with integer coefficients of degree $\geq 2$.
In this article, we study several probabilistic properties of polynomials defined over the ring of $p$-adic integers under the Haar measure. First, we calculate the probability that a monic polynomial is separable, generalizing a result of Polak. Second, we introduce the notion of two polynomials being strongly coprime and calculate the probability of two monic polynomials {being} strongly coprime. Finally, we explain how our method can be used to extrapolate other probabilistic properties of polynomials over the ring of $p$-adic integers from polynomials defined over the integers modulo power…
In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus. We also show that for any positive integer $n$ and any set of $n$ distinct points symmetric with respect to the real line, there is a positive density of integer polynomials of degree $n$, height at most $H$ and Galois group $S_n$ whose roots are close to the given $n$ points.
Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian matrix over some quadratic integer ring. Taking quadratic integer rings as our base, we obtain as characteristic polynomials some low-degree small-span polynomials that are not the characteristic (or minimal) polynomial of any integer symmetric matrix.
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height. Moreover, we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree. For example, the number of monic sextic integer polynomials which are decomposable and of height at most $H$ is asymptotic to $(16ζ(3)-5/4)H^3$ as $H \to \infty$.
We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.
We use ideas from our previous work to obtain some theorems that will allow us to obtain the integer solution of a quadratic polynomial in two variables that represents a natural number
If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of polynomials with integer coefficients (variables ranging through the integers in each case) then (a) implies (b) (obviously), (b) implies (c), and neither converse holds. Condition (b) is equivalent to the set S being the set of integer values taken by some k-tuple of polynomials with rational coefficients as the variables range through the integers. We also show…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $α(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\ (mod\ n)$ is solvable. We describe a method that allows to determine the function $α$ associated to polynomials of the form $c_1x_1^k+c_2x_2^k+\cdots+c_tx_t^k$. Then we apply this method to polynomials that involve sums and differences of squares, mainly to the polynomials $x^2+y^2, x^2-y^2$ and $x^2+y^2+z^2$.
In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In particular, our results imply that the probability that the dominant root assumption holds for a random monic polynomial with integer coefficients tends to 1 in some setting. However, for arbitrary integer polynomials it does not tend to 1. For instance, the proportion of dominant quadratic integer polynomials of height $H$ among all quadratic integer polynomials…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
It is well known, that if polynomial with rational coefficients of degree $n$ takes integer values in points $0,1,...,n$ then it takes integer values in all integer points. Are there sets of $n+1$ points with the same property in other integral domains? We show that answer is negative for the ring of Gaussian integers $\mathbb{Z}[i]$ when $n$ is large enough. Also we discuss the question about minimal possible size of set, such that if polynomial takes integer values in all points of this set then it is integer-valued.
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for various cases, although in general there is a logarithmic gap between lower and upper bounds.
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+ε})$. Strassen's well known factoring approach is a special case of our method. We will also consider a possibility to improve upon the complexity bound.
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).
The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and Smith normal form of integral matrices with integer parameters are also given.
