Related papers: Equations for lower bounds on border rank
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…
We consider the problem of mutually unbiased bases as a polynomial optimization problem over the reals. We heavily reduce it using known symmetries before exploring it using two methods, combining a number of optimization techniques. The…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
In this paper we prove the generalized Kaplansky conjecture for the Jordan algebras of the type $J_n$ in particular for self adjoint $2\times 2$ matrices over $\R$, over $\C$, $\HH$ and $\Oct$. In fact, we prove that the image of…
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…
In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\times 2$ matrices, denoted $\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as…
We study the equipotential surfaces around of a two particle system in 3-d under a pairwise good potential as the one of Van der Waals. The level sets are completely determined by the solutions of polynomials of at most fourth degree that…
Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…
In this paper we present a class of maps for which the multiplicativity of the maximal output p-norm holds when p is 2 and p is larger than or equal to 4. The class includes all positive trace-preserving maps from the matrix algebra on the…
Let V be a vector space of dimension n over a field K and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. Let M be a subspace of Symm(V). We investigate a variety of hypotheses concerning the rank of elements in M…
For each irreducible finite dimensional representation of the Lie algebra $\mathfrak{sl}_2(\mathbb{C})$ of $2\times 2$ traceless matrices, an explicit uniform upper bound is given for the multiplicities in the cocharacter sequence of the…
We generalize methods to compute various kinds of rank to the case of a toric variety $X$ embedded into projective space using a very ample line bundle $\mathcal{L}$. We find an upper bound on the cactus rank. We use this to compute rank,…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
Let q be a power of a prime and let V be a vector space of finite dimension n over the field of order q. Let Bil(V) denote the set of all bilinear forms defined on V x V, let Symm(V) denote the subspace of Bil(V) consisting of symmetric…