English
Related papers

Related papers: Automatic sequences and generalised polynomials

200 papers

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…

Number Theory · Mathematics 2022-07-29 Yves Aubry , Fabien Herbaut , Ali Issa

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…

Number Theory · Mathematics 2009-02-06 Robert L. Benedetto , Dragos Ghioca , Par Kurlberg , Thomas J. Tucker

Let $T$ be a power bounded Hilbert space operator without unimodular eigenvalues. We show that the subsequential ergodic averages $N^{-1}\sum_{n=1}^N T^{a_n}$ converge in the strong operator topology for a wide range of sequences $(a_n)$,…

Functional Analysis · Mathematics 2020-08-19 Tanja Eisner , Vladimir Müller

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

Number Theory · Mathematics 2018-12-18 Mohammad Javaheri

We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type $e_q(f(n))$, where $f$ is a rational fraction, in the P\'olya-Vinogradov range. This applies to Kloosterman sums, and may be used to study…

Number Theory · Mathematics 2017-10-04 Sary Drappeau , Clemens Müllner

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

Probability · Mathematics 2012-08-17 Daniel M. Kane

We establish that the sequences formed by logarithms and by "fractional" powers of integers, as well as the sequence of prime numbers, are non-holonomic, thereby answering three open problems of Gerhold [Electronic Journal of Combinatorics…

Combinatorics · Mathematics 2008-02-28 Philippe Flajolet , Stefan Gerhold , Bruno Salvy

The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Michel Rigo , Manon Stipulanti

Let ${\nu}_q(n)$ be the p-adic valuation of $n$. We show that the power series with coefficients ${\nu}_q(n)$, respectively ${\nu}_p(n)(\mathrm{ mod\;} k)$, are non-holonomic and not algebraic in characteristic 0. We find infinitely many…

Number Theory · Mathematics 2024-12-24 Cristian Cobeli , Mihai Prunescu , Alexandru Zaharescu

This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…

Group Theory · Mathematics 2016-05-12 J. C. Birget

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.…

Combinatorics · Mathematics 2022-11-23 Boris Adamczewski , Jakub Konieczny

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bryna Kra

A collection of integer sequences is jointly ergodic if for every ergodic measure preserving system the multiple ergodic averages, with iterates given by this collection of sequences, converge in the mean to the product of the integrals. We…

Dynamical Systems · Mathematics 2023-02-06 Nikos Frantzikinakis

We study mean convergence of multiple ergodic averages, where the iterates arise from smooth functions of polynomial growth that belong to a Hardy field. Our results include all logarithmico-exponential functions of polynomial growth, such…

Dynamical Systems · Mathematics 2023-03-13 Konstantinos Tsinas

We consider a sequence $(p_n)_{n=1}^\infty$ of polynomials with uniformly bounded zeros and $\deg p_1\geq 1$, $\deg p_n\geq 2$ for $n\geq 2$, satisfying certain asymptotic conditions. We prove that the function sequence $\left(\frac{1}{\deg…

Complex Variables · Mathematics 2025-04-01 Marta Kosek , Malgorzata Stawiska

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

Probability · Mathematics 2024-09-24 Jürgen Angst , Oanh Nguyen , Guillaume Poly

We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses…

Number Theory · Mathematics 2008-10-27 E. Byrne , G. McGuire