𝒮-adic characterization of minimal ternary dendric subshifts

02/19/2021
by   France Gheeraert, et al.
0

Dendric subshifts are defined by combinatorial restrictions of the extensions of the words in its language. This family generalizes well-known families of subshifts such as Sturmian subshifts, Arnoux-Rauzy subshifts and codings of interval exchange transformations. It is known that any minimal dendric subshifts has a primitive S-adic representation where the morphisms in S are positive tame automorphisms of the free group generated by the alphabet. In this paper we investigate those S-adic representations, heading towards an S-adic characterization ot this family. We obtain such a characterization in the ternary case, involving a directed graph with 9 vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2022

𝒮-adic characterization of minimal dendric shifts

Dendric shifts are defined by combinatorial restrictions of the extensio...
research
02/22/2020

A characterization of proportionally representative committees

A well-known axiom for proportional representation is Proportionality of...
research
05/29/2020

Structural characterization of some problems on circle and interval graphs

A graph is circle if there is a family of chords in a circle such that t...
research
11/26/2019

A geometric characterization of minimal codes and their asymptotic performance

In this paper, we give a geometric characterization of minimal linear co...
research
04/11/2023

Extremal families for the Kruskal–Katona theorem

Given a family S of k–subsets of [n], its lower shadow Δ(S) is the famil...
research
05/17/2023

On the extremal families for the Kruskal–Katona theorem

In <cit.>, the authors have shown a characterization of the extremal fam...
research
09/19/2018

Combinatorial and Structural Results for gamma-Psi-dimensions

One of the main open problems of the theory of margin multi-category pat...

Please sign up or login with your details

Forgot password? Click here to reset