2017
DOI: 10.1215/ijm/1534924838
|View full text |Cite
|
Sign up to set email alerts
|

A note on the simultaneous Waring rank of monomials

Abstract: In this paper we study the complex simultaneous Waring rank for collections of monomials. For general collections we provide a lower bound, whereas for special collections we provide a formula for the simultaneous Waring rank. Our approach is algebraic and combinatorial. We give an application to ranks of binomials and maximal simultaneous ranks. Moreover, we include an appendix of scripts written in the algebra software Macaulay2 to experiment with simultaneous ranks.2000 Mathematics Subject Classification. 5… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Our approach to the problem is based on the study of simultaneous Waring decompositions of a collection of homogeneous polynomials. The problem of determining simultaneous ranks dates back to Terracini, see [Ter15]; some related problems were addressed more recently in [Fon02,AGMO18,CV18]. The simultaneous Waring rank of a collection of homogeneous polynomials is the minimum number of linear forms needed to simultaneously write a Waring decomposition for every polynomial in the collection.…”
Section: Introductionmentioning
confidence: 99%
“…Our approach to the problem is based on the study of simultaneous Waring decompositions of a collection of homogeneous polynomials. The problem of determining simultaneous ranks dates back to Terracini, see [Ter15]; some related problems were addressed more recently in [Fon02,AGMO18,CV18]. The simultaneous Waring rank of a collection of homogeneous polynomials is the minimum number of linear forms needed to simultaneously write a Waring decomposition for every polynomial in the collection.…”
Section: Introductionmentioning
confidence: 99%