English
Related papers

Related papers: Representability of orthogonal matroids over parti…

200 papers

Baker and Bowler showed that the Grassmannian can be defined over a tract, a field-like structure generalizing both partial fields and hyperfields. This notion unifies theories of matroids over partial fields, valuated matroids, and…

Combinatorics · Mathematics 2025-11-04 Donggyu Kim

A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…

Combinatorics · Mathematics 2021-11-10 Peter Nelson , Zach Walsh

We study the representability problem for torsion-free arithmetic matroids. By using a new operation called "reduction" and a "signed Hermite normal form", we provide and implement an algorithm to compute all the representations, up to…

Combinatorics · Mathematics 2023-03-08 Roberto Pagaria , Giovanni Paolini

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

With each resonance of the Laplacian acting on the compactly supported sections of a homogeneous vector bundle over a Riemannian symmetric space of the non-compact type, One can associate a residue representation. The purpose of this paper…

Representation Theory · Mathematics 2023-04-26 Simon Roby

For any rank $r$ oriented matroid $M$, a construction is given of a "topological representation" of $M$ by an arrangement of homotopy spheres in a simplicial complex which is homotopy equivalent to $S^{r-1}$. The construction is completely…

Combinatorics · Mathematics 2009-03-17 Laura Anderson

For an $n$-element matroid $M$ given by an $n \times n$ matrix representation over a finite field $\mathbb F$ and an integer $k$, we present an $(O_{k,\mathbb F}(n^2)+O(n^\omega))$-time algorithm that either finds a branch-decomposition of…

Data Structures and Algorithms · Computer Science 2026-05-15 Mujin Choi , Tuukka Korhonen , Sang-il Oum

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

Combinatorics · Mathematics 2024-02-28 Ed Swartz , Prairie Wentworth-Nice , Alexander Xue

We study tropical subrepresentations of the Boolean regular representation $\mathbb{B}[G]$ of a finite group $G$. These are equivalent to the matroids on ground set $G$ for which left-multiplication by each element of $G$ is a matroid…

Combinatorics · Mathematics 2025-02-14 Jaiung Jun , Kalina Mincheva , Jeffrey Tolliver

We study the proportion of metric matroids whose Jacobians have nontrivial $p$-torsion. We establish a correspondence between these Jacobians and the $\mathbb{F}_p$-rational points on configuration hypersurfaces, thereby relating their…

Combinatorics · Mathematics 2025-06-17 Sergio Ricardo Zapata Ceballos

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

We show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the \#ETH---a counting extension of the Exponential Time…

Computational Complexity · Computer Science 2020-07-29 Andreas Björklund , Petteri Kaski

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

A representation field for a non-maximal order H in a central simple algebra A is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders representing H. In our previous work we…

Number Theory · Mathematics 2013-05-21 Luis Arenas-Carmona

We study realization spaces of matroids over hyperfields (in the sense of Baker and Bowler). More precisely, given a matroid M and a hyperfield H we determine the space of all H-matroids over M. This can be seen as the matroid stratum of…

Combinatorics · Mathematics 2020-01-15 Emanuele Delucchi , Linard Hoessly , Elia Saini

We prove that there is no polynomial $p(\cdot)$ with the property that a matroid $M$ can be determined to be either a lifted-graphic or frame matroid using at most $p(|M|)$ rank evaluations. This resolves two conjectures of Geelen, Gerards…

Combinatorics · Mathematics 2016-01-11 Rong Chen , Geoff Whittle

A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…

Combinatorics · Mathematics 2025-10-17 Nathaniel Vaduthala

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum
‹ Prev 1 3 4 5 6 7 10 Next ›