Related papers: A counterexample to Las Vergnas' strong map conjec…
Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…
The Matroid Secretary Conjecture is a notorious open problem in online optimization. It claims the existence of an $O(1)$-competitive algorithm for the Matroid Secretary Problem (MSP). Here, the elements of a weighted matroid appear…
Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…
We give the following extension of Barany's colorful Caratheodory theorem: Let M be an oriented matroid and N a matroid with rank function r, both defined on the same ground set V and satisfying rank(M) < rank(N). If every subset A of V…
We initiate a study of linear maps on $M_n(\mathbb{C})$ that have the property that they factor through a tracial von Neumann algebra $(\mathcal{A,\tau})$ via operators $Z\in M_n(\mathcal{A})$ whose entries consist of positive elements from…
The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that for any $d\ge 2$ and any prime $p>(d^2-3d+4)^2$ there is no complete mapping polynomial in $\mathbb{F}_{p}[x]$ of degree $d$. For arbitrary finite fields…
We introduce the notion of ungraded matrix factorization as a mirror of non-orientable Lagrangian submanifolds. An ungraded matrix factorization of a polynomial $W$, with coefficients in a field of characteristic 2, is a square matrix $Q$…
We discuss the $F$-matrices associated to the $R$-matrix of a general $N$-state vertex model whose statistical configurations encode $N-1$ U(1) symmetries. The factorization condition is shown for arbitrary weights being based only on the…
One of the most intriguing unsolved questions of matroid optimization is the characterization of the existence of $k$ disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures…
Recently, it was proved by B\'erczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were…
Let $M$ be an uniformizable Anderson t-motive and $L(M)$ its lattice. First, we prove by an explicit construction that for the non-mixed $M$ the lattice map $M\mapsto L(M)$ is not injective. Second, we show that some lattices which do not…
We prove (and improve) the Muir-Suffridge conjecture for holomorphic convex maps. Namely, let $F:\mathbb B^n\to \mathbb C^n$ be a univalent map from the unit ball whose image $D$ is convex. Let $\mathcal S\subset \partial \mathbb B^n$ be…
We consider the moment map $m:\mathbb{P}V_n\rightarrow \text{i}\mathfrak{u}(n)$ for the action of $\text{GL}(n)$ on $V_n=\otimes^{2}(\mathbb{C}^{n})^{*}\otimes\mathbb{C}^{n}$, and study the functional $F_n=\|m\|^{2}$ restricted to the…
An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…
Every tropical ideal in the sense of Maclagan-Rinc\'on has an associated tropical variety, a finite polyhedral complex equipped with positive integral weights on its maximal cells. This leads to the realisability question, ubiquitous in…
In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…
In this work, we investigate the existence of a factorization for a unital completely positive map, between non-commutative probability space which do not change the expectation values of the events. These maps are called in literature…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…
Motivated by the strong nearby Lagrangian conjecture, we constrain the parametrised Whitehead torsion of a family of closed exact Lagrangian submanifolds in a cotangent bundle. We prove the parametrised Whitehead torsion admits a…