相关论文: The Waring rank of binary binomial forms

The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpretation of (w ab) and (w ba) when a and b are distinct letters.…

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

This survey provides a comprehensive overview of the study of the binary and Boolean rank from both a mathematical and a computational perspective, with particular emphasis on their relationship to the real rank. We review the basic…

We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the existence of four more systems of parameters with different sets…

We use covariants of binary sextics to describe the structure of modules of scalar-valued or vector-valued Siegel modular forms of degree 2 with character, over the ring of scalar-valued Siegel modular forms of even weight. For a modular…

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

We study three variations of the Waring problem for polynomials, concerning the Waring rank, the border rank and the cactus rank of a form and we show how the Lefschetz properties of the associated algebra affect them. The main tool is the…

We prove that if a degree-$d$ homogeneous polynomial $f$ has border Waring rank $\underline{\mathrm{WR}}({f}) = r$, then its Waring rank is bounded by \[ {\mathrm{WR}}({f}) \leq d \cdot r^{O(\sqrt{r})}. \] This result significantly improves…

We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…

The Witt ring of symmetric bilinear forms over a field has divided power operations. On the other hand, it follows from Garibaldi-Merkurjev-Serre's work on cohomological invariants that all operations on the Witt ring are essentially linear…

We describe a formal correctness proof of RANKING, an online algorithm for online bipartite matching. An outcome of our formalisation is that it shows that there is a gap in all combinatorial proofs of the algorithm. Filling that gap…

We state the relation between the variety of binary forms of given rank and the dual of the multiple root loci. This is a new result for the suprageneric rank, as a continuation of the work by Buczy\'nski, Han, Mella and Teitler. We…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We extend our previous results on the number of integers which are values of some cyclotomic form of degree larger than a given value (see \cite{FW1}), to more general families of binary forms with integer coefficients. Our main ingredient…

We show that the algebraic boundaries of the regions of real binary forms with fixed typical rank are always unions of dual varieties to suitable coincident root loci.

Extending the approach of Iwaniec and Duke, we present strong uniform bounds for Fourier coefficients of half-integral weight cusp forms of level $N$. As an application, we consider a Waring-type problem with sums of mixed powers.

We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…

We give a short proof for a well-known formula for the rank of a $G$-crossed braided extension of a modular tensor category.

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

We prove the existence of ternary forms admitting apolar sets of points of cardinality equal to the Waring rank, but having different Hilbert function and different regularity. This is done exploiting liaison theory and Cayley-Bacharach…