2005
DOI: 10.1007/s10958-005-0329-2
|View full text |Cite
|
Sign up to set email alerts
|

The Number of Words of a Given Length in the Planar Crystallographic Groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0
2

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 1 publication
0
7
0
2
Order By: Relevance
“…The coordination sequence is strictly connected with the layerwise growth model. It is possible to give exact formulas for coordination numbers in a periodic case (Shutov, 2005). For quasiperiodic tilings, only asymptotic formulas can be obtained (Baake & Grimm, 2003).…”
Section: Introductionmentioning
confidence: 99%
“…The coordination sequence is strictly connected with the layerwise growth model. It is possible to give exact formulas for coordination numbers in a periodic case (Shutov, 2005). For quasiperiodic tilings, only asymptotic formulas can be obtained (Baake & Grimm, 2003).…”
Section: Introductionmentioning
confidence: 99%
“…This conjecture completely describes the behaviour of coordination numbers in the periodic case. Various special cases of this conjecture were proved by Conway & Sloane (1997), Baake & Grimm (1997), Eon (2002) and Shutov (2005). A full proof of this conjecture is currently unknown.…”
Section: Introductionmentioning
confidence: 94%
“…In the oriented case, one can also define a pseudometric on the graph, and hence also a growth function. In [23], Shutov presented the growth functions of all 20 oriented graphs (some groups are presented by Coxeter and Moser with more than one system of generators and relators), using the method of the article of Zhuravlev [24]. Unfortunately, the expressions for the oriented version of γ(n) are claimed to be valid for n ≥ n 0 for some n 0 not indicated in [23].…”
Section: Introductionmentioning
confidence: 99%
“…In [23], Shutov presented the growth functions of all 20 oriented graphs (some groups are presented by Coxeter and Moser with more than one system of generators and relators), using the method of the article of Zhuravlev [24]. Unfortunately, the expressions for the oriented version of γ(n) are claimed to be valid for n ≥ n 0 for some n 0 not indicated in [23]. Also, details of the proofs are missing and the growth of Γ based on its orientation does not always coincide with the growth of Γ as an undirected graph.…”
Section: Introductionmentioning
confidence: 99%