中文
相关论文

相关论文: On powers of Pl\"ucker coordinates and representab…

200 篇论文

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:…

组合数学 · 数学 2024-01-02 Matthew Baker , Tong Jin

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

代数几何 · 数学 2015-08-11 Nicolas Ford

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…

代数几何 · 数学 2014-09-12 Eric Katz

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't. In general these varieties are very ill-behaved, but in many cases one can estimate their…

组合数学 · 数学 2013-09-03 Nicolas Ford

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

组合数学 · 数学 2012-12-12 R. A. Pendavingh , S. H. M. van Zwam

Every Grassmannian, in its Pl\"ucker embedding, is defined by quadratic polynomials. We prove a vast, qualitative, generalisation of this fact to what we call Pl\"ucker varieties. A Pl\"ucker variety is in fact a family of varieties in…

代数几何 · 数学 2015-06-30 Jan Draisma , Rob H. Eggermont

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…

组合数学 · 数学 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…

计算复杂性 · 计算机科学 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

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…

组合数学 · 数学 2025-09-19 Matthew Baker , June Huh , Donggyu Kim , Mario Kummer , Oliver Lorscheid

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

组合数学 · 数学 2025-11-27 Sebastian Degen , Lukas Kühne

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

组合数学 · 数学 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…

数据结构与算法 · 计算机科学 2019-02-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh , Meirav Zehavi

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…

组合数学 · 数学 2011-01-26 Jim Geelen , Geoff Whittle

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

组合数学 · 数学 2023-06-01 J. Sun , S. B. Damelin

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

组合数学 · 数学 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

组合数学 · 数学 2025-08-13 Tong Jin , Donggyu Kim

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

组合数学 · 数学 2011-07-26 Michele D'Adderio , Luca Moci

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

组合数学 · 数学 2023-09-28 Jim Geelen , Matthew E. Kroeker

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…

组合数学 · 数学 2019-10-04 Matthias Lenz

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

组合数学 · 数学 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck
‹ 上一页 1 2 3 10 下一页 ›