Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.06068

A combinatorial approach to study subshifts associated with multigraphs

Nikita Agarwal·Haritha Cheriyath·Sharvari Neetin Tikekar
View original source ↗Read source document ↗Export metadata ↓

Abstract

A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint which determines the language of the shift entirely. In this paper, in order to describe infinite walks on a multigraph, we introduce the notion of multiplicity of a word (finite walk) and define repeated words as those having multiplicity at least $2$. In general, for given collections $\F$ of forbidden words and $\R$ of repeated words with pre-assigned multiplicities, we define notion of a generalized language which is a multiset. We obtain a subshift associated with $\F$ and $\R$ such that its entropy is calculated using the generalized language. We also study the relationship between the language of this subshift and the generalized language. We then obtain a combinatorial expression for the generating function that enumerates the number of words of fixed length in this generalized language. This gives the Perron root and eigenvectors of the adjacency matrix with integer entries associated to the underlying multigraph. Using this, the topological entropy and an alternate definition of Parry measure for the associated edge shift are obtained. We also discuss some properties of Markov measures on this subshift.

Explore related subjects

math.DSmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Agarwal, Haritha Cheriyath, Sharvari Neetin Tikekar. 2023-03-15. A combinatorial approach to study subshifts associated with multigraphs. https://arxiv.org/abs/2211.06068

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

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗