English
Related papers

Related papers: Wachs permutations, Bruhat order and weak order

200 papers

In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…

Representation Theory · Mathematics 2025-10-01 Justyna Kosakowska , Markus Schmidmeier , Hugh Thomas

In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographiically shellable poset. Also, studying the embeddings of…

Combinatorics · Mathematics 2013-02-22 Mahir Bilen Can , Tim Twelbeck

It is shown that higher Bruhat orders admit a decomposition into a higher Tamari order, the corresponding dual Tamari order, and a "mixed order." We describe simplex equations (including the Yang-Baxter equation) as realizations of higher…

Mathematical Physics · Physics 2015-06-08 Aristophanes Dimakis , Folkert Müller-Hoissen

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…

Combinatorics · Mathematics 2022-04-05 Jang Soo Kim , Sun-mi Yun

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

Combinatorics · Mathematics 2019-05-24 Zachary Hamaker , Victor Reiner

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

An element $w$ of the Weyl group is called rationally smooth if the corresponding Schubert variety is rationally smooth. This happens exactly when the lower interval $[id,w]$ in the Bruhat order is palindromic. For each element $w$ of the…

Combinatorics · Mathematics 2019-04-26 Robert Mcalmon , Suho Oh , Hwanchul Yoo

The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this…

Combinatorics · Mathematics 2007-09-21 Suho Oh , Alexander Postnikov , Hwanchul Yoo

Partial Markov categories are a recent framework for categorical probability theory that provide an abstract account of partial probabilistic computation with updating semantics. In this article, we discuss two order relations on the…

Logic in Computer Science · Computer Science 2026-03-03 Elena Di Lavore , Mario Román , Paweł Sobociński , Márk Széles

We establish a hierarchy of weighted majorization relations for the singularities of generalized Lam\'e equations and the zeros of their Van Vleck and Heine-Stieltjes polynomials as well as for multiparameter spectral polynomials of higher…

Classical Analysis and ODEs · Mathematics 2008-04-10 Julius Borcea

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion

We study the poset of Borel congruence classes of symmetric matrices ordered by containment of closures. We give a combinatorial description of this poset and calculate its rank function. We discuss the relation between this poset and the…

Combinatorics · Mathematics 2009-12-10 Eli Bagno , Yonah Cherniavsky

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler

We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…

q-alg · Mathematics 2007-05-23 Anatol N. Kirillov

In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…

Representation Theory · Mathematics 2018-12-19 Weijia Wang

A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the…

Combinatorics · Mathematics 2023-02-28 Christian Gaetz , Ram K. Goel

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

Combinatorics · Mathematics 2014-09-18 Sergi Elizalde , Yuval Roichman

We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…

Quantum Algebra · Mathematics 2008-04-24 Anatol N. Kirillov

We study the Ehrhart theory of hypersimplices of type C, as introduced by Lam and Postnikov for general crystallographic root systems. The $h^*$-polynomials of classical hypersimplices are known to relate to various Eulerian statistics on…

Combinatorics · Mathematics 2025-04-08 Antoine Abram , Jose Bastidas