Name
Abstract | ||
|---|---|---|
We show that the complexity of a cutting word u in a regular tiling with a polyomino Q is equal to Pn(u) = (p + q - 1)n + 1 for all n ≥ 0, where Pn(u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed of 2p horizontal and 2q vertical unit segments. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejc.2005.05.009 | Eur. J. Comb. |
Keywords | Field | DocType |
polyomino q,regular tiling,word u,vertical unit segment,flow on the torus,distinct factor,length n,infinite word u,regular tilings,combinatorics on words.,cutting words,complexity function,combinatorics on words | Discrete mathematics,Combinatorics,Polyomino,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 1 | 0195-6698 |
Citations | PageRank | References |
2 | 0.44 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Hubert | 1 | 2 | 0.44 |
| Laurent Vuillon | 2 | 186 | 26.63 |