Sparse generalised polynomials
From MaRDI portal
Publication:4586339
Continued fractions and generalizations (11J70) Measure-preserving transformations (28D05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Distribution modulo one (11J71) Small fractional parts of polynomials and generalizations (11J54) Relations between ergodic theory and number theory (37A44)
Abstract: We investigate generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) which take the value on all integers except for a set of density . 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 -valued sequence is given by a generalised polynomial. (This paper is essentially the first half of our earlier submission arXiv:1610.03900 [math.NT]. Because the material in arXiv:1610.03900 [math.NT] touches upon many different subjects, we believe it is preferable to split it into two independent papers.)
Recommendations
- Automatic sequences and generalised polynomials
- A canonical form and the distribution of values of generalized polynomials
- Factors of generalised polynomials and automatic sequences
- An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications
- scientific article; zbMATH DE number 936375
Cites work
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 1522525 (Why is no real title available?)
- scientific article; zbMATH DE number 3191379 (Why is no real title available?)
- A canonical form and the distribution of values of generalized polynomials
- A short proof of Hindman's theorem
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- Best simultaneous Diophantine approximations and multidimensional continued fraction expansions
- Best simultaneous Diophantine approximations. II: Behavior of consecutive best approximations
- Best simultaneous diophantine approximations of Pisot numbers and Rauzy fractals
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Distribution of values of bounded generalized polynomials
- Ergodic Properties of Affine Transformations and Flows on Nilmanifolds
- Ergodic theory. With a view towards number theory
- Factors of generalised polynomials and automatic sequences
- Finite sums from sequences within cells of a partition of N
- Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials
- Invariant measures and the set of exceptions to Littlewood's conjecture
- Norm form equations
- Pointwise convergence of ergodic averages for polynomial actions of $\mathbb{Z}^{d}$ by translations on a nilmanifold
- Pointwise convergence of ergodic averages for polynomial sequences of translations on a nilmanifold
- Polynomial mappings of groups
- Polynomial sequences in groups
- Polynomials Involving the Floor Function.
- Sur les groupes nilpotents et les anneaux de Lie
- The quantitative behaviour of polynomial orbits on nilmanifolds
- Ultrafilters, IP sets, dynamics, and combinatorial number theory
- Uniform distribution of generalized polynomials
- Uniform distribution of generalized polynomials of the product type
- Uniformity in the Wiener-Wintner theorem for nilsequences
Cited in
(14)- Sparse shifts for univariate polynomials
- scientific article; zbMATH DE number 1210952 (Why is no real title available?)
- Generalised polynomials and integer powers
- Automatic sequences and generalised polynomials
- Sparse power series and parameterized linear operators
- Sparse squares of polynomials
- Sparse multiplication for skew polynomials
- On asymptotically automatic sequences
- Fractional parts of generalized polynomials at prime arguments
- Fast construction of constant bound functions for sparse polynomials
- Global residues for sparse polynomial systems
- Sparse polynomial prediction
- Polynomials whose powers are sparse
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
This page was built for publication: Sparse generalised polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586339)
