Entropy of affine permutations and universality of affine atomic lengths
Nathan Chapelier-Laget, Thomas Gerber, Nicolas Jacon, C\'edric Lecouvey

TL;DR
This paper introduces the concept of entropy for affine permutations, proves its equivalence to atomic length, and demonstrates universality results across different affine types, combining combinatorics and algebraic methods.
Contribution
It defines affine permutation entropy, establishes its relation to atomic length, and proves universality in affine types A and C under certain conditions, extending previous combinatorial results.
Findings
Entropy of affine permutations equals atomic length in type A.
Universality of affine permutation entropy for prime-related types C_n.
Polynomial expressions for atomic length in affine type A.
Abstract
We introduce and study the notion of entropy of affine permutations and prove that it coincides with the atomic length associated with the sum of the fundamental weights for a type affine root system, as defined by the first two authors. We then establish an analogue of the Granville-Ono theorem by showing that any nonnegative integer can be realised as the entropy of an affine permutation or alternatively, as the size of a core multipartition as introduced by the last two authors. Our proof uses an additive combinatorics theorem due to Hall on difference sets of permutations modulo . More generally, we give a polynomial expression of the atomic length associated with any dominant weight in affine type and investigate the problem of its universality. Beyond type , we are able to prove that the entropy of affine type permutations is universal when is prime.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Finite Group Theory Research · graph theory and CDMA systems
