When is an automatic set an additive basis?
From MaRDI portal
Publication:4577830
DOI10.1090/bproc/37zbMath1437.11017arXiv1710.08353OpenAlexW2963125350WikidataQ129451770 ScholiaQ129451770MaRDI QIDQ4577830
Kathryn E. Hare, Jason P. Bell, Jeffrey O. Shallit
Publication date: 3 August 2018
Published in: Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08353
Formal languages and automata (68Q45) Fractals (28A80) Additive bases, including sumsets (11B13) Automata sequences (11B85)
Related Items
Computational aspects of sturdy and flimsy numbers ⋮ Automata and tame expansions of \((\mathbb{Z}, +)\) ⋮ Additive number theory via automata theory ⋮ Unnamed Item ⋮ Automatic Sequences and Generalised Polynomials ⋮ Additive Number Theory via Approximation by Regular Languages ⋮ ADDITIVE BASES AND NIVEN NUMBERS ⋮ A refinement of Christol's theorem for algebraic power series
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of a family of \(k\)-context-free sequences
- On some questions regarding \(k\)-regular and \(k\)-context-free sequences
- Large improvements in Waring's problem
- Logic and \(p\)-recognizable sets of integers
- Periodicity, repetitions, and orbits of an automatic sequence
- Waring's theorem for binary powers
- Some Theorems on Fourier Coefficients
- Sums of Palindromes: an Approach via Automata
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
- On Waring's Problem: Some Refinements
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- A Goldbach Conjecture Using Twin Primes
- Sums of Cantor sets
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Characterizing regular languages with polynomial densities
- Some Direct Decompositions of the Set of Integers
- An Application of Generating Series
- Bounded Regular Sets
- On sums of powers of almost equal primes
