Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Gladkov, Nikita, Mitrofanov, Ivan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234797552
