Search arXivSearch

arXiv · 1709.09707

Matroids over partial hyperstructures

Abstract

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 generalize both hyperfields in the sense of Krasner and partial fields in the sense of Semple and Whittle. We then define matroids over tracts; in fact, there are (at least) two natural notions of matroid in this general context, which we call weak and strong matroids. We give "cryptomorphic" axiom systems for such matroids in terms of circuits, Grassmann-Plücker functions, and dual pairs, and establish some basic duality results. We then explore sufficient criteria for the notions of weak and strong matroids to coincide. For example, if $F$ is a particularly nice kind of tract called a doubly distributive partial hyperfield, we show that the notions of weak and strong $F$-matroids coincide. We also give examples of tracts $F$ and weak $F$-matroids which are not strong. Our theory of matroids over tracts is closely related to, but more general than, "matroids over fuzzy rings" in the sense of Dress and Dress-Wenzel.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew Baker, Nathan Bowler. 2018-12-12. Matroids over partial hyperstructures. https://arxiv.org/abs/1709.09707

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO