arXiv · 2611.21008
The Odd Shift is not sofic in dimensions $d \ge 3$
Abstract
In this paper, we prove that the Odd Shift $S_{odd}$ is not sofic for dimensions $d \ge 3$. Our proof uses lower bounds from communication complexity, specifically the result of Raz and Spieker on the nondeterministic communication complexity for the connectivity problem. We also prove that $S_{odd}$ is not sofic for dimension $d=2$ under the assumption we call Mute Ocean.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nikita Gladkov, Ivan Mitrofanov. 2026-11-16. The Odd Shift is not sofic in dimensions $d \ge 3$. https://searcharxiv.com/abs/2611.21008
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.