English
Related papers

Related papers: Von Staudt Constructions for Skew-Linear and Multi…

200 papers

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…

Combinatorics · Mathematics 2014-04-09 Zvi Rosen

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…

Combinatorics · Mathematics 2019-10-03 Matthias Lenz

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

Combinatorics · Mathematics 2020-07-20 Roberto Pagaria

There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…

Combinatorics · Mathematics 2007-05-23 Edward Swartz

A VB-algebroid is a vector bundle object in the category of Lie algebroids. We attach to every VB-algebroid a differential graded Lie algebra and we show that it controls deformations of the VB-algebroid structure. Several examples and…

Differential Geometry · Mathematics 2019-12-25 Pier Paolo La Pastina , Luca Vitagliano

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Combinatorics · Mathematics 2015-10-26 Leonidas Pitsoulis , Eleni-Maria Vretta

We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…

Combinatorics · Mathematics 2011-03-03 Zur Izhakian , John Rhodes

We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…

Combinatorics · Mathematics 2024-02-13 Oliver Clarke , Giacomo Masiero , Fatemeh Mohammadi

Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related to almost affine codes. In this paper, we introduce and study…

Combinatorics · Mathematics 2026-05-18 Gianira N. Alfarano , Sebastian Degen

We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…

Combinatorics · Mathematics 2012-01-13 Yasuyuki Tsukamoto

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

In this article we develop a new method to deal with maximal Cohen-Macaulay modules over non-isolated surface singularities. In particular, we give a negative answer on an old question of Schreyer about surface singularities with only…

Algebraic Geometry · Mathematics 2013-09-25 Igor Burban , Yuriy Drozd

We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We establish the existence of such an embedding for binary…

Data Structures and Algorithms · Computer Science 2025-10-20 Andrés Cristi , Paul Dütting , Robert Kleinberg , Renato Paes Leme , Neel Patel

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

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 show that the linear strands of the Tor of determinantal varieties in spaces of symmetric and skew-symmetric matrices are irreducible representations for the periplectic (strange) Lie superalgebra. The structure of these linear strands…

Representation Theory · Mathematics 2014-08-19 Steven V Sam

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

Data Structures and Algorithms · Computer Science 2021-09-14 René van Bevern , Oxana Yu. Tsidulko , Philipp Zschoche