Search arXivSearch

arXiv · 1911.11172

Separable elements and splittings of Weyl groups

Abstract

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or splitting, of the Weyl group $W$ when $U$ is an order ideal in right weak order generated by a separable element; this generalizes a result for the symmetric group, answering an open problem of Wei. For a generalized quotient of the symmetric group, we show that this multiplication map is a bijection if and only if $U$ is an order ideal in right weak order generated by a separable element, thereby classifying those generalized quotients which induce splittings of the symmetric group, resolving a problem of Björner and Wachs from 1988. We also prove that this map is always surjective when $U$ is an order ideal in right weak order. Interpreting these sets of permutations as linear extensions of 2-dimensional posets gives the first direct combinatorial proof of an inequality due originally to Sidorenko in 1991, answering an open problem Morales, Pak, and Panova. We also prove a new $q$-analog of Sidorenko's formula. All of these results are conjectured to extend to arbitrary finite Weyl groups. Finally, we show that separable elements in $W$ are in bijection with the faces of all dimensions of several copies of the graph associahedron of the Dynkin diagram of $W$. This correspondence associates to each separable element $w$ a certain nested set; we give product formulas for the rank generating functions of the principal upper and lower order ideals generated by $w$ in terms of these nested sets, generalizing several known formulas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Gaetz, Yibo Gao. 2020-10-31. Separable elements and splittings of Weyl groups. https://doi.org/10.1016/j.aim.2020.107389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO