The Odd Shift is not sofic in dimensions $d \ge 3$

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21008
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Odd Shift is not sofic in dimensions $d \ge 3$

Ivan Mitrofanov, Nikita Gladkov
arXiv (Cornell University)
semigroups and automata theory
preprint

The Odd Shift is not sofic in dimensions $d \ge 3$

Ivan Mitrofanov, Nikita Gladkov
preprint en

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.

arXiv (Cornell University)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon