Related papers: On the Waring Rank of Binary Forms

A celebrated result by Hilbert says that every real nonnegative ternary quartic is a sum of three squares. We show more generally that every nonnegative quadratic form on a real projective variety $X$ of minimal degree is a sum of…

We show that binary forms of degree n less than seven parameterize rings, generalizing a result of Levi on binary cubic forms parameterizing cubic rings, which can be related to results of Bhargava. The question of whether or not a binary…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.

We improve the bound of the $g$-invariant of the ring of integers of a totally real number field, where the $g$-invariant $g(r)$ is the smallest number of squares of linear forms in $r$ variables that is required to represent all the…

A {\it sign pattern matrix} is a matrix whose entries are from the set $\{+,-, 0\}$. The minimum rank of a sign pattern matrix $A$ is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries…

In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…

This paper presents strong connections between four variants of the zero forcing number and four variants of the Grundy domination number. These connections bridge the domination problem and the minimum rank problem. We show that the Grundy…

We show that quantum Casimir W-algebras truncate at degenerate values of the central charge c to a smaller algebra if the rank is high enough: Choosing a suitable parametrization of the central charge in terms of the rank of the underlying…

In this work we give the classification of real ternary cubic forms with respect to rank and border rank up to SL(3)-action and we examine the differences with the complex case.

We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…

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…

We study modular forms of some congruence subgroups. In this paper, we treat the cases level is 2-power, 3-power or 5. Structures of graded rings and many identities of infinite sum or infinite product are given. Theory of rational (1/3,…

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…

Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using the zero forcing number, we prove that the minimum rank of…

A \emph{sign pattern (matrix)} is a matrix whose entries are from the set $\{+, -, 0\}$. The \emph{minimum rank} (respectively, \emph{rational minimum rank}) of a sign pattern matrix $\cal A$ is the minimum of the ranks of the real…

We show that for several notions of rank including tensor rank, Waring rank, and generalized rank with respect to a projective variety, the maximum value of rank is at most twice the generic rank. We show that over the real numbers, the…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…