Table of Contents
Fetching ...

Separable elements and splittings in Weyl groups of Type $B$

Ming Liu, Houyi Yu

TL;DR

The paper extends the Gaetz–Gao framework from symmetric groups to Weyl groups of type $\mathrm{B}_n$ by classifying separable and minimal non-separable signed permutations via forbidden patterns and establishing a precise equivalence: for $U=[e,u]_R$ in a type $\mathrm{B}$ Weyl group $W$, the splitting $W/U$ with $U$ exists if and only if $u$ is separable. The authors develop a root-system pattern avoidance description in $\mathfrak{B}_n$, analyze minimal non-separable elements and their inverses, and prove that non-separable $u$ fail to yield a splitting, while separable $u$ do yield one, extending the conjecture to type $B$. They also examine rank-symmetry properties of lower ideals and provide constructive and inductive arguments to support the splitting results. Overall, the work advances understanding of generalized quotients, weak-order structure, and splitting phenomena in Weyl groups, with potential implications for representations and combinatorial pattern avoidance in non-symmetric settings.

Abstract

Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the multiplication map $X\times Y\rightarrow \mathfrak{S}_n$ is a splitting (i.e., a length-additive bijection) of $\mathfrak{S}_n$ if and only if $X$ is the generalized quotient of $Y$ and $Y$ is a principal lower order ideal in the right weak order generated by a separable element. They conjectured this result can be extended to all finite Weyl groups. In this paper, we classify all separable and minimal non-separable signed permutations in terms of forbidden patterns and confirm the conjecture of Gaetz and Gao for Weyl groups of type $B$.

Separable elements and splittings in Weyl groups of Type $B$

TL;DR

The paper extends the Gaetz–Gao framework from symmetric groups to Weyl groups of type by classifying separable and minimal non-separable signed permutations via forbidden patterns and establishing a precise equivalence: for in a type Weyl group , the splitting with exists if and only if is separable. The authors develop a root-system pattern avoidance description in , analyze minimal non-separable elements and their inverses, and prove that non-separable fail to yield a splitting, while separable do yield one, extending the conjecture to type . They also examine rank-symmetry properties of lower ideals and provide constructive and inductive arguments to support the splitting results. Overall, the work advances understanding of generalized quotients, weak-order structure, and splitting phenomena in Weyl groups, with potential implications for representations and combinatorial pattern avoidance in non-symmetric settings.

Abstract

Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair of subsets of the symmetric group , the multiplication map is a splitting (i.e., a length-additive bijection) of if and only if is the generalized quotient of and is a principal lower order ideal in the right weak order generated by a separable element. They conjectured this result can be extended to all finite Weyl groups. In this paper, we classify all separable and minimal non-separable signed permutations in terms of forbidden patterns and confirm the conjecture of Gaetz and Gao for Weyl groups of type .
Paper Structure (7 sections, 19 theorems, 103 equations, 2 figures)

This paper contains 7 sections, 19 theorems, 103 equations, 2 figures.

Key Result

Theorem 1.2

Let $W$ be a Weyl group of type $B$, and let $U=[e,u]_R\subseteq W$. Then $(W/U,U)$ is a splitting of $W$ if and only if $u$ is separable.

Figures (2)

  • Figure :
  • Figure :

Theorems & Definitions (38)

  • Conjecture 1.1: GG20am, Conjecture 2
  • Theorem 1.2
  • Definition 2.1
  • Lemma 2.2: GG20aam, Theorem 5.3
  • Lemma 2.3: GG20aam, Theorem 3.9
  • Example 3.1
  • Lemma 3.2
  • Example 3.3
  • Definition 3.4
  • Lemma 3.5
  • ...and 28 more