2000 character limit reached
    
  A note on the simultaneous Waring rank of monomials (1711.00089v2)
    Published 31 Oct 2017 in math.AG, math.AC, and math.CO
  
  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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.