Coordination Sequences of Periodic Structures are Rational via Automata Theory
Eryk Kopczynski

TL;DR
This paper proves that coordination sequences of periodic structures in Euclidean space are rational, using automata theory, providing a straightforward alternative to recent proofs.
Contribution
It offers a new proof of the rationality of coordination sequences based on automata theory, simplifying previous approaches.
Findings
Coordination sequences are rational functions.
Automata theory can be applied to periodic structures.
The proof is more straightforward than previous methods.
Abstract
We prove the conjecture of Grosse-Kunstleve et al. that coordination sequences of periodic structures in n-dimensional Euclidean space are rational. This has been recently proven by Nakamura et al.; however, our proof is a straightforward application of classic techniques from automata theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
