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

Which Waterdrop water filters are actually worth buying this Black Friday?
09to5Google
Your "49 KB" file is actually 50.5 KB. Blame the kilobyte.
0dev.to
Day 87: A Redirected Module and a Renamed Publisher
0dev.to
Automating the Full PR Lifecycle with Claude Task Master
0dev.to
The Encoded PSEMHUB Path That Broke CVE-2026-35273 WAF Defenses
0dev.to
Clay AI Enrichment Accuracy on DACH Enterprise Targets: What a 30-Contact Test Actually Found
0dev.to