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

I Built a Ghibli-Style Mughal-Tudor Palace With World Labs Atlas (Chisel). Here's What It Can Do for 3D, Games and Video
0dev.to AI
177 views, 0 sales: the verdict fired — and what changed next
0dev.to AI
Your Terraform IAM Policies Are Haunted (Here's How I Exorcised Them with Kiro)
0dev.to AWS
How to Trim Audio for an Amber Lake Video — Free, in Your Browser
0dev.to WebDev
The Java4Shell fix lives in the fourth version number
0dev.to WebDev
What a Garry's Mod Backdoor Actually Looks Like (and How to Spot One)
0dev.to Security