English
Related papers

Related papers: Standard complexes of matroids and lattice paths

200 papers

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories…

Category Theory · Mathematics 2022-04-05 Michael Lieberman , Jiří Rosický , Sebastien Vasey

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

Mathematical Physics · Physics 2007-05-23 M. Lorente

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

Rings and Algebras · Mathematics 2021-06-17 Aiping Gan , Li Guo

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Combinatorics · Mathematics 2014-04-21 Christine Bessenrodt , Richard P. Stanley

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Combinatorics · Mathematics 2016-03-29 Rade T. Živaljević

One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel , Tim Roemer

In this paper, we present a lattice-theoretic characterization for valuated matroids, which is an extension of the well-known cryptomorphic equivalence between matroids and geometric lattices ($=$ atomistic semimodular lattices). We…

Combinatorics · Mathematics 2019-03-04 Hiroshi Hirai

In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as…

Combinatorics · Mathematics 2018-01-04 Hans-Juergen Bandelt , Victor Chepoi , Kolja Knauer

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

Commutative Algebra · Mathematics 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

Let C be the stable oo-category of perfect complexes on a derived Deligne-Mumford stack X of finite type over the complex numbers. We prove that the complexified noncommutative topological Chern character is an isomorphism for C. In the…

Algebraic Geometry · Mathematics 2023-08-04 Adeel A. Khan

Two related constructions are studied: (1) The diagonal complex $\mathcal{D}$ and its barycentric subdivision $\mathcal{BD}$ related to a \textit{punctured} oriented surface $F$ equipped with a number of labeled marked points. (2) The…

Geometric Topology · Mathematics 2020-11-05 Joseph Gordon , Gaiane Panina

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

Metric Geometry · Mathematics 2015-03-17 Justin Malestein , Louis Theran

We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded…

Combinatorics · Mathematics 2021-10-19 Joseph Bonin , Carolyn Chun , Tara Fife

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…

Commutative Algebra · Mathematics 2010-09-16 Ezra Miller

We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Combinatorics · Mathematics 2025-07-10 Galen Dorpalen-Barry , Dan Dugger , Nicholas Proudfoot

We define topological invariants of regular Lagrangian fibrations using the integral affine structure on the base space and we show that these coincide with the classes known in the literature. We also classify all symplectic types of…

Symplectic Geometry · Mathematics 2015-05-14 D. Sepe

We consider a class of systems of difference equations defined on an elementary quadrilateral of the ${\mathbb{Z}}^2$ lattice, define their eliminable and dynamical variables, and demonstrate their use. Using the existence of infinite…

Exactly Solvable and Integrable Systems · Physics 2022-09-02 Louis Brady , Pavlos Xenitidis

We introduce the family of graphical Hermite simplices and study the Smith normal forms of their matrices of vertex vectors, which is equivalent to studying the group structure of the cokernels for these matrices. Our motivation is to study…

Combinatorics · Mathematics 2025-11-07 Benjamin Braun , Antwon Park

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar
‹ Prev 1 3 4 5 6 7 10 Next ›