中文
相关论文

相关论文: On Kahn's basis conjecture

200 篇论文

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

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

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 prove that, if $B_1, \dots, B_n$ are disjoint bases of a rank-$n$ matroid, then there are at least $\lfloor{\frac{n}{6 \lceil{\log n}\rceil}}\rfloor$ disjoint transversals of $(B_1, \dots, B_n)$ that are also bases.

组合数学 · 数学 2018-02-06 Sally Dong , Jim Geelen

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

交换代数 · 数学 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…

组合数学 · 数学 2025-10-07 Yu-Chuan Yu , Chi Ho Yuen

The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…

组合数学 · 数学 2026-01-07 S. Akansha , K. C. Sivakumar

It was conjectured by Kotlar and Ziv that for any two bases $B_1$ and $B_2$ in a matroid $M$ and any subset $X \subset B_1$, there is a subset $Y$ and orderings $x_1 \prec x_2 \prec \cdots \prec x_k$ and $y_1 \prec y_2 \prec \cdots \prec…

组合数学 · 数学 2023-05-03 Sean McGuinness

Representation theory provides a suitable framework to count and classify invariants in tensor models. We show that there are two natural ways of counting invariants, one for arbitrary rank of the gauge group and a second, which is only…

高能物理 - 理论 · 物理学 2018-04-04 Pablo Diaz , Soo-Jong Rey

The Alon-Tarsi Latin square conjecture is extended to odd dimensions by stating it for reduced Latin squares (Latin squares having the identity permutation as their first row and first column). A modified version of Onn's colorful…

组合数学 · 数学 2014-07-29 Ron Aharoni , Daniel Kotlar

We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…

组合数学 · 数学 2018-12-10 Jérémie Chalopin , Victor Chepoi , Damian Osajda

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

组合数学 · 数学 2015-11-12 Shalev Ben-David , Jim Geelen

Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…

历史与综述 · 数学 2022-07-29 Jun Lu

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…

组合数学 · 数学 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

Stanley conjectured in 1977 that the $h$-vector of a matroid simplicial complex is a pure $O$-sequence. We give simple constructive proofs that the conjecture is true for matroids of rank less than or equal to 3, and corank 2. We used…

组合数学 · 数学 2011-06-15 Jesus DeLoera , Yvonne Kemper , Steven Klee

In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This…

组合数学 · 数学 2014-06-10 Steven Klee , Jose Alejandro Samper

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…

组合数学 · 数学 2007-05-23 Glenn G. Chappell

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

组合数学 · 数学 2011-07-07 Martin Tancer

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the…

泛函分析 · 数学 2019-05-14 Kevin Schlegel