Results 71 to 80 of about 1,541,664 (157)
A note on constructing infinite binary words with polynomial subword complexity [PDF]
, 2013 Most of the constructions of infinite words having polynomial subword complexity are quite complicated, e.g., sequences of Toeplitz, sequences defined by billiards in the cube, etc.
Bob Chen +5 more
core +1 more source
The subword complexity of finite and infinite binary words
, 2004 Let Aq be a q-letter alphabet and w be a finite or right infinite word on this alphabet. A subword of w is a block of consecutive letters of w. The subword complexity function of w assigns to each positive integer, n, the number, fw (n), of distinct ...
Gheorghiciuc, Irina
core
ν-Tamari lattices via subword complexes
Electronic Notes in Discrete Mathematics, 2017 Abstract We show that the ν-Tamari lattices of Preville-Ratelle and Viennot can obtained as the duals of certain subword complexes. This generalizes a known result for the classical Tamari lattice, provides a simple description of the lattice property using certain bracket vectors of ν-trees, and gives (conjectural) insight on the geometry of more ...
Cesar Ceballos +2 more
openaire +2 more sources
Subword complexes and 2-truncated cubes [PDF]
Russian Mathematical Surveys, 2014 For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these complexes in terms of roots of the corresponding root system.
openaire +2 more sources
State complexity of the subword closure operation with applications to DNA coding
, 2008 We are interested in the state complexity of languages that are defined via the subword closure operation. The subword closure of a set S of fixed-length words is the set of all words w for which any subword of w of the fixed length is in S. This type of
Câmpeanu, Cezar (author) +1 more
core +1 more source
Colorings of regular trees with linear subword complexity: first examples and properties [PDF]
, 2013 학위논문 (석사)-- 서울대학교 대학원 : 수리과학부, 2013. 8. 임선희.정규트리의 채색의 부분단어 복잡도는 채색된 반지름 n인 부분트리의 채색의 수를 b(n)으로 정의한 것이다. 본 논문은 부분단어 복잡도를 이용하여 정규트리의 채색을 연구한 결과이다. 부분단어 복잡도가 선형함수인 채색을 중점적으로 다루었으며 특히 부분단어 복잡도가 2n+2인 것을 다루었다.
이슬비
core
On the shape of subword complexity sequences of finite words
CoRR, 2013 The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of the randomness of the word and gives insight to what the word itself looks like.
openaire +3 more sources
On subword complexities of homomorphic images of languages [PDF]
RAIRO. Informatique théorique, 1982 Andrzej Ehrenfeucht, Grzegorz Rozenberg
openaire +2 more sources
Complexity in Plasma - A Grand View of Self- Organization
, 1994 "The central theme of the Complexity is the inquest of the creation of ordered structure in nature. Extensive computer simulations on plasmas have revealed that self-organization is governed by the three key processes, i.e.
"Sato, T. +1 more
core
A note on the subword complexes in Coxeter groups
, 2008 We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a shelling order on the facets of the subword complex.
openaire +2 more sources