1 citations · 1 across the 8 of their papers we have counts for
24 papers
Minimal and proximal examples of -stable and -approachable shift spaces
Melih Emin Can, Jakub Konieczny, Michal Kupsa +1
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 metric ($\ba…
On asymptotically automatic sequences
Jakub Konieczny
We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While -automatic sequences are characterised by finiteness of…
Bracket words along Hardy field sequences
Jakub Konieczny, Clemens Müllner
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 sequen…
Pisot numbers, Salem numbers, and generalised polynomials
Jakub Byszewski, Jakub Konieczny
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 Sa…
An asymptotic version of Cobham's theorem
Jakub Konieczny
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 int…
Bracket words: a generalisation of Sturmian words arising from generalised polynomials
Boris Adamczewski, Jakub Konieczny
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials ex…