Related papers: Abelian Complexity in Minimal Subshifts

In this paper we study the class of so-called privileged words which have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged…

In this paper we study the privileged complexity function of the Thue-Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have…

In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…

Given balls and boxes both enumerated by the positive integers, we consider a sequential allocation of the balls into the boxes. We fix $\ell \ge 2$. Proceeding in increasing order of box labels, assign to each box the next $r$ smallest…

We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least…

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

If $k$ is a field, $A$ a finite dimensional $k$-algebra, then the simple $A$-modules form a simple minded collection in the derived category $\operatorname{D}^b( \operatorname{mod} A )$. Their extension closure is $\operatorname{mod} A$; in…

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

We say that a subgroup $H$ of an infinite compact Abelian group $X$ is {\it $T$-characterized} if there is a $T$-sequence $\mathbf{u} =\{u_n \}$ in the dual group of $X$ such that $H=\{x\in X: \; (u_n, x)\to 1 \}$. We show that a closed…

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

If $M$ is an $R$-module, we study the submodules $K\leq M$ with the property that $K$ is invariant with respect to all monomorphisms $K\rightarrow M$. Such submodules are called \textsl{strictly invariant}. For the case of $%…

For a cardinal k, generalizing a recent result of Comfort and van Mill, we prove that every k-pseudocompact abelian group of weight >k has some proper dense k-pseudocompact subgroup and admits some strictly finer k-pseudocompact group…

Generalized abelian equivalence compares words by their factors up to a certain bounded length. The associated complexity function counts the equivalence classes for factors of a given size of an infinite sequence. How practical is this…

We study the abelian period sets of Sturmian words, which are codings of irrational rotations on a one-dimensional torus. The main result states that the minimum abelian period of a factor of a Sturmian word of angle $\alpha$ with continued…

For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…

We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…

A class of maps in a complex Banach space is studied, which includes both unbounded linear operators and nonlinear holomorphic maps. The defining property, which we call {\sl pseudo-contractivity}, is introduced by means of the Abel…

We show that every Abelian group satisfying a mild cardinal inequality admits a pseudocompact group topology from which all countable subgroups inherit the maximal totally bounded topology (we say that such a topology satisfies property…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

A subvariety V of an abelian variety is `translate' if it is the union of translates of proper algebraic subgroups. An irreducible V is `transverse' if it is not contained in any translate variety. Effective sharp lower bounds for a…