On entropies of block-gluing subshifts

12/17/2020
by   Svetlana Puzynina, et al.
0

A subshift X is called c-block gluing if for any integer n≥ c and any two blocks u and v from the language of X there exists an element of X which has occurrences of u and v at distance n. In this note we study the topological entropies of c-block gluing binary one-dimensional subshifts. We define the set R_c to be the set of entropies of all c-block-gluing subshifts, and R=∪_c∈ℕ R_c. We show that the set R is dense, while R_1 and R_2 are not; in particular, they have isolated points. We conjecture that the same holds for any c.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Wajsberg algebras arising from binary block codes

In this paper we presented some connections between BCK-commutative boun...
research
11/25/2022

Progress towards the two-thirds conjecture on locating-total dominating sets

We study upper bounds on the size of optimum locating-total dominating s...
research
06/21/2021

Minimal Rank Completions for Overlapping Blocks

We consider the multi-objective optimization problem of choosing the bot...
research
06/24/2019

A note on the Split to Block Vertex Deletion problem

In the Split to Block Vertex Deletion (SBVD) problem the input is a spli...
research
12/26/2021

Proof of a conjecture on a special class of matrices over commutative rings of characteristic 2

In this note, we prove the conjecture posed by Keller and Rosemarin at E...
research
02/24/2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs

An equitable coloring of a graph G is a proper vertex coloring of G such...
research
07/14/2020

On a combinatorial generation problem of Knuth

The well-known middle levels conjecture asserts that for every integer n...

Please sign up or login with your details

Forgot password? Click here to reset