中文
相关论文

相关论文: On a generalisation of spikes

200 篇论文

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

组合数学 · 数学 2011-05-23 Jim Geelen , Peter Nelson

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

组合数学 · 数学 2024-05-27 Joshua Erde , Pascal Gollin , Attila Joó , Paul Knappe , Max Pitz

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

组合数学 · 数学 2016-01-26 Rudi Pendavingh , Jorn van der Pol

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

组合数学 · 数学 2025-02-20 Carles Padró

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…

组合数学 · 数学 2016-12-22 Brahim Chaourar

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

In this paper, we define generalized splitting and element splitting operations on $p$-matroids. $p$-matroids are the matroids representable over $GF(p).$ The circuits and the bases of the new matroid are characterized in terms of circuits…

组合数学 · 数学 2023-03-06 Sachin Gunjal , Uday Jagadale , Prashant Malavadkar

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

组合数学 · 数学 2019-12-23 Manuel Aprile , Samuel Fiorini

A positroid is the matroid of a matrix whose maximal minors are all nonnegative. Given a permutation $w$ in $S_n$, the matroid of a generic $n \times n$ matrix whose non-zero entries in row $i$ lie in columns $w(i)$ through $n+i$ is an…

组合数学 · 数学 2018-07-25 Brendan Pawlowski

In this article, we introduce the parametric matroid $\ell$-interdiction problem, where $\ell\in\mathbb{N}_{>0}$ is a fixed number of elements allowed to be interdicted. Each element of the matroid's ground set is assigned a weight that…

组合数学 · 数学 2024-08-15 Nils Hausbrandt , Stefan Ruzika

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

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…

组合数学 · 数学 2016-06-01 Johannes Carmesin

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

组合数学 · 数学 2016-01-29 Michał Lasoń

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…

组合数学 · 数学 2019-02-20 J. Robert Johnson , Imre Leader , Paul A. Russell

To each prime ideal in a polynomial ring over a field we associate an algebraic matroid and show that it is preserved under tropicalization. This gives a necessary condition for a tropical variety to be set-theoretically realizable from a…

组合数学 · 数学 2016-08-12 Josephine Yu

We consider elliptic curves whose coefficients are degree 2 polynomials in a variable t. We prove that for infinitely many values of t the resulting elliptic curve has rank at least 1. All such curves together form an algebraic surface…

代数几何 · 数学 2016-04-12 János Kollár , Massimiliano Mella

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

群论 · 数学 2011-06-21 Masato Mimura

In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we…

组合数学 · 数学 2014-05-14 Ilya D. Shkredov

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