Related papers: Minimal automaton for multiplying and translating …

Let $A$ be an expanding $2 \times 2$ matrix with rational entries and $\mathbb{Z}^2[A]$ be the smallest $A$-invariant $\mathbb{Z}$-module containing $\mathbb{Z}^2$. Let $\mathcal{D}$ be a finite subset of $\mathbb{Z}^2[A]$ which is a…

The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

The Nottingham group at 2 is the group of (formal) power series $t+a_2 t^2+ a_3 t^3+ \cdots$ in the variable $t$ with coefficients $a_i$ from the field with two elements, where the group operation is given by composition of power series.…

An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

We describe under a variety of conditions abelian subgroups of the automorphism group A of the regular n-ary tree T which are normalized by the n-ary adding machine t=(e,...,e,t)s where s is the n-cycle (0,1,...,n-1). As an application, for…

Let $(T,\langle \cdot, \cdot, \cdot \rangle)$ be a Leibniz triple system of arbitrary dimension, over an arbitrary base field ${\mathbb F}$. A basis ${\mathcal B} = \{e_{i}\}_{i \in I}$ of $T$ is called multiplicative if for any $i,j,k \in…

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

Given an integer $q\ge2$ and $\theta_1,\cdots,\theta_{q-1}\in\{0,1\}$, let $(\theta_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0\theta_1\cdots\theta_{q-1}$$…

The generalized taxicab number $T(n,m,t)$ is equal to the smallest number that is the sum of $n$ positive $m$th powers in $t$ ways. This definition is inspired by Ramanujan's observation that $1729 = 1^3+ 12^3 =9^3 + 10^3 $ is the smallest…

Using elementary means, we derive the three most popular splittings of $e^{(A+B)}$ and their error bounds in the case when $A$ and $B$ are (possibly unbounded) operators in a Hilbert space, generating strongly continuous semigroups,…

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly…

In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set…

A $4^-$-power is a non-empty word of the form $XXXX^-$, where $X^-$ is obtained from $X$ by erasing the last letter. A binary word is called {\em faux-bonacci} if it contains no $4^-$-powers, and no factor 11. We show that faux-bonacci…