English
Related papers

Related papers: A lattice framework for generalizing shellable com…

200 papers

The theory of shellable simplicial complexes brings together combinatorics, algebra, and topology in a remarkable way. Initially introduced by Alder for $q$-simplicial complexes, recent work of Ghorpade, Pratihar, and Randrianarisoa extends…

Inspired by Bruggesser-Mani's line shellings of polytopes, we introduce line shellings for the lattice of flats of a matroid: given a normal complex for a Bergman fan of a matroid induced by a building set, we show that the lexicographic…

Combinatorics · Mathematics 2026-01-09 Spencer Backman , Galen Dorpalen-Barry , Anastasia Nathanson , Ethan Partida , Noah Prime

We consider a $q$-analogue of abstract simplicial complexes, called $q$-complexes, and discuss the notion of shellability for such complexes. It is shown that $q$-complexes formed by independent subspaces of a $q$-matroid are shellable.…

Combinatorics · Mathematics 2021-05-20 Sudhir R. Ghorpade , Rakhi Pratihar , Tovohery H. Randrianarisoa

The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple…

Combinatorics · Mathematics 2025-04-11 Carolina Benedetti , Anton Dochtermann , Kolja Knauer , Yupeng Li

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Combinatorics · Mathematics 2026-01-08 Or Raz

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples…

Combinatorics · Mathematics 2017-05-17 Jay Schweig , Russ Woodroofe

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We…

Combinatorics · Mathematics 2007-05-23 Patricia Hersh

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…

Combinatorics · Mathematics 2016-04-20 Jin Guo , Yi-Huang Shen , Tongsuo Wu

We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…

Combinatorics · Mathematics 2025-12-22 Basile Coron , Luis Ferroni , Shiyue Li

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

Artificial Intelligence · Computer Science 2013-12-17 Qingyin Li , William Zhu

Perturbative expansions of QCD observables in powers of $\alpha_s$ are believed to be asymptotic and non-Borel summable due to the existence of singularities in the Borel plane (renormalons). This fact is connected with the factorization of…

High Energy Physics - Lattice · Physics 2007-05-23 Antonio Pineda

Shelling orders are a ubiquitous tool used to understand invariants of cell complexes. Significant effort has been made to develop techniques to decide when a given complex is shellable. However, empirical evidence shows that some shelling…

Combinatorics · Mathematics 2020-05-12 Alexander Heaton , Jose Alejandro Samper

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Combinatorics · Mathematics 2016-08-16 Jose Alejandro Samper

A generalization of Dowling lattices was recently introduced by Bibby and Gadish, in a work on orbit configuration spaces. The authors left open the question as to whether these posets are shellable. In this paper we prove EL-shellability…

Combinatorics · Mathematics 2023-12-05 Giovanni Paolini

Topological magnetic lattices offer a fertile ground for exploring fundamental physics and developing novel spintronic devices. However, current research is predominantly confined to single-Q topologies hosting uniform type of…

Materials Science · Physics 2026-02-10 Xiudong Wang , Zhonglin He , Kaiying Dou , Ying Dai , Baibiao Huang , Yandong Ma

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…

Combinatorics · Mathematics 2020-06-26 Max Hlavacek , Liam Solus

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…

Artificial Intelligence · Computer Science 2013-11-06 Bin Yang , Hong Zhao , William Zhu
‹ Prev 1 2 3 10 Next ›