English
Related papers

Related papers: Topological representations of matroid maps

200 papers

In the matroid secretary problem we are given a stream of elements and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from…

Data Structures and Algorithms · Computer Science 2012-07-24 Michael Dinitz , Guy Kortsarz

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

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

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 finite group. The unit sphere in a finite-dimensional orthogonal G-representation motivates the definition of homotopy representations, due to tom Dieck. We introduce an algebraic analogue, and establish its basic properties…

Algebraic Topology · Mathematics 2017-08-29 Ian Hambleton , Ergun Yalcin

A combinatorial neural code $\mathscr C\subseteq 2^{[n]}$ is convex if it arises as the intersection pattern of convex open subsets of $\mathbb R^d$. We relate the emerging theory of convex neural codes to the established theory of oriented…

Combinatorics · Mathematics 2026-03-12 Alexander Kunin , Caitlin Lienkaemper , Zvi Rosen

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…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

We prove several positive results regarding representation of homotopy classes of spheres and algebraic groups by regular mappings. Most importantly we show that every mapping from a sphere to an orthogonal or a unitary group is homotopic…

Algebraic Geometry · Mathematics 2024-06-18 Juliusz Banecki

A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…

Combinatorics · Mathematics 2023-09-20 Hery Randriamaro

A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…

Combinatorics · Mathematics 2011-09-15 Bertrand Guenin , Irene Pivotto , Paul Wollan

A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…

Representation Theory · Mathematics 2017-11-09 Michael Lambert

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…

Combinatorics · Mathematics 2015-06-23 Priyavrat Deshpande

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

Combinatorics · Mathematics 2017-04-21 Matthew Baker , Nathan Bowler

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

This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…

Representation Theory · Mathematics 2024-04-03 Benjamin Steinberg

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

Data Structures and Algorithms · Computer Science 2021-09-14 René van Bevern , Oxana Yu. Tsidulko , Philipp Zschoche

q-Matroids form the q-analogue of classical matroids. In this paper we introduce various types of maps between q-matroids. These maps are not necessarily linear, but they map subspaces to subspaces and respect the q-matroid structure in…

Combinatorics · Mathematics 2023-03-14 Heide Gluesing-Luerssen , Benjamin Jany

A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…

Combinatorics · Mathematics 2025-01-22 Winfried Hochstättler , Michael Wilhelmi

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

We consider the intersection map on the family of non-empty $\omega$-Scott-open sets of the lattice of opens of a topological space. We prove that in a certain class of topological spaces the intersection map forms a continuous retraction…

Logic · Mathematics 2015-01-27 Matthias Schröder