Related papers: Substitutions over infinite alphabet generating (-…
Motivated by DNA storage in living organisms, and by known biological mutation processes, we study the reverse-complement string-duplication system. We fully classify the conditions under which the system has full expressiveness, for all…
A route to evaluate exact sums represented by Dirichlet eta and beta functions, both of which are alternating and divergent at negative integer arguments, is advocated. It rests on precise polynomial extrapolations and stands as a…
We study real numbers $\beta$ with the curious property that the $\beta$-expansion of all sufficiently small positive rational numbers is purely periodic. It is known that such real numbers have to be Pisot numbers which are units of the…
In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…
Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach omega-languages over infinite alphabets in the setting of nominal sets, and study…
A new characterization is given to describe implication bases of a closure system in terms of the system's quasi-closed sets. Using this characterization, it is possible to show that groups of implications corresponding to distinct…
We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those…
We consider the integro-differential equation ${\rm I}^{\alpha}_{0+}f= x^m f$ on the half-line. We show that there exists a density solution, which is then unique and can be expressed in terms of the Beta distribution, if and only if $m>…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Alternate bases are a numeration system that generalizes the R\'enyi numeration system. It is common in this context to construct examples or counter-examples by specifying the expansions of $1$ in the desired system. While it is easy to…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
We consider a generalized Takagi function for beta-expansions with the base $1<\beta\leq2$, motivated by multifractal analysis for digit frequency sets of beta-expansions [20]. We show that it is pointwise $\alpha$-H\"older continuous for…
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…
We provide conditional and unconditional asymptotic formulae for the exponential sums $\sum_\gamma\,\gamma^{-i\tau}$, where the summation is over the ordinates of the nontrivial zeros $\rho=\beta+i\gamma$ of the Riemann zeta-function. In…
For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…
We show that every intermediate $\beta$-transformation is topologically conjugate to a greedy $\beta$-transformation with a hole at zero, and provide a counterexample illustrating that the correspondence is not one-to-one. This…
It is argued that transformation processes (generation rules) showing evidence of a long evolutionary history in universal computing systems can be generalized. The explicit function class $ \Omega $ is defined as follows: "Operators whose…
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…