English
Related papers

Related papers: Sorting orders, subword complexes, Bruhat order an…

200 papers

We prove that the structure algebra of a Bruhat moment graph of a finite real root system is a Hopf algebroid with respect to the Hecke and the Weyl actions. We introduce new techniques (reconstruction and push-forward formula of a product,…

Algebraic Geometry · Mathematics 2023-03-07 Martina Lanini , Rui Xiong , Kirill Zainoulline

This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…

Combinatorics · Mathematics 2013-10-08 Viviane Pons

We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…

Algebraic Topology · Mathematics 2014-12-09 Priyavrat Deshpande

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

A poset-stratified space is a pair $(S, S \xrightarrow \pi P)$ of a topological space $S$ and a continuous map $\pi: S \to P$ with a poset $P$ considered as a topological space with its associated Alexandroff topology. In this paper we show…

Algebraic Topology · Mathematics 2019-10-10 Toshihiro Yamaguchi , Shoji Yokura

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

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

Combinatorics · Mathematics 2011-08-17 Gábor Hetyei , Christian Krattenthaler

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

In our previous papers we described the structure of trajectories of the symmetric Toda system on normal real forms of various Lie algebras and showed that it was totally determined by the Hasse diagram of the Bruhat order on the…

Exactly Solvable and Integrable Systems · Physics 2017-12-27 Yu. B. Chernyakov , G. I. Sharygin , A. S. Sorin

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

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

In this article, we investigate the set of $\gamma$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_{\gamma}$. We show that this poset…

Combinatorics · Mathematics 2015-06-11 Henri Mühle

We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an $R$-labeling, imply the…

Combinatorics · Mathematics 2019-09-25 Richard Ehrenborg , Margaret Readdy

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

Combinatorics · Mathematics 2011-04-01 Kari Ragnarsson , Bridget Eileen Tenner

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Logic · Mathematics 2021-01-01 Dakota Thor Ihli

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

Combinatorics · Mathematics 2018-12-27 Benjamin Braun , Wesley K. Hough

We determine the M\"obius function of the poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. The composition poset turns out to be intimately…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan , Vincent Vatter

We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are…

Combinatorics · Mathematics 2012-07-24 Axel Hultman , Kathrin Vorwerk