English
Related papers

Related papers: Higher Bruhat Orders in Type B

200 papers

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

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

Combinatorics · Mathematics 2013-09-27 Mikhail Kharitonov

Let n_n(C) be the algebra of strictly upper-triangular n x n matrices over the field of complex numbers and X_2 the subset of matrices of nilpotent order 2. Let B_n(C) be the group of invertible upper-triangular matrices acting on n_n(C) by…

Representation Theory · Mathematics 2007-05-23 Anna Melnikov

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

Weak Bruhat interval modules of the $0$-Hecke algebra in type $A$ provide a uniform approach to studying modules associated with noteworthy families of quasisymmetric functions. Recently this kind of modules were generalized from type $A$…

Representation Theory · Mathematics 2024-10-11 Han Yang , Houyi Yu

To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length…

Combinatorics · Mathematics 2021-07-27 Michael Lugo , Mark Shimozono

We classify all equivalences between the indecomposable abelian categories which appear as blocks in BGG category O for reductive Lie algebras. Our classification implies that a block in category O only depends on the Bruhat order of the…

Representation Theory · Mathematics 2019-03-08 Kevin Coulembier

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons

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…

Combinatorics · Mathematics 2025-03-20 Ming Liu , Houyi Yu

We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are…

Combinatorics · Mathematics 2020-01-07 Christian Gaetz , Yibo Gao

Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representatons of the corresponding Artin group A. The poset…

Group Theory · Mathematics 2007-05-23 A. M. Cohen , D. A. H. Gijsbers , D. B. Wales

For every partially ordered sets I, having a finite cofinal subset, and every field K we build a unital, locally matricial and hence unit-regular K-algebra B(I) such that the lattice of all its ideals is order isomorphic to the lattice of…

Rings and Algebras · Mathematics 2025-08-20 Giuseppe Baccella

Let $G$ be a connected complex semi-simple Lie group, and let $Z_{{\bf u}}$ be an $n$-dimensional Bott-Samelson variety of $G$, where ${\bf u}$ is any sequence of simple reflections in the Weyl group of $G$. We study the Poisson structure…

Differential Geometry · Mathematics 2017-11-03 Balazs Elek , Jiang-Hua Lu

The combinatorially and the geometrically defined partial orders on the set of permutations coincide. We extend this result to $(0,1)$-matrices with fixed row and column sums. Namely, the Bruhat order induced by the geometry of a Cherkis…

Combinatorics · Mathematics 2024-05-24 Tommaso Maria Botta , Alexander O. Foster , Richard Rimanyi

We prove that semi-infinite Bruhat order on an affine Weyl group is completely determined from those on the quotients by affine Weyl subgroups associated with various maximal (standard) parabolic subgroups of finite type. Furthermore, for…

Representation Theory · Mathematics 2021-05-13 Motohiro Ishii

We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…

Combinatorics · Mathematics 2015-10-23 François Viard

For an integer $n\geq 1$, we display a poset $\Phi_n$ whose maximal chains are in bijection with the $n\times n$ alternating sign matrices. The Hasse diagram $\widehat \Phi_n$ is obtained from the $n$-cube by adding some edges. We show that…

Combinatorics · Mathematics 2017-10-16 Paul Terwilliger

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

We derive a formula for computing the size of lower Bruhat intervals for elements in the dominant cone of an affine Weyl group of type $A$. This enumeration problem is reduced to counting lattice points in certain polyhedra. Our main tool…

Combinatorics · Mathematics 2025-12-11 Federico Castillo , Damian de la Fuente , Nicolas Libedinsky , David Plaza

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

Combinatorics · Mathematics 2026-02-05 Gi-Sang Cheon , Hong Joon Choi , Gukwon Kwon , Hojoon Lee , Yaling Wang
‹ Prev 1 3 4 5 6 7 10 Next ›