The Waldspurger Transform of Permutations and Alternating Sign Matrices
James McKeown

TL;DR
This paper introduces the Waldspurger transform for permutations and alternating sign matrices, revealing deep combinatorial connections and providing a geometric realization of the Bruhat order's Dedekind-MacNeille completion.
Contribution
It defines a combinatorial Waldspurger transform for permutations and extends it to alternating sign matrices, linking to various combinatorial structures and the Bruhat order.
Findings
The sum of entries in the transform equals permutation entropy.
Transform columns correspond to Motzkin paths, Young diagrams, and polytope points.
Provides a geometric interpretation of the Bruhat order's lattice.
Abstract
In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group , the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations . Shortly thereafter E. Meinrencken extended the result to affine Weyl groups. P.V. Bibikov and V.S. Zhgoon then gave a uniform proof for a discrete reflection group acting on a simply-connected space of constant curvature. In this paper we show that the Waldspurger and Meinrenken theorems of type A give a new perspective on the combinatorics of the symmetric group. In particular, for each permutation matrix we define a non-negative integer matrix , called the Waldspurger transform of . The definition of the matrix is purely combinatorial but its columns are the images of the fundamental weights under…
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 · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
