Search arXivSearch

arXiv · 1505.03848

On a group theoretic generalization of the Morse-Hedlund theorem

Abstract

In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word $x\in A^N,$ over a non empty finite alphabet $A,$ contains at least $n+1$ distinct factors of each length $n.$ They further showed that an infinite word $x$ has exactly $n+1$ distinct factors of each length $n$ if and only if $x$ is binary, aperiodic and balanced, i.e., $x$ is a Sturmian word. In this paper we obtain a broad generalization of the Morse-Hedlund theorem via group actions. Given a subgroup $G$ of the symmetric group $S_n, $ let $1\leq ε(G)\leq n$ denote the number of distinct $G$-orbits of $\{1,2,\ldots ,n\}.$ Since $G$ is a subgroup of $S_n,$ it acts on $A^n=\{a_1a_2\cdots a_n\,|\,a_i\in A\}$ by permutation. Thus, given an infinite word $x\in A^N$ and an infinite sequence $ω=(G_n)_{n\geq 1}$ of subgroups $G_n \subseteq S_n,$ we consider the complexity function $p_{ω,x}:N \rightarrow N$ which counts for each length $n$ the number of equivalence classes of factors of $x$ of length $n$ under the action of $G_n.$ We show that if $x$ is aperiodic, then $p_{ω, x}(n)\geqε(G_n)+1$ for each $n\geq 1,$ and moreover, if equality holds for each $n,$ then $x$ is Sturmian. Conversely, let $x$ be a Sturmian word. Then for every infinite sequence $ω=(G_n)_{n\geq 1}$ of Abelian subgroups $G_n \subseteq S_n,$ there exists $ω'=(G_n')_{n\geq 1}$ such that for each $n\geq 1:$ $G_n'\subseteq S_n$ is isomorphic to $G_n$ and $p_{ω',x}(n)=ε(G'_n)+1.$ Applying the above results to the sequence $(Id_n)_{n\geq 1},$ where $Id_n$ is the trivial subgroup of $S_n$ consisting only of the identity, we recover both directions of the Morse-Hedland theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emilie Charlier, Svetlana Puzynina, Luca Q. Zamboni. 2015-05-15. On a group theoretic generalization of the Morse-Hedlund theorem. https://arxiv.org/abs/1505.03848

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO