English
Related papers

Related papers: Extension-lifting Bijections for Oriented Matroids

200 papers

For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…

Combinatorics · Mathematics 2023-12-13 Emeric Gioan

The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan , Michel Las Vergnas

We establish two explicit bijections: from acyclic reorientations of an oriented matroid to no broken circuit (NBC) subsets of its underlying matroid, and from regions of a real hyperplane arrangement to its affine NBC subsets.

Combinatorics · Mathematics 2024-08-16 Houshan Fu , Baoren Peng , Suijie Wang , Jinxing Yang

In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of…

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

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

Combinatorics · Mathematics 2023-06-14 Changxin Ding

We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…

Combinatorics · Mathematics 2019-12-03 Éric Fusy , Benjamin Lévêque

Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…

Combinatorics · Mathematics 2020-06-17 Ilan Adler , Jesús A. De Loera , Steven Klee , Zhenyang Zhang

Matroids over skew tracts provide an algebraic framework simultaneously generalizing the notions of linear subspaces, matroids, oriented matroids, phased matroids, and some other ``matroids with extra structure". A single-element extension…

Combinatorics · Mathematics 2025-12-24 Ting Su

We introduce a construction of oriented matroids from a triangulation of a product of two simplices. For this, we use the structure of such a triangulation in terms of polyhedral matching fields. The oriented matroid is composed of…

Combinatorics · Mathematics 2020-10-26 Marcel Celaya , Georg Loho , Chi Ho Yuen

In this paper we extend the theory of oriented matroids to Lagrangian orthogonal matroids and their representations, and give a completely natural transformation from a representation of a classical oriented matroid to a representation of…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

In a previous work, we gave a construction of (not necessarily realizable) oriented matroids from a triangulation of a product of two simplices. In this follow-up paper, we use a variant of Viro's patchworking to derive a topological…

Combinatorics · Mathematics 2020-10-26 Marcel Celaya , Georg Loho , Chi Ho Yuen

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

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…

Combinatorics · Mathematics 2007-06-25 Federico Ardila , Mike Develin

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…

Combinatorics · Mathematics 2023-01-06 Shital D. Solanki , Ganesh Mundhe , S. B. Dhotre

Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized…

Combinatorics · Mathematics 2018-03-19 Pavel Galashin , Gleb Nenashev , Alexander Postnikov

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

Combinatorics · Mathematics 2025-06-30 Changxin Ding
‹ Prev 1 2 3 10 Next ›