English
Related papers

Related papers: Lifts of matroid representations over partial fiel…

200 papers

A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We prove a similar characterization for 3-connected matroids with modular 4-point lines. We show that such a matroid is either representable…

Combinatorics · Mathematics 2014-06-11 Rohan Kapadia

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

We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…

Combinatorics · Mathematics 2012-07-10 Elad Aigner-Horev , Johannes Carmesin , Jan-Oliver Fröhlich

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

Rings and Algebras · Mathematics 2013-03-05 Clément de Seguins Pazzis

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

Combinatorics · Mathematics 2026-05-28 Lukas Kühne , Geva Yashfe

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Rings and Algebras · Mathematics 2014-09-23 Brian T. Chan

In her paper "Generalized matroids and supermodular colourings", Tardos studied special delta-matroids obtained from sequences of Higgs lifts; these are the full Higgs lift delta-matroids that we treat and around which all of our results…

Combinatorics · Mathematics 2024-08-07 Joseph E Bonin , Carolyn Chun , Steven D Noble

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…

Combinatorics · Mathematics 2016-07-05 Rong Chen , Zifei Gao

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of (hyperbolic) matroids which properly contains the class of…

Combinatorics · Mathematics 2015-12-21 Nima Amini , Petter Brändén

Let G be a connected reductive group over a field of characteristic zero, and consider an orthogonal representation of G. We give a simple criterion for whether the representation lifts to the spin group, in terms of the highest weights of…

Representation Theory · Mathematics 2020-12-03 Rohit Joshi , Steven Spallone

We relate two conjectures that play a central role in the reported proof of Rota's Conjecture. Let $\mathbb F$ be a finite field. The first conjecture states that: the branch-width of any $\mathbb F$-representable $N$-fragile matroid is…

Combinatorics · Mathematics 2019-09-09 Jim Geelen , Florian Hoersch

There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…

Rings and Algebras · Mathematics 2012-04-18 Petter Brändén

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 say that a two dimensional p-adic Galois representation of a number field F is weight two if it is de Rham with Hodge-Tate weights 0 and -1 equally distributed at each place above p; for example, the Tate module of an elliptic curve has…

Number Theory · Mathematics 2009-05-27 Andrew Snowden

Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;\alpha)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} \alpha_e$, where…

Combinatorics · Mathematics 2025-03-25 Eduard Lerner

For a hypergraph $H$ let $\beta(H)$ denote the minimal number of edges from $H$ covering $V(H)$. An edge $S$ of $H$ is said to represent {\em fairly} (resp. {\em almost fairly}) a partition $(V_1,V_2, \ldots, V_m)$ of $V(H)$ if $|S\cap…

Combinatorics · Mathematics 2016-11-11 Ron Aharoni , Noga Alon , Eli Berger , Maria Chudnovsky , Dani Kotlar , Martin Loebl , Ran Ziv

Recently, it was proved by B\'erczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were…

Combinatorics · Mathematics 2023-05-30 Florian Hörsch , Tomáš Kaiser , Matthias Kriesell