English
Related papers

Related papers: Inequivalent Representations of Matroids over Prim…

200 papers

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

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

Combinatorics · Mathematics 2013-09-04 Robert Brijder , Hendrik Jan Hoogeboom , Lorenzo Traldi

The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…

Information Theory · Computer Science 2017-02-03 Jayant Apte , John MacLaren Walsh

Given a finite group G and a field F, a G-set X gives rise to an F[G]-permutation module F[X]. This defines a map from the Burnside ring of G to its representation ring over F. It is an old problem in representation theory, with…

Representation Theory · Mathematics 2019-02-06 Alex Bartel , Matthew Spencer

Let p be a prime number and M a quadratic number field, M not equal to Q(\sqrt{p}) if p is congruent to 1 modulo 4. We will prove that for any positive integer d there exists a Galois extension F/Q with Galois group D_{2p} and an elliptic…

Number Theory · Mathematics 2015-10-12 Alex Bartel

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

Combinatorics · Mathematics 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

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

Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding and representable discrete polymatroids. We consider vector linear solutions of…

Information Theory · Computer Science 2016-03-22 Vijayvaradharaj T. Muralidharan , B. Sundar Rajan

For a finite multigraph G, the reliability function of G is the probability R_G(q) that if each edge of G is deleted independantly with probability q then the remaining edges of G induce a connected spanning subgraph of G; this is a…

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

Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindstr\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…

Quantum Physics · Physics 2011-04-07 Pradeep Sarvepalli

An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and only if it can be represented by a graph-like topological…

Combinatorics · Mathematics 2013-09-17 Nathan Bowler , Johannes Carmesin , Robin Christian

We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the…

Data Structures and Algorithms · Computer Science 2021-12-23 Gwenaël Joret , Adrian Vetta

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

Let K be a field, let R=K[x_1,..., x_m] be a polynomial ring with the standard Z^m-grading (multigrading), let L be a Noetherian multigraded R-module, and let F: E --> G be a finite free multigraded presentation of L over R. Given a choice…

Commutative Algebra · Mathematics 2007-05-23 Alexandre Tchernev

Let $q$ be a fixed odd prime. We show that a finite subset $B$ of integers, not containing any perfect $q^{th}$ power, contains a $q^{th}$ power modulo almost every prime if and only if $B$ corresponds to a blocking set (with respect to…

Number Theory · Mathematics 2025-07-11 Bhawesh Mishra , Paolo Santonastaso

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…

Combinatorics · Mathematics 2007-05-23 Juergen Bokowski , Simon King , Susanne Mock , Ileana Streinu

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

Combinatorics · Mathematics 2025-03-20 Bill Jackson , Shin-ichi Tanigawa

Let $q$ be an odd prime and $B = \{b_{j}\}_{j=1}^{l}$ be a finite set of nonzero integers that does not contain a perfect $q^{th}$ power. We show that $B$ has a $q^{th}$ power modulo every prime $p \neq q$ and not dividing $\prod_{b\in B}…

Number Theory · Mathematics 2023-06-19 Bhawesh Mishra

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler