Paper
Integrable cellular automata on finite fields of order $2^n$
Authors
Aoi Araoka, Tetsuji Tokihiro
Abstract
This paper explores cellular automata (CA) constructed from Yang-Baxter maps over finite fields $F_{2^n}$. We define $R$-matrices using a map $f$ on $F_{2^n}$ and establish necessary and sufficient conditions for $f$ to satisfy the Yang-Baxter equation. We show that these conditions become remarkably streamlined in characteristic two. An exhaustive search for bijective solutions in fields of order 4, 8, and 16 yields 16, 736, and 269,056 maps, respectively. Analysis of the resulting CA under helical boundary conditions reveals a consistent alignment between the temporal period and the field order. We propose the conjecture that this periodic identity holds generally for $F_{2^n}$, supported by analytical proofs for $n=2$ and $n=3$. Our results further indicate that bijectivity is a fundamental requirement for this periodic behavior.
Metadata
Related papers
Vibe Coding XR: Accelerating AI + XR Prototyping with XR Blocks and Gemini
Ruofei Du, Benjamin Hersh, David Li, Nels Numan, Xun Qian, Yanhe Chen, Zhongy... • 2026-03-25
Comparing Developer and LLM Biases in Code Evaluation
Aditya Mittal, Ryan Shar, Zichu Wu, Shyam Agarwal, Tongshuang Wu, Chris Donah... • 2026-03-25
The Stochastic Gap: A Markovian Framework for Pre-Deployment Reliability and Oversight-Cost Auditing in Agentic Artificial Intelligence
Biplab Pal, Santanu Bhattacharya • 2026-03-25
Retrieval Improvements Do Not Guarantee Better Answers: A Study of RAG for AI Policy QA
Saahil Mathur, Ryan David Rittner, Vedant Ajit Thakur, Daniel Stuart Schiff, ... • 2026-03-25
MARCH: Multi-Agent Reinforced Self-Check for LLM Hallucination
Zhuo Li, Yupeng Zhang, Pengyu Cheng, Jiajun Song, Mengyu Zhou, Hao Li, Shujie... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2602.17148v1</id>\n <title>Integrable cellular automata on finite fields of order $2^n$</title>\n <updated>2026-02-19T07:48:16Z</updated>\n <link href='https://arxiv.org/abs/2602.17148v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2602.17148v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>This paper explores cellular automata (CA) constructed from Yang-Baxter maps over finite fields $F_{2^n}$. We define $R$-matrices using a map $f$ on $F_{2^n}$ and establish necessary and sufficient conditions for $f$ to satisfy the Yang-Baxter equation. We show that these conditions become remarkably streamlined in characteristic two. An exhaustive search for bijective solutions in fields of order 4, 8, and 16 yields 16, 736, and 269,056 maps, respectively.\n Analysis of the resulting CA under helical boundary conditions reveals a consistent alignment between the temporal period and the field order. We propose the conjecture that this periodic identity holds generally for $F_{2^n}$, supported by analytical proofs for $n=2$ and $n=3$. Our results further indicate that bijectivity is a fundamental requirement for this periodic behavior.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='nlin.SI'/>\n <category scheme='http://arxiv.org/schemas/atom' term='nlin.CG'/>\n <published>2026-02-19T07:48:16Z</published>\n <arxiv:comment>24 pages, 9 figures</arxiv:comment>\n <arxiv:primary_category term='nlin.SI'/>\n <author>\n <name>Aoi Araoka</name>\n </author>\n <author>\n <name>Tetsuji Tokihiro</name>\n </author>\n </entry>"
}