Sparse generalised polynomials

DOI10.1090/TRAN/7257zbMATH Open1443.11136arXiv1612.00073OpenAlexW2963635811MaRDI QIDQ4586339FDOQ4586339

Authors: Jakub Byszewski, Jakub Konieczny 

Publication date: 13 September 2018

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: 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 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.)

Full work available at URL: https://arxiv.org/abs/1612.00073

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

zbMATH Keywords

Tribonacci numberssparse generalised polynomial

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Ergodic theory. With a view towards number theory
• Invariant measures and the set of exceptions to Littlewood's conjecture
• An ergodic Szemerédi theorem for IP-systems and combinatorial theory
• Best simultaneous Diophantine approximations. II: Behavior of consecutive best approximations
• Uniform distribution of generalized polynomials
• Finite sums from sequences within cells of a partition of N
• Ultrafilters, IP sets, dynamics, and combinatorial number theory
• Sur les groupes nilpotents et les anneaux de Lie
• Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials
• The quantitative behaviour of polynomial orbits on nilmanifolds
• Title not available (Why is that?)
• Ergodic Properties of Affine Transformations and Flows on Nilmanifolds
• Pointwise convergence of ergodic averages for polynomial sequences of translations on a nilmanifold
• Pointwise convergence of ergodic averages for polynomial actions of $\mathbb{Z}^{d}$ by translations on a nilmanifold
• Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
• Uniformity in the Wiener-Wintner theorem for nilsequences
• Polynomial sequences in groups
• Polynomial mappings of groups
• Distribution of values of bounded generalized polynomials
• A short proof of Hindman's theorem
• Title not available (Why is that?)
• Norm form equations
• Best simultaneous Diophantine approximations and multidimensional continued fraction expansions
• Best simultaneous diophantine approximations of Pisot numbers and Rauzy fractals
• Polynomials Involving the Floor Function.
• Uniform distribution of generalized polynomials of the product type
• A canonical form and the distribution of values of generalized polynomials
• Factors of generalised polynomials and automatic sequences

Cited In (14)

• Sparse shifts for univariate polynomials
• Title not available (Why is that?)
• 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)