Related papers: Relations between M\"obius and coboundary polynomi…
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…
Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich…
This paper concerns the bounds for spectral norm distance from a normal matrix polynomial $P(\lambda)$ to the set of matrix polynomials that have $\mu$ as a multiple eigenvalue. Also construction of associated perturbations of $P(\lambda)$…
A formula for the number of toroidal m x n binary arrays, allowing rotation of the rows and/or the columns but not reflection, is known. Here we find a formula for the number of toroidal m x n binary arrays, allowing rotation and/or…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each…
We study coamoebas of polynomials supported on circuits. Our results include an explicit description of the space of coamoebas, a relation between connected components of the coamoeba complement and critical points of the polynomial, an…
It is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this important theorem. We also described a discrete homotopy theorem…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
This paper shows a polynomial-time algorithm, that given a general matroid $M_1 = (X, \mathcal{I}_1)$ and $k-1$ partition matroids $ M_2, \ldots, M_k$, produces a coloring of the intersection $M = \cap_{i=1}^k M_i$ using at most…
In this paper we prove that the Carath\'eodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of the ground set.
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…
In the paper [Proceedings of the Japan Academy, Ser. A Mathematical Sciences, 95(10) 111-113], the authors introduce the concept of the Tutte polynomials of genus $g$ and announce that each matroid $M$ can be reconstructed from its Tutte…