On Configurations of Order 2
Abhishek Khetan

TL;DR
This paper investigates configurations on the 2D integer lattice with non-trivial annihilators, revealing how their periodic structures can be detected and decomposed, with implications for tilings and their order bounds.
Contribution
It establishes a method to detect periodic directions from annihilators, relates the order of weakly periodic configurations to their decomposition, and provides bounds on tiling orders based on geometric properties.
Findings
Order of a weakly periodic configuration equals the number of components in its minimal decomposition.
Configurations of order 2 can be expressed as sums of two 1-periodic configurations.
Tilings with prime square tiles have points of order at most 2 in their orbit closure.
Abstract
Let be a configuration with a non-trivial annihilator. We show that if is weakly periodic then the directions of periodicity in a minimal weakly periodic decomposition of can be detected from the annihilator ideal associated to . We show that the order of a weakly periodic configuration is same as the number of components in any minimal decomposition into -periodic elements. We then give an upper bound on the order in terms of the support of any of its annihilators. In the special case of tilings this gives an upper bound on the order of any tiling in terms of a geometric quantity associated to the tile. We prove that if is a configuration having a non-trivial annihilator and has order then it can be written as a sum of two -periodic configurations valued in . Lastly we show that any tiling of…
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.
Taxonomy
TopicsCellular Automata and Applications · graph theory and CDMA systems · Coding theory and cryptography
