中文
相关论文

相关论文: Shellability of the quotient order on lattice path…

200 篇论文

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

组合数学 · 数学 2025-04-22 Christin Bibby

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

组合数学 · 数学 2012-10-26 Emanuele Delucchi , Simona Settepanella

We introduce a notion of Lorentzian proper position in close analogy to proper position of stable polynomials. Using this notion, we give a new characterization of elementary quotients of M-convex function that parallels the Lorentzian…

组合数学 · 数学 2026-03-10 Jidong Wang

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

组合数学 · 数学 2025-07-08 Bruce E Sagan , Sheila Sundaram

Panhandle matroids are a specific family of lattice-path matroids corresponding to panhandle-shaped Ferrers diagrams. Their matroid polytopes are the subpolytopes carved from a hypersimplex to form matroid polytopes of paving matroids. It…

组合数学 · 数学 2025-05-30 Danai Deligeorgaki , Daniel McGinnis , Andrés R. Vindas-Meléndez

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

组合数学 · 数学 2024-10-29 Paolo Sentinelli

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

组合数学 · 数学 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

组合数学 · 数学 2012-05-22 Dmitri I. Panyushev

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…

组合数学 · 数学 2020-06-26 Max Hlavacek , Liam Solus

We study the combinatorics of modular flats of oriented matroids and the topological consequences for their Salvetti complexes. We show that the natural map to the localized Salvetti complex at a modular flat of corank one is what we call a…

组合数学 · 数学 2024-07-03 Paul Mücksch

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

组合数学 · 数学 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

We study the poset topology of lattices arising from orientations of 1-skeleta of directionally simple polytopes, with Bruhat interval polytopes $Q_{e,w}$ as our main example. We show that the order complex $\Delta ((u,v)_w)$ of an interval…

组合数学 · 数学 2026-03-02 Christian Gaetz , Patricia Hersh

Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids are not well-quasi-ordered, even when the branch-width is restricted. Though lattice path matroids are not…

组合数学 · 数学 2018-06-28 Meenu Mariya Jose , Dillon Mayhew

We relate the mixed Hodge structure on the cohomology of open positroid varieties (in particular, their Betti numbers over $\mathbb{C}$ and point counts over $\mathbb{F}_q$) to Khovanov--Rozansky homology of associated links. We deduce that…

组合数学 · 数学 2023-09-11 Pavel Galashin , Thomas Lam

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the $W$-polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for…

组合数学 · 数学 2012-04-18 Petter Branden

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

组合数学 · 数学 2022-04-11 Camille Combe , Samuele Giraudo

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

组合数学 · 数学 2007-05-23 John Shareshian , David Wright , Wenhua Zhao

In this paper we introduce discrete polymatroids satisfying the one-sided strong exchange property and show that they are sortable (as a consequence their base rings are Koszul) and that they satisfy White's conjecture. Since any pruned…

交换代数 · 数学 2017-03-09 Dancheng Lu

The flag vector contains all the face incidence data of a polytope, and in the poset setting, the chain enumerative data. It is a classical result due to Bayer and Klapper that for face lattices of polytopes, and more generally, Eulerian…

组合数学 · 数学 2014-10-08 Richard Ehrenborg , Mark Goresky , Margaret Readdy

The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…

度量几何 · 数学 2019-05-07 Hiroshi Hirai