Related papers: Internally Perfect Matroids
Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M…
The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family $ (M_i: i\in\Theta) $ of matroids on the common edge set $ E $ is a system $…
In this paper we prove that the Stanley--Reisner ideal or cover ideal $I$ of a matroid is minimally resolvable by iterated mapping cones. As a technical tool for this purpose, we introduce and study focal matroids, which are submatroids of…
In 1980 Montgomery made a conjecture about the true order of the error term in the prime number theorem. In 2012 the author made an analogous conjecture for the true order of the sum of the M\"{o}bius function, $M(x)$. This refined an…
Let $\mathcal M$ be a class of matroids closed under minors and isomorphism. Let $N$ be a matroid in $\mathcal M$ with an exact $k$-separation $(A, B)$. We say $N$ is a $k$-decomposer for $\mathcal M$ having $(A, B)$ as an inducer, if every…
A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
Let $\u_{1\times n}$, $\X_{n\times n}$, and $\v_{n\times 1}$ be matrices of indeterminates, $\Adj \X$ be the classical adjoint of $\X$, and $H(n)$ be the ideal $I_1(\u\X)+I_1(\X\v)+I_1(\v\u-\Adj \X)$. Vasconcelos has conjectured that $H(n)$…
Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-connected pieces, circuits and cocircuits together with…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…
In this paper, we partially confirm a conjecture, proposed by Cimpoea\c{s}, Keller, Shen, Streib and Young, on the Stanley depth of squarefree Veronese ideals $I_{n,d}$. This conjecture suggests that, for positive integers $1 \le d \le n$,…
Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
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…
Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. In this paper, it is shown that Stanley's conjecture holds for $S/I$, if $I$ is a weakly polymatroidal ideal.
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…
A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…
In 1989, Rota made the following conjecture. Given $n$ bases $B_{1},\dots,B_{n}$ in an $n$-dimensional vector space $V$, one can always find $n$ disjoint bases of $V$, each containing exactly one element from each $B_{i}$ (we call such…
The stable core, an inner model of the form $\langle L[S],\in, S\rangle$ for a simply definable predicate $S$, was introduced by the first author in [Fri12], where he showed that $V$ is a class forcing extension of its stable core. We study…