English
Related papers

Related papers: Perfect matroids over hyperfields

200 papers

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Combinatorics · Mathematics 2016-12-22 Brahim Chaourar

We examine several aspects of the formulation of M(atrix)-Theory on ALE spaces. We argue for the existence of massless vector multiplets in the resolved $A_{n-1}$ spaces, as required by enhanced gauge symmetry in M-Theory, and that these…

High Energy Physics - Theory · Physics 2016-08-25 David Berenstein , Richard Corrado , Jacques Distler

A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…

Combinatorics · Mathematics 2007-05-23 Serkan Hosten , Diane Maclagan , Bernd Sturmfels

A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive.…

Combinatorics · Mathematics 2017-07-24 Carrie Rutherford , Robin Whitty

We study a special class of (real or complex) robust Hadamard matrices, distinguished by the property that their projection onto a $2$-dimensional subspace forms a Hadamard matrix. It is shown that such a matrix of order $n$ exists, if…

Combinatorics · Mathematics 2026-05-21 Grzegorz Rajchel-Mieldzioć , Adam Gąsiorowski , Karol Życzkowski

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

Information Theory · Computer Science 2016-01-13 P. J. Almeida , D. Napp , R. Pinto

It is proved that the broken circuit complex of an ordered matroid is Gorenstein if and only if it is a complete intersection. Several characterizations for a matroid that admits such an order are then given, with particular interest in the…

Combinatorics · Mathematics 2014-04-08 Le Van Dinh

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Combinatorics · Mathematics 2013-10-01 J. A. De Loera , J. Lee , S. Margulies , J. Miller

We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…

Combinatorics · Mathematics 2013-05-15 Wojciech Kordecki

We study varieties associated to hypergraphs from the point of view of projective geometry and matroid theory. We describe their decompositions into matroid varieties, which may be reducible and can have arbitrary singularities by the…

Combinatorics · Mathematics 2025-12-18 Oliver Clarke , Kevin Grace , Fatemeh Mohammadi , Harshit J Motwani

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa

Given a special Kahler manifold M, we give a new, direct proof of the relationship between the quaternionic structure on its cotangent bundle and the variation of Hodge structures on the complexification of TM.

Mathematical Physics · Physics 2011-11-10 Claudio Bartocci , Igor Mencattini

We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is beyond a computable bound, the Markov bases consist…

Combinatorics · Mathematics 2008-04-18 Serkan Hosten , Seth Sullivant

Consider a smooth affine algebraic variety $X$ over an algebraically closed field, and let a finite group $G$ act on it. We assume that the characteristic of the field is greater than the dimension of $X$ and the order of $G$. An explicit…

Quantum Algebra · Mathematics 2007-05-23 Rina Anno

A quadratic form over a Henselian-valued field of arbitrary residue characteristic is tame if it becomes hyperbolic over a tamely ramified extension. The Witt group of tame quadratic forms is shown to be canonically isomorphic to the Witt…

K-Theory and Homology · Mathematics 2010-02-08 Mohamed Abdou Elomary , Jean-Pierre Tignol

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

For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrow\Lambda$ of ordered groups, we analyze the structure of the tree formed by all $\Lambda$-valued extensions of $v$ to the polynomial ring $K[x]$. As an…

Algebraic Geometry · Mathematics 2022-04-26 Maria Alberich-Carramiñana , Jordi Guàrdia , Enric Nart , Joaquim Roé

Building on a recent joint paper with Sturmfels, here we argue that the combinatorics of matroids is intimately related to the geometry and topology of toric hyperkaehler varieties. We show that just like toric varieties occupy a central…

Algebraic Geometry · Mathematics 2007-05-23 Tamas Hausel

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…

Combinatorics · Mathematics 2019-10-03 Tony Huynh , Peter Nelson

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