Related papers: Characterization of substitution invariant 3iet wo…
The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of…
Let $S$ be a finite alphabet. An injective word over $S$ is a word over $S$ such that each letter in $S$ appears at most once in the word. We study Boolean cell complexes of injective words over $S$ and their commutation classes. This…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of…
All wavelets can be associated to a multiresolution like structure, i.e. an incr easing sequence of subspaces of L^2(R). We consider the interaction of a wavel et and the translation operator in terms of which of the subspaces in this multi…
Let us call subdivision {\it good}, if 1) set corresponding to each symbol is convex (i.e. interval or (semi)closed interval). 2) If points $A$ and $B$ corresponds to the some color and interval $(A,B)$ has discontinuity point, then $f(A)$…
The aim of this article is to investigate central-valued identities involving pairs of endomorphisms on prime rings equipped with an involution of the second kind. Extending the recent contributions of Mir et al. (2020) and Boua et al.…
This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…
Consider the minimal $\beta$-shift containing the shift space generated by given Sturmian word. In this paper we characterize such $\beta$ and investigate its combinatorial, dynamical and topological properties and prove that such $\beta$…
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
We define an invariant of triple-point-free immersions of $2$-spheres into Euclidean $3$-space, taking values in $l^1(\mathbb{Z})$. It remains unchanged under regular homotopies through such immersions. An explicit description of its image…
We propose a theory of contact invariants and open string invariants, assuming that the almost complex $J$ is either non-degenerate or of Bott-type. We do not choose the complex structure $\tilde{J}$ such that $L_X\tilde{J}=0$ on periodic…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…
In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate both similarities and differences between the Abelian complexity and the usual subword complexity. While the…
In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their factors.
For a complexity function $C$, the lower and upper $C$-complexity rates of an infinite word $\mathbf{x}$ are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\upharpoonright n)}n,\quad \overline{C}(\mathbf…
In this article we study invariance properties of shift-invariant spaces in higher dimensions. We state and prove several necessary and sufficient conditions for a shift-invariant space to be invariant under a given closed subgroup of…
In this paper we consider the set ${\mathbb Z}^{\pm\omega}_{6}$ of two-way infinite words $\xi$ over the alphabet $\{0,1,2,3,4,5\}$ with the integer left part $\lfloor\xi\rfloor$ and the fractional right part $\{\xi\}$ separated by a radix…