Coordination sequences for root lattices and related graphs

@article{Baake1997CoordinationSF,
  title={Coordination sequences for root lattices and related graphs},
  author={Michael Baake and Uwe Grimm},
  journal={arXiv: Statistical Mechanics},
  year={1997}
}
The coordination sequence s(k) of a graph counts the number of its vertices which have distance k from a given vertex, where the distance between two vertices is defined as the minimal number of bonds in any path connecting them. For a large class of graphs, including in particular the classical root lattices, we present the coordination sequences and their generating functions, summarizing and extending recent results of Conway and Sloane. A possible application to the theory of critical… 

Figures and Tables from this paper

Coordination Sequences and Critical Points

Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds,

Coordination numbers of the vertex graph of a Penrose tiling.

  • A. ShutovA. Maleev
  • Mathematics
    Acta crystallographica. Section A, Foundations and advances
  • 2018
The structure of the coordination shells in the vertex graph of a Penrose tiling is described and an asymptotic formula for its coordination numbers is obtained.

Coordination sequences and layer-by-layer growth of periodic structures

  • A. ShutovA. Maleev
  • Mathematics
    Zeitschrift für Kristallographie - Crystalline Materials
  • 2018
Abstract A new approach to the problem of coordination sequences of periodic structures is proposed. It is based on the concept of layer-by-layer growth and on the study of geodesics in periodic

Coordination sequences for hyperbolic tilings

Coordination sequences have been determined for tilings {p, q} of the hyperbolic plane in which q p-gons meet at each vertex. The number of vertices in successive shells is related by a recurrence to

Generalized Fibonacci numbers and coordination sequences for decorated Bethe lattices

Coordination sequences are determined for 3-connected structures derived from Bethe lattices (infinite trees) by replacing vertices by polygons of vertices (decorating). For polygons with 2t sides (t

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

This paper reveals an interrelation between the words in groups and the growth process of the corresponding graphs, based on which exact formulas for the number of words of a given length for all 17

Coordination shells and coordination numbers of the vertex graph of the Ammann-Beenker tiling.

  • A. ShutovA. Maleev
  • Mathematics
    Acta crystallographica. Section A, Foundations and advances
  • 2019
It is proved that there exists a limit growth form for the vertex graph of the Ammann-Beenker tiling that is an explicitly calculated regular octagon.

On the growth of the wallpaper groups.

Coordination sequences (also called growth functions) appear in various areas of chemistry and crystallography, such as ice crystals and zeolites, and various areas of mathematics, such as lattice

Averaged coordination numbers of planar aperiodic tilings

We consider averaged shelling and coordination numbers of aperiodic tilings. Shelling numbers count the vertices on radial shells around a vertex. Coordination numbers, in turn, count the vertices on

Coordination sequences and coordination waves in matter

A possible way of partitioning a space into polycubes (n-dimensional modifications of Golomb polyominoes, which are generally nonconvex) is used as a basic model of ordered matter structure. It is

References

SHOWING 1-10 OF 13 REFERENCES

Low–dimensional lattices. VII. Coordination sequences

  • J. ConwayN. Sloane
  • Mathematics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1997
The coordination sequence {S(n)} of a lattice or net gives the number of nodes that are n bonds away from a given node. S(1) is the familiar coordination number. Extending the work of O'Keeffe and

Coordination sequences for lattices

Coordination sequences for five 3-dimensional, ten 4-dimensional and eleven higher-dimensional lattices have been determined and all but one can be expressed as simple polynomials. Some regularities

N-dimensional diamond, sodalite and rare sphere packings

The diamond, lonsdaleite and sodalite structures are generalized to N dimensions and described. Ring counts and coordination sequences for the N + 1-connected nets are given for N ≤ 6. Simple

Sphere Packings, Lattices and Groups

The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to

Universal formulas for percolation thresholds.

  • GalamMauger
  • Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1996
A power law is postulated for both site and bond percolation thresh- olds and is found to be also valid for Ising critical temperatures.

SELF-AVOIDING WALKS ON QUASILATTICES

I consider the asymptotic properties of self-avoiding walks on a variety of quasilattices. The critical points and exponents are estimated. Walks on several of the patterns appear to belong to the

Lee-Yang zeros for substitutional systems

Qualitative and quantitative information about critical phenomena is provided by the distribution of zeros of the partition function in the complex plane. We apply this idea to Ising models on

An On-Line Version of the Encyclopedia of Integer Sequences

A Handbook of Integer Sequences was published by Academic Press in 1973, and contained an annotated list of 2372 sequences arranged in lexicographic order. Since then a great deal of new material has

The encyclopedia of integer sequences

This book presents methods for Computer Investigation of Sequences, a method for hand analysis of sequences, and some of the methods used in this work, as well as suggestions for further study.