Related papers: Maximal rank in matrix spaces via graph matchings

For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained…

We present a method for learning max-weight matching predictors in bipartite graphs. The method consists of performing maximum a posteriori estimation in exponential families with sufficient statistics that encode permutations and data…

This paper studies two topics concerning on the orthogonal complement of one dimensional subspace with respect to a given quadratic form on a vector space over a number field. One is to determine the invariants for the isomorphism class of…

We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…

Here we prove that counting maximum matchings in planar, bipartite graphs is #P-complete. This is somewhat surprising in the light that the number of perfect matchings in planar graphs can be computed in polynomial time. We also prove that…

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal…

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

In this paper, we consider optimal low-rank regularized inverse matrix approximations and their applications to inverse problems. We give an explicit solution to a generalized rank-constrained regularized inverse approximation problem,…

We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in \~O(|A| + r^\omega) field operations, where |A| denotes the…

A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching number is k are precisely those graphs with the maximum skew…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

Abstract Equivalent conditions that make the convex subdifferential maximal monotone are investigated in the general settings of locally convex spaces.

Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering…

This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…

For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…

In this paper we establish some basic properties of superderivations of Lie superalgebras. Under certain conditions, for solvable Lie superalgebras with given nilradicals, we give estimates for upper bounds to dimensions of complementary…

The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…