English
Related papers

Related papers: A generalisation of uniform matroids

200 papers

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 paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge Luis Ramírez Alfonsín

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

Combinatorics · Mathematics 2017-01-06 Ron Aharoni , Eli Berger , Dani Kotlar , Ran Ziv

Let $G$ be a semisimple linear algebraic group over a field $k$ and let $G^+(k)$ be the subgroup generated by the subgroups $R_u(Q)(k)$, where $Q$ ranges over all the minimal $k$-parabolic subgroups $Q$ of $G$. We prove that if $G^+(k)$ is…

Group Theory · Mathematics 2022-03-01 Jarek Kędra , Assaf Libman , Ben Martin

In this paper we prove the following theorem. Let L/\Q_p be a finite extension with ring of integers O_L and maximal ideal lambda. Theorem 1. Suppose that p >= 5. Suppose also that \rho:G_\Q -> GL_2(O_L) is a continuous representation…

Number Theory · Mathematics 2016-09-07 Kevin Buzzard , Richard Taylor

The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of…

Combinatorics · Mathematics 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element subset X of E(M) such that one of M\X…

Combinatorics · Mathematics 2014-12-12 Jim Geelen , Stefan H. M. van Zwam

In this document we study the uniform local path connectivity of sets of $m$-tuples of pairwise commuting normal matrices with some additional constraints. More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in…

Numerical Analysis · Mathematics 2019-12-19 Fredy Vides

Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…

Combinatorics · Mathematics 2021-03-26 Pavel Galashin , Alexander Postnikov

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

Combinatorics · Mathematics 2014-10-29 Jim Geelen , Peter Nelson

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

Combinatorics · Mathematics 2014-03-26 Sang-il Oum

An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Jim Geelen , Peter Nelson

Let $M$ be a representable matroid, and $Q, R, S, T$ subsets of the ground set. We prove that, if $M$ is sufficiently large, then there is an element $e$ such that deleting or contracting $e$ preserves both the $Q$-$R$ and the $S$-$T$…

Combinatorics · Mathematics 2018-01-16 Tony Huynh , Stefan van Zwam

Let k be a field not of characteristic two and L be a set of almost all rational primes invertible in k. Suppose we have a variety X/k and strictly compatible system {M_ell -> X : ell in L} of constructible F_ell-sheaves. If the system is…

Number Theory · Mathematics 2007-05-23 Chris Hall

In this paper, we investigate the componentwise linearity and the Castelnuovo-Mumford regularity of symbolic powers of polymatroidal ideals. For a polymatroidal ideal $I$, we conjecture that every symbolic power $I^{(k)}$ is componentwise…

Commutative Algebra · Mathematics 2025-02-28 Antonino Ficarra , Somayeh Moradi

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

Combinatorics · Mathematics 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

The Kazhdan-Lusztig polynomial of a matroid was introduced by Elias, Proudfoot, and Wakefield [{\it Adv. Math. 2016}]. Let $U_{m,d}$ denote the uniform matroid of rank $d$ on a set of $m+d$ elements. Gedeon, Proudfoot, and Young [{\it J.…

Combinatorics · Mathematics 2018-06-29 Alice L. L. Gao , Linyuan Lu , Matthew H. Y. Xie , Arthur L. B. Yang , Philip B. Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›