Related papers: A counterexample to Las Vergnas' strong map conjec…

We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Let $M$ be a matroid without loops or coloops and let $T(M;x,y)$ be its Tutte polynomial. In 1999 Merino and Welsh conjectured that $$\max(T(M;2,0), T(M;0,2))\geq T(M;1,1)$$ holds for graphic matroids. Ten years later, Conde and Merino…

Associated to a symmetrisable Cartan matrix $C$, Geiss-Lerclerc-Schr\"{o}er constructed and studied a class of Iwanaga-Gorenstein algebras $H$. They proved a generalised version of Gabriel's Theorem, that is, the rank vectors of…

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network. We exhibit a…

Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$-avoiding if the sum of the labels of its elements is not in a forbidden label set $F$. H\"orsch, Imolay, Mizutani, Oki,…

In 1980, Las Vergnas defined a notion of discrete convexity for oriented matroids, which Edelman subsequently related to the theory of anti-exchange closure functions and convex geometries. In this paper, we use generalized matroid activity…

Las Vergnas introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted that when computing the Moebius function of these lattices, it was often zero, although he…

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…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

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…

Let $M_n(\mathbb{F})$ denote the algebra of $n \times n$ matrices over an algebraically closed field $\mathbb{F}$ of characteristic different from $2$. For $n \ge 2$, we classify all maps $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$…

We prove that any separable II$_1$ factor $M$ admits a {\it coarse decomposition} over the hyperfinite II$_1$ factor $R$, i.e., there exists an embedding $R\hookrightarrow M$ such that $L^2M\ominus L^2R$ is a multiple of the coarse Hilbert…

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

Let $\phi:M_n\to B(H)$ be an injective, completely positive contraction with $\V\phi^{-1}:\phi(M_n)\to M_n\V_{cb}\leq1+\delta(\epsilon).$ We show that if either (i) $\phi(M_n)$ is faithful modulo the compact operators or (ii) $\phi(M_n)$…

We show that, if $M$ is a simple rank-$n$ matroid with no $\ell$-point line minor and no minor isomorphic to the cycle matroid of a $t$-vertex complete graph, then the ratio $|M| / n$ is bounded above by a singly exponential function of…

Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…

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…

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…