English
Related papers

Related papers: Orthogonal matroids over tracts

200 papers

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes…

Combinatorics · Mathematics 2012-12-11 Silke Horn

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

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…

Combinatorics · Mathematics 2026-03-11 Jannis Koulman , Oliver Lorscheid

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…

Combinatorics · Mathematics 2011-09-07 Peter J. Cameron , Maximilien Gadouleau , Søren Riis

Several matroids can be defined on the edge set of a graph. Although historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s…

Combinatorics · Mathematics 2014-04-18 Vaidy Sivaraman

Previous work of Chan--Church--Grochow and Baker--Wang shows that the set of spanning trees in a plane graph $G$ is naturally a torsor for the Jacobian group of $G$. Informally, this means that the set of spanning trees of $G$ naturally…

Combinatorics · Mathematics 2025-02-18 Matthew Baker , Changxin Ding , Donggyu Kim

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

Baker and Bowler defined a category of algebraic objects called tracts which generalize both partial fields and hyperfields. They also defined a notion of weak and strong matroids over a tract $F$, and proved that if $F$ is perfect, meaning…

Combinatorics · Mathematics 2025-06-30 Matthew Baker , Tianyi Zhang

We investigate valuated matroids with an additional algebraic structure on their residue matroids. We encode the structure in terms of representability over stringent hyperfields. A hyperfield $H$ is {\em stringent} if $a\boxplus b$ is a…

Combinatorics · Mathematics 2023-03-15 Nathan Bowler , Rudi Pendavingh

This is an introductory paper about the category of regular oriented matroids (ROMs). We compare the homotopy types of the categories of regular and binary matroids. For example, in the unoriented case, they have the same fundamental group…

Combinatorics · Mathematics 2009-11-17 Kiyoshi Igusa

We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann--Pl\"ucker functions. The equivalence is motivated by Cayley's identities expressing principal and almost-principal minors of a…

Combinatorics · Mathematics 2026-02-03 Changxin Ding , Donggyu Kim

We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…

Combinatorics · Mathematics 2025-09-19 Matthew Baker , June Huh , Donggyu Kim , Mario Kummer , Oliver Lorscheid

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…

Discrete Mathematics · Computer Science 2009-09-29 Konstantinos Papalamprou , Leonidas Pitsoulis

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

Combinatorics · Mathematics 2013-04-25 Jim Geelen , Rohan Kapadia

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

Combinatorics · Mathematics 2026-03-11 Koji Imamura , Keisuke Shiromoto

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh