Backend
A Geometric Coding Theorem
arXiv math.IT0 views
arXiv:2607.13796v3 Announce Type: replace Abstract: This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpr\'e, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity.
Source:https://arxiv.org/abs/2607.13796PreviousBrownian Bridge Diffusion-Assisted Joint Channel Estimation and Data Detection for Jamming-Resilient OFDM ReceiversNextResource Allocation for Secure Dual-UAV-Assisted ISAC System
Related posts
Where Was the Author of The Ugly Duckling Born? What 11 LLMs Taught Me About Connecting Facts
0dev.to Machine Learning

Airfoil noise: one model saw the test condition at other frequencies, one did not
0dev.to Machine Learning
Comment BlackRock et les géants de la gestion d'actifs intègrent-ils la blockchain ?
0dev.to Tutorial
How to Download Pinterest GIFs Without Losing the Animation
0dev.to Tutorial
I built a tool that finds the hiring team behind any job link
0dev.to Career
NGO Near Me: Education Support and Community Development in India
0dev.to Career