Decidability of extensions of Presburger arithmetic by generalised polynomials
We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.
math.NT↗
arXiv subjects
Jakub Konieczny
Publications and source records attributed to Jakub Konieczny.
Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions
We study the extension of Presburger arithmetic by the class of sub-polynomial Hardy field functions, and show the majority of these extensions to be undecidable. More precisely, we show that the theory $\mathrm{Th}(\mathbb{Z}; <, +, \lfloor f \rceil)$, where $f$ is a Hardy field function and $\lfloor \cdot \rceil$ the nearest integer operator, is undecidable when $f$ grows polynomially faster than $x$. Further, we show that when $f$ grows sub-linearly quickly, but still as fast as some polynomial, the theory $\mathrm{Th}(\mathbb{Z}; <, +, \lfloor f \rceil)$ is undecidable.
cs.LO↗
On the growth of hypergeometric sequences
Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear growth estimates on their Weil heights. We give an application of our effective results towards the Membership Problem from Computer Science. Recall that Membership asks to procedurally determine whether a specified target is an element of a given recurrence sequence.
math.NT↗
Minimal and proximal examples of $\bar{d}$-stable and $\bar{d}$-approachable shift spaces
We study shift spaces over a finite alphabet that can be approximated by mixing shifts of finite type in the sense of (pseudo)metrics connected to Ornstein's $\bar{d}$ metric ($\bar{d}$-approachable shift spaces). The class of $\bar{d}$-approachable shifts can be considered as a topological analog of measure-theoretical Bernoulli systems. The notion of $\bar{d}$-approachability together with a closely connected notion of $\bar{d}$-shadowing were introduced by Konieczny, Kupsa, and Kwietniak [in \emph{Ergodic Theory and Dynamical Systems}, vol. \textbf{43} (2023), issue 3, pp. 943--970]. These notions were developed with the aim to significantly generalize specification properties. Indeed, many popular variants of the specification property, including the classic one and almost/weak specification property ensure $\bar{d}$-approachability and $\bar{d}$-shadowing. Here, we study further properties and connections between $\bar{d}$-shadowing and $\bar{d}$-approachability. We prove that $\bar{d}$-shadowing implies $\bar{d}$-stability (a notion recently introduced by Tim Austin). We show that for surjective shift spaces with the $\bar{d}$-shadowing property the Hausdorff pseudodistance $\bar{d}^H$ between shift spaces induced by $\bar{d}$ is the same as the Hausdorff distance between their simiplices of invariant measures with respect to the Hausdorff distance induced by the Ornstein's metric $\bar{d}$ between measures. We prove that without $\bar{d}$-shadowing this need not to be true (it is known that the former distance always bounds the latter). We provide examples illustrating these results including minimal examples and proximal examples of shift spaces with the $\bar{d}$-shadowing property. The existence of such shift spaces was announced in our earlier paper [op. cit.]. It shows that $\bar{d}$-shadowing indeed generalises the specification property.
math.DS↗
On asymptotically automatic sequences
We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically $k$-automatic sequences are only required to be finite up to equality almost everywhere. We prove basic closure properties and a linear bound on asymptotic subword complexity, show that results concerning frequencies of symbols are no longer true for the asymptotic analogue, and discuss some classification problems.
math.NT↗
Multiplicative generalised polynomial sequences
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the sequence is not zero almost everywhere.
math.NT↗
Arithmetical subword complexity of automatic sequences
We fully classify automatic sequences $a$ over a finite alphabet $Ω$ with the property that each word over $Ω$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal possible arithmetical subword complexity. More generally, we obtain an asymptotic formula for arithmetical (and even polynomial) subword complexity of a given automatic sequence $a$.
math.NT↗
Characterisation of Meyer sets via the Freiman--Ruzsa theorem
We show that the Freiman--Ruzsa theorem, characterising finite sets with bounded doubling, leads to an alternative proof of a characterisation of Meyer sets, that is, relatively dense subsets of Euclidean spaces whose difference sets are uniformly discrete.
math.NT↗
Gowers norms for automatic sequences
We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than guaranteed by the Arithmetic Regularity Lemma. For sequences produced by strongly connected and prolongable automata, the structured part is rationally almost periodic, while for general sequences the description is marginally more complicated. In particular, we show that all automatic sequences orthogonal to periodic sequences are Gowers uniform. As an application, we obtain for any $l \geq 2$ and any automatic set $A \subset \mathbb{N}_0$ lower bounds on the number of $l$-term arithmetic progressions - contained in $A$ - with a given difference. The analogous result is false for general subsets of $\mathbb{N}_0$ and progressions of length $\geq 5$.
math.NT↗
On multiplicative automatic sequences
We show that any automatic multiplicative sequence either coincides with a Dirichlet character or is identically zero when restricted to integers not divisible by small primes. This answers a question of Bell, Bruin and Coons. A similar result was obtained independently by Klurman and Kurlberg.
math.NT↗
Bracket words along Hardy field sequences
We study bracket words, which are a far-reaching generalisation of Sturmian words, along Hardy field sequences, which are a far-reaching generalisation of Piatetski--Shapiro sequences $\lfloor n^c \rfloor$. We show that thus obtained sequences are deterministic (i.e., they have sub-exponential subword complexity) and satisfy Sarnak's conjecture.
math.NT↗
Pisot numbers, Salem numbers, and generalised polynomials
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.
math.NT↗
Bracket words: a generalisation of Sturmian words arising from generalised polynomials
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 polynomial sequences, which we call \emph{bracket words}, from the point of view of combinatorics on words. We survey existing results on generalised polynomials and their corollaries in terms of bracket words, and also prove several new results. Our main contribution is a polynomial bound on the subword complexity of bracket words.
math.CO↗
An asymptotic version of Cobham's theorem
We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.
math.NT↗
On $\bar{d}$-approachability, entropy density and $\mathscr{B}$-free shifts
We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space $\bar{d}$-approachable when its canonical sequence of Markov approximations converges to it also in the $\bar{d}$ sense. We give a topological characterisation of chain mixing $\bar{d}$-approachable shift spaces. As an application we provide a new criterion for entropy density of ergodic measures. Entropy-density of a shift space means that every invariant measure $μ$ of such a shift space is the weak$^*$ limit of a sequence $μ_n$ of ergodic measures with the corresponding sequence of entropies $h(μ_n)$ converging to $h(μ)$. We prove ergodic measures are entropy-dense for every shift space that can be approximated in the $\bar{d}$ pseudometric by a sequence of transitive sofic shifts. This criterion can be applied to many examples that were out of the reach of previously known techniques including hereditary $\mathscr{B}$-free shifts and some minimal or proximal systems. The class of symbolic dynamical systems covered by our results includes also shift spaces where entropy density was established previously using the (almost) specification property.
math.DS↗
On consecutive sums in permutations
We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high probability there are $(\frac{1+e^{-2}}{4} +o(1)) n^2$ such sums. This answers an old question of Erdős and Harzheim. We also obtain non-trivial bounds on the maximum possible number of distinct sums, ranging over all permutations of $1,2,\dots,n$. We close with some questions concerning the minimal possible number of distinct sums.
math.CO↗
Algorithmic classification of noncorrelated binary pattern sequences
We show that it is possible to algorithmically verify if a given pattern sequence is noncorrelated. As an application, we compute that there are exactly $2272$ noncorrelated binary pattern sequences of length $\leq 4$. If we restrict our attention to patterns that do not end with $\mathtt{0}$, we put forward a sufficient condition for a pattern sequence to be noncorrelated. We conjecture that this condition is also necessary, and verify this conjecture for lengths $\leq 5$.
math.NT↗
Generalised polynomials and integer powers
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.
math.NT↗