English
Related papers

Related papers: Lindstr\"om's conjecture on a class of algebraical…

200 papers

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms of $n$, on the least positive characteristic and smallest field over which $M$ is representable.

Combinatorics · Mathematics 2019-10-28 Jason Bell , Daryl Funk , Byoung Du Kim , Dillon Mayhew

In Alm-Hirsch-Maddux (2016), relation algebras $\mathfrak{L}(q,n)$ were defined that generalize Roger Lyndon's relation algebras from projective lines, so that $\mathfrak{L}(q,0)$ is a Lyndon algebra. In that paper, it was shown that if…

Logic · Mathematics 2017-03-21 Jeremy F. Alm

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

We study the number $M_n(T)$ be the number of integer $n\times n$ matrices $A$ with entries bounded in absolute value by $T$ such that the Galois group of characteristic polynomial of $A$ is not the full symmetric group $S_n$. One knows…

Number Theory · Mathematics 2025-07-14 Theresa C. Anderson , Evan M. O'Dorney

We conjecture that it is not possible to finitely axiomatize matroid representability in monadic second-order logic for matroids, and we describe some partial progress towards this conjecture. We present a collection of sentences in monadic…

Combinatorics · Mathematics 2016-02-16 Dillon Mayhew , Mike Newman , Geoff Whittle

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

If $A$ and $B$ are $n$- and $m$-representation finite $k$-algebras, then their tensor product $\Lambda = A\otimes_k B$ is not in general $(n+m)$-representation finite. However, we prove that if $A$ and $B$ are acyclic and satisfy the weaker…

Representation Theory · Mathematics 2019-04-09 Andrea Pasquali

Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…

Commutative Algebra · Mathematics 2026-02-18 Zvi Rosen , Jessica Sidman , Louis Theran

Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

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

Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that…

Combinatorics · Mathematics 2013-01-28 Nathan Bowler , Johannes Carmesin

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

Combinatorics · Mathematics 2024-01-02 Matthew Baker , Tong Jin

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton

We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…

Combinatorics · Mathematics 2021-12-09 Daniel Irving Bernstein

In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…

Combinatorics · Mathematics 2007-05-23 Massimiliano Lunelli , Antonio Laface

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich…

Combinatorics · Mathematics 2016-11-10 Eduard Yu. Lerner