Related papers: On Unique Factorization of Non-periodic Words

We prove that generically in $\text{Diff}^{1}_{m}(M)$, if an expanding $f$-invariant foliation $W$ of dimension $u$ is minimal and there is a periodic point of unstable index $u$, the foliation is stably minimal. By this we mean there is a…

In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with…

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

An injective word over a finite alphabet $V$ is a sequence $w=v_1v_2\cdots v_t$ of distinct elements of $V$. The set $\mathrm{inj}(V)$ of injective words on $V$ is partially ordered by inclusion. A complex of injective words is the order…

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…

Let $\mathbb{A}$ be a $2$-category with suitable opcomma objects and pushouts. We give a direct proof that, provided that the codensity monad of a morphism $p$ exists and is preserved by a suitable morphism, the factorization given by the…

Given a programming language, can we give a monadic denotational semantics that is stable under language extension? Models containing only a single monad are not stable. Models based on type-and-effect systems, in which there is a monad for…

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

We consider amalgamated free product II$_1$ factors $M = M_1 *_B M_2 *_B ...$ and use ``deformation/rigidity'' and ``intertwining'' techniques to prove that any relatively rigid von Neumann subalgebra $Q\subset M$ can be intertwined into…

In this paper, we define the recurrence and "non-wandering" for decompositions. The following inclusion relations hold for codimension one foliations on closed $3$-manifolds: $\{$minimal$\} \sqcup \{$compact$\}$ $\subsetneq$ $\{$pointwise…

Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets…

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

We prove that for every integer $n > 0$ and for every alphabet $\Sigma_k$ of size $k \geq 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely unclustered, i.e., it consists of exactly $n$ runs with…

A subspace $U$ of $\mathbb{F}_q^n$ is called \textit{cyclically covering} if the whole space $\mathbb{F}_q^n$ is the union of the cyclic shifts of $U$. The case $\mathbb{F}_q^n$ itself is the only covering subspace, is of particular…

Let $A$ be a finite nilpotent group acting fixed point freely on the finite (solvable) group $G$ by automorphisms. It is conjectured that the nilpotent length of $G$ is bounded above by $\ell(A)$, the number of primes dividing the order of…

A detailed Dirac's canonical analysis for a topological four dimensional $BF$-like theory with a compact dimension is developed. By performing the compactification process we find out the relevant symmetries of the theory, namely, the full…

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Fibonacci-automatic". This class includes, for example, the famous Fibonacci word f = 01001010...,…

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an explicit formula for $B$. We use this approach to give an…