English
Related papers

Related papers: COMs: Complexes of Oriented Matroids

200 papers

This work builds on Varchenko et al's introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formula developed by…

Combinatorics · Mathematics 2024-11-20 Winfried Hochstättler , Sophia Keip

We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The main theorems are proved by extending the methods of the first…

Metric Geometry · Mathematics 2013-05-31 Justin Malestein , Louis Theran

We prove da Silva's 1987 conjecture that any positively oriented matroid is a positroid; that is, it can be realized by a set of vectors in a real vector space. It follows from this result and a result of the third author that the positive…

Combinatorics · Mathematics 2013-11-05 Federico Ardila , Felipe Rincón , Lauren Williams

Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex…

Combinatorics · Mathematics 2021-03-03 Domenico Cantone , Jean-Paul Doignon , Alfio Giarlotta , Stephen Watson

Motivated by the recent definition of $AM$-property in locally solid vector lattices [O. Zabeti, arXiv: 1912.00141v2 [math.FA]], in this note, we try to investigate those results in the category of all locally solid lattice rings. In fact,…

Functional Analysis · Mathematics 2020-02-12 Omid Zabeti

Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…

Combinatorics · Mathematics 2012-01-17 Christian Joseph Altomare

We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…

Data Structures and Algorithms · Computer Science 2018-11-06 Nima Anari , Shayan Oveis Gharan , Cynthia Vinzant

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

Combinatorics · Mathematics 2024-05-30 Ulysses Alvarez , Ross Geoghegan

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel Gelfand

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

Combinatorics · Mathematics 2020-07-20 Roberto Pagaria

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

The state space of an operator system of $n$-by-$n$ matrices has, in a sense, many normal cones. Merely this convex geometrical property implies smoothness qualities and a clustering property of exposed faces. The latter holds since each…

Metric Geometry · Mathematics 2020-01-07 Stephan Weis

Las Vergnas introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted that when computing the Moebius function of these lattices, it was often zero, although he…

Combinatorics · Mathematics 2007-05-23 Rieuwert Blok , Bruce Sagan

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

Category Theory · Mathematics 2020-04-21 Gregory Henselman-Petrusek

A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…

Combinatorics · Mathematics 2023-10-26 Arnau Padrol , Eva Philippe

We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…

Strongly Correlated Electrons · Physics 2007-05-23 Steven R. White

We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…

Combinatorics · Mathematics 2026-03-20 Kyle Binder

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Combinatorics · Mathematics 2026-05-27 Arnau Padrol , Germain Poullot

We prove that simply connected local 2-dimensional simplicial complexes embed in 3-space if and only if their dual matroids are graphic. Examples are provided that the assumptions of simply connectedness and locality are necessary. This may…

Combinatorics · Mathematics 2022-10-28 Johannes Carmesin
‹ Prev 1 3 4 5 6 7 10 Next ›