Related papers: Binary patterns in the Prouhet-Thue-Morse sequence
We present tracial analogs of the classical results of Curto and Fialkow on moment matrices. A sequence of real numbers indexed by words in non-commuting variables with values invariant under cyclic permutations of the indexes, is called a…
Let $A$ be a simple abelian variety over a number field $k$ such that $\operatorname{End}(A)$ is noncommutative. We show that $A$ splits modulo all but finitely many primes of $k$. We prove this by considering the subalgebras of…
In this paper we study the non-injectivity arising in infinite interval exchange transformations. In particular, we build and analyze an infinite family of infinite interval exchanges semi-conjugated to generalized Thue-Morse subshifts,…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
We consider infinite sequences of symbols, also known as streams, and the decidability question for equality of streams defined in a restricted format. This restricted format consists of prefixing a symbol at the head of a stream, of the…
Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs $\mathcal{G}^\alpha$, and show that $\mathcal{G}^\alpha$ has unbounded clique-width unless $\alpha$ contains at most finitely many…
We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz-Brill-Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill-Noether general. These…
In this article, we give a negative answer to a question of Hof, Knill and Simon (1995) concerning purely morphic sequences obtained from primitive morphism containing an infinite number of palindromes. Proven for the binary alphabet by B.…
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…
This thesis investigates three biologically inspired operations: prefix-suffix duplication, bounded prefix-suffix duplication, and prefix-suffix-square completion. Duplication, a common genetic mutation, involves repeating DNA sequences and…
Ulam words are binary words defined recursively as follows: the length-$1$ Ulam words are $0$ and $1$, and a binary word of length $n$ is Ulam if and only if it is expressible uniquely as a concatenation of two shorter, distinct Ulam words.…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
A finite word $w$ is an abelian square if $w = xx^\prime$ with $x^\prime$ a permutation of $x$. In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2 + 6k$ contains an abelian square of length $\geq 2k$. We…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…
In this paper all two-term tilting complexes over a Brauer tree algebra with multiplicity one are described using a classification of indecomposable two-term partial tilting complexes obtained earlier in a joint paper with M. Antipov. The…
The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of complexes (algebras) are introduced. Cohomological range leads to the concepts of derived bounded algebras and…
An infinite binary sequence is Bennett deep if, for any computable time bound, the difference between the time-bounded prefix-free Kolmogorov complexity and the prefix-free Kolmogorov complexity of its initial segments is eventually…
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…
The theory of regular and aperiodic transformations of finite strings has recently received a lot of interest. These classes can be equivalently defined using logic (Monadic second-order logic and first-order logic), two-way machines…