Coordination sequences of crystals are of quasi-polynomial type

The coordination sequence of a graph measures how many vertices the graph has at each distance from a fixed vertex and is a generalization of the coordination number. Here it is proved that the coordination sequence of the graph obtained from a crystal is of quasi-polynomial type, as had been postul...

Descripción completa

Detalles Bibliográficos
Autores principales: Nakamura, Yusuke, Sakamoto, Ryotaro, Mase, Takafumi, Nakagawa, Junichi
Formato: Online Artículo Texto
Lenguaje:English
Publicado: International Union of Crystallography 2021
Materias:
Research Papers
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7941273/
https://www.ncbi.nlm.nih.gov/pubmed/33646200
http://dx.doi.org/10.1107/S2053273320016769
Descripción
Sumario:The coordination sequence of a graph measures how many vertices the graph has at each distance from a fixed vertex and is a generalization of the coordination number. Here it is proved that the coordination sequence of the graph obtained from a crystal is of quasi-polynomial type, as had been postulated by Grosse-Kunstleve et al. [Acta Cryst. (1996), A52, 879–889].

Ejemplares similares