Related papers: On matrices with different tropical and Kapranov r…
De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…
We show that several decision problems originating from max-plus or tropical convexity are equivalent to zero-sum two player game problems. In particular, we set up an equivalence between the external representation of tropical convex sets…
In this paper we count the number of some particular quintuple persymmetric rank i matrices over F_2.
A matrix always has a full rank submatrix such that the rank of this matrix is equal to the rank of that submatrix. This property is one of the corner stones of the matrix rank theory. We call this property the max-full-rank-submatrix…
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct…
Let $F$ be the finite field of order $q$ and $\M(n,r, F)$ be the set of $n\times n$ matrices of rank $r$ over the field $F$. For $\alpha\in F$ and $A\in \M(n,F)$, let $$Z^{\alpha}_{A,r}=\left\{X\in \M(n,r, F)\mid \tr(AX)=\alpha\right \}.$$…
We prove for a tropical rational map that if for any point the convex hull of Jacobian matrices at smooth points in a neighborhood of the point does not contain singular matrices then the map is an isomorphism. We also show that a tropical…
We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.
Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…
We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…
If three right-handed neutrinos are added to the Standard Model, then, for the three known generations, there are six quarks and six leptons. It is then natural to assume that the symmetry considerations that have been applied to the quark…
In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…
Given an assignment of real weights to the ground elements of a matroid, the min-max weight of a ground element $e$ is the minimum, over all circuits containing $e$, of the maximum weight of an element in that circuit with the element $e$…
We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…
Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…
Describing the combinatorial structure of the tropical complex $C$ of a tropical matroid polytope, we obtain a formula for the coarse types of the maximal cells of $C$. Due to the connection between tropical complexes and resolutions of…
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs without the diamond K_4-e as a subgraph. We generalize the second…
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
A rack on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is a permutation of $[n]$ such that $f_{(x)f_y} = f_y^{-1}f_xf_y$ for all $x$ and $y$. In 2013, Blackburn showed that the number of isomorphism classes…