Coordination sequences for root lattices and related graphs

Simple item page
dc.creatorBaake, Michael
dc.creatorGrimm, Uwe
dc.date1997-06-12
dc.date.accessioned2026-07-07T09:11:51Z
dc.date.available2026-07-07T09:11:51Z
dc.descriptionThe 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 phenomena in lattice models is outlined.
dc.description8 pages, LaTeX, 1 Postscript figure included, using epsf.sty and amssymb.sty
dc.identifierhttps://arxiv.org/abs/cond-mat/9706122
dc.identifierhttp://arxiv.org/abs/cond-mat/9706122
dc.identifierZeitschrift f. Kristallographie 212 (1997) 253-256
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151823
dc.subjectStatistical Mechanics
dc.subjectCombinatorics
dc.titleCoordination sequences for root lattices and related graphs
dc.typetext

Files

Collections

arXiv