Backend
Orbits as Strong Models: Kolmogorov Structure Function under Symmetry
arXiv math.IT0 views
arXiv:2609.40290v3 Announce Type: replace Abstract: Strong models in algorithmic statistics are essentially the cells of simple partitions of $\{0,1\}^n$. We study the partitions that come from symmetry, the orbit partitions of groups acting on strings, and the structure function $h^G_x$ they induce. A set is a cell of such a partition exactly when its setwise stabiliser acts transitively on it, so $h^G_x$ is Kolmogorov's structure function restricted to $G$-homogeneous sets. For the full symmetric group this recovers all models and exactly the strong ones. For $GL(n,2)$ the cells are the linearly homogeneous sets, $h^{GL}_x$ lies in a band between $C(x)-\alpha$ and $n-\alpha$ with both edges attained, and some stochastic normal strings have simple structure that is invisible to linear symmetry. Writing each permutation group as a Burnside-ring type with a placement, we show that any space of symmetry hypotheses small enough to search is small enough to miss simple structure. Finally we cast the search for orbit models as value estimation on subgroup lattices, with computable bounds, certified training targets and a lattice version of Monte Carlo tree search.
Source:https://arxiv.org/abs/2609.40290Previous$p$-ary (Non Weakly) Regular Bent Functions in Generalized $\cPS$ classNextShared Randomness and Parallel Rounds in Permutation Sampling
Related posts
What Jobs Can a Fresher Get After Learning Python? A Practical Guide
0dev.to
Defensive Coding for Real-Time Scoreboard Components
0dev.to
Dev News Digest: 19 Nov 2026, 06:00
0dev.to News
Download Website as HTML: Get a Runnable Project From a Figma Capture
0dev.to Design
A bilingual article’s canonical URL changes from a draft decision to an API result
0dev.to Discuss
Signs of Wear: Evaluating Intelligent Speed Assistance Under Synthetic Adverse Conditions
0arXiv eess.IV