English
Related papers

Related papers: Linear extensions and shelling orders

200 papers

The open intervals in the Bruhat order on twisted involutions in a Coxeter group are shown to be PL spheres. This implies results conjectured by F. Incitti and sharpens the known fact that these posets are Gorenstein* over Z_2. We also…

Combinatorics · Mathematics 2007-05-23 Axel Hultman

Tropicalisation (with trivial coefficients) is a process that turns a polynomial equation into a combinatorial predicate on subsets of the set of variables. We show that for each minuscule representation of a simple reductive group, there…

Combinatorics · Mathematics 2025-12-17 Kieran Calvert , Aram Dermenjian , Alex Fink , Ben Smith

The principle of inclusion-exclusion is applied to subsets of maximal covectors contained in halfspaces of a simple oriented matroid and to convex subsets of its ground set for enumerating tope committees.

Combinatorics · Mathematics 2010-10-13 Andrey O. Matveev

Motivated by the simplification of decomposition formulas for fibred bisets, we study the homomorphism extension problem for subdirect products of finite groups when the codomain is an abelian group satisfying certain hypothesis. We prove…

Group Theory · Mathematics 2026-03-19 İsmail Alperen Öğüt

The classical permutohedron Perm is the convex hull of the points (w(1),...,w(n)) in R^n where w ranges over all permutations in the symmetric group. This polytope has many beautiful properties -- for example it provides a way to visualize…

Combinatorics · Mathematics 2015-01-06 Lauren K. Williams

We define, for any special matching of a finite graded poset, an idempotent, regressive and order preserving function. We consider the monoid generated by such functions. The idempotents of this monoid are called special idempotents. They…

Combinatorics · Mathematics 2021-05-20 P. Sentinelli

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

We show that the poset of alternating sign matrices, with Bruhat order, is isomorphic to the poset of certain submodules of the dominant Verma module for the special linear Lie algebra $\frak{sl}_n$. The latter poset consists of the…

Representation Theory · Mathematics 2021-08-18 Hankyung Ko

We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.

Combinatorics · Mathematics 2017-03-09 Carolyn Chun , Deborah Chun , Steven D. Noble

Fleischner introduced the idea of splitting a vertex of degree at least three in a connected graph and used the operation to characterize Eulerian graphs. Raghunathan et. al. extended the splitting operation from graphs to binary matroids.…

Combinatorics · Mathematics 2018-09-28 S. B. Dhotre , P. P. Malavadkar

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

Combinatorics · Mathematics 2023-08-21 Xuexing Lu

A positroid is the matroid of a real matrix with nonnegative maximal minors, a positroid variety is the closure of the locus of points in a complex Grassmannian whose matroid is a fixed positroid, and a positroid class is the cohomology…

Combinatorics · Mathematics 2016-12-02 Brendan Pawlowski

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Combinatorics · Mathematics 2008-06-14 Yuri Faenza , Volker Kaibel

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

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

Combinatorics · Mathematics 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

Motivated by a search for Lie group structures on groups of Poisson diffeomorphisms [24], we investigate linearizability of Poisson structures of Poisson groupoids around the unit section. After extending the Lagrangian neighbourhood…

Differential Geometry · Mathematics 2022-12-09 Wilmer Smilde

In the present paper, motivated by a conjecture of Jahan and Zheng, we prove that componentwise polymatroidal ideals have linear quotients. This solves positively a conjecture of Bandari and Herzog.

Commutative Algebra · Mathematics 2023-12-29 Antonino Ficarra

Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric…

Combinatorics · Mathematics 2025-06-13 Jordan Lambert , Lonardo Rabelo

The equivariant Kazhdan-Lusztig polynomial of a braid matroid may be interpreted as the intersection cohomology of a certain partial compactification of the configuration space of n distinct labeled points in the plane, regarded as a graded…

Representation Theory · Mathematics 2019-07-25 Nicholas Proudfoot , Ben Young