Combinatorial problems of (quasi-)crystallography

dc.creatorBaake, Michael
dc.creatorGrimm, Uwe
dc.date2002-12-04
dc.date.accessioned2026-07-07T04:29:38Z
dc.date.available2026-07-07T04:29:38Z
dc.descriptionSeveral combinatorial problems of (quasi-)crystallography are reviewed with special emphasis on a unified approach, valid for both crystals and quasicrystals. In particular, we consider planar sublattices, similarity sublattices, coincidence sublattices, their module counterparts, and central and averaged shelling. The corresponding counting functions are encapsulated in Dirichlet series generating functions, with explicit results for the triangular lattice and the twelvefold symmetric shield tiling. Other combinatorial properties are briefly summarised.
dc.description12 pages, 2 PostScript figures, LaTeX using vch-book.cls
dc.identifierhttps://arxiv.org/abs/math-ph/0212015
dc.identifierhttp://arxiv.org/abs/math-ph/0212015
dc.identifierIn: Quasicrystals - Structure and Physical Properties, ed. H.-R. Trebin (Wiley-VCH, Weinheim, 2003), pp. 160-171
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/57229
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject05A15, 52C23, 11R99
dc.titleCombinatorial problems of (quasi-)crystallography
dc.typetext

Files

Collections