English
Related papers

Related papers: Chains in Weak Order Posets Associated to Involuti…

200 papers

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…

Combinatorics · Mathematics 2007-05-23 Sergei Ovchinnikov

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

We introduce and study additive posets. We show that the top homology group (with coefficients in Z/2Z) of a finite dimensional CW-complex carries a structure of an additive poset invariant under subdivisions. Applications to CW-complexes…

Combinatorics · Mathematics 2017-09-25 Vladimir Turaev

Involution words are variations of reduced words for involutions in Coxeter groups, first studied under the name of "admissible sequences" by Richardson and Springer. They are maximal chains in Richardson and Springer's weak order on…

Combinatorics · Mathematics 2018-08-07 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

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

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

Quandles with involutions that satisfy certain conditions, called good involutions, can be used to color non-orientable surface-knots. We use subgroups of signed permutation matrices to construct non-trivial good involutions on extensions…

Geometric Topology · Mathematics 2009-08-17 J. Scott Carter , Kanako Oshiro , Masahico Saito

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

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…

Combinatorics · Mathematics 2022-10-11 Beáta Bényi , Anders Claesson , Mark Dukes

One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…

Algebraic Topology · Mathematics 2026-05-20 Claire Amiot , Thomas Brüstle , Eric J. Hanson

In this paper, we introduce a weak group inverse (called the WG inverse in the present paper) for square matrices of an arbitrary index, and give some of its characterizations and properties. Furthermore, we introduce two orders: one is a…

Rings and Algebras · Mathematics 2017-04-28 Hongxing Wang , Jianlong Chen

We examine Borel subgroup orbits in the classical symmetric space of type CI, which are parametrized by skew symmetric (n, n)-clans. We describe bijections between such clans, certain weighted lattice paths, and pattern-avoiding signed…

Combinatorics · Mathematics 2020-01-22 Aram Bingham , Ozlem Ugurlu

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Combinatorics · Mathematics 2007-05-23 Maximillian Murphy , Vincent Vatter

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

Given a finite poset $P$, we study the _whirling_ action on vertex-labelings of $P$ with the elements $\{0,1,2,\dotsc ,k\}$. When such labelings are (weakly) order-reversing, we call them $k$-bounded $P$-partitions. We give a general…

Combinatorics · Mathematics 2025-10-06 Matthew Plante , Tom Roby

Let $G$ be a connected reductive algebraic group over an algebraically closed field ${\bf k}$ of characteristic not equal to 2, let $\B$ be the variety of all Borel subgroups of $G$, and let $K$ be a symmetric subgroup of $G$. Fixing a…

Representation Theory · Mathematics 2011-04-15 Sam Evens , Jiang-Hua Lu

The main purpose of this paper is to prove that the Bruhat-Chevalley ordering of the symmetric group when restricted to the fixed-point-free involutions forms an $EL$-shellable poset whose order complex triangulates a ball. Another purpose…

Combinatorics · Mathematics 2014-05-06 Mahir Bilen Can , Yonah Cherniavsky , Tim Twelbeck

The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…

Combinatorics · Mathematics 2011-03-11 Erin Bancroft