Related papers: Generic forms of low Chow rank

The Chow rank of a form is the length of its smallest decomposition into a sum of products of linear forms. For a generic form, this corresponds to finding the smallest secant variety of the Chow variety which fills the ambient space. We…

A variation of Waring's problem from classical number theory is the question, ``What is the smallest number $s$ such that any generic homogeneous polynomial of degree $d$ in $n+1$ variables may be written as the sum of at most $s$ products…

Given a closed subvariety X in a projective space, the rank with respect to X of a point p in this projective space is the least integer r such that p lies in the linear span of some r points of X. Let W_k be the closure of the set of…

We try to write (generic) elements of classical simple Lie algebras as sums of as few elements of the orbit C of long root vectors as possible. If the Lie algebra in question is sl_n or sp_n, then C consists of all rank 1 matrices in the…

We describe the equivariant Chow ring of the wonderful compactification $X$ of a symmetric space of minimal rank, via restriction to the associated toric variety $Y$. Also, we show that the restrictions to $Y$ of the tangent bundle $T_X$…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

In this paper, the generic intersection theory for difference varieties is presented. Precisely, the intersection of an irreducible difference variety of dimension $d > 0$ and order $h$ with a generic difference hypersurface of order $s$ is…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

We define a global rank for partial types based in a generalization of Shelah trees. We prove an equivalence with the depth of a localized version of the constructions known as dividing sequence and dividing chain. This rank characterizes…

We define the Chow ring of the classifying space of a linear algebraic group. In all the examples where we can compute it, such as the symmetric groups and the orthogonal groups, it is isomorphic to a natural quotient of the complex…

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

In this article, we consider the rank of universal $m$-gonal forms for all sufficiently large $m$. Especially, we determine the minimal rank of universal $m$-gonal form and the maximal rank of kinds of proper universal $m$-gonal form.

The Chow variety of polynomials that decompose as a product of linear forms has been studied for more than 100 years. Finding equations in the ideal of secant varieties of Chow varieties would enable one to measure the complexity the…

We prove that the smallest degree of an apolar 0-dimensional scheme of a general cubic form in $n+1$ variables is at most $2n+2$, when $n\geq 8$, and therefore smaller than the rank of the form. For the general reducible cubic form the…

For real and complex homogeneous cubic polyomials in $n+1$ variables, we prove that the Chow variety of products of linear forms is generically complex identifiable for all ranks up to the generic rank minus two. By integrating fundamental…

Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…

The rank problem in succinct data structures asks to preprocess an array A[1..n] of bits into a data structure using as close to n bits as possible, and answer queries of the form rank(k) = Sum_{i=1}^k A[i]. The problem has been intensely…

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…

We give a lower bound for the Waring rank and cactus rank of forms that are invariant under an action of a connected algebraic group. We use this to improve the Ranestad--Schreyer--Shafiei lower bounds for the Waring ranks and cactus ranks…