The solution to the Waring problem for monomials and the sum of coprime monomials
By Enrico Carlini, M. Catalisano, A. V. Geramita. 2012
145 citations recorded by the source corpus.
Subfields: Computational Mathematics, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/8e4beac9fc537a72ceb1edfbdda856a7eee10c9a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mathematics
- Yaroslav N. Shitov
- Alessandra Bernardi
- A. Oneto
- Alessandro Gimigliano
- Enrico Carlini
- M. Catalisano
- Jérôme Brachat
- Bernard Mourrain
In Computational Theory and Mathematics
- Yaroslav N. Shitov
- Alessandra Bernardi
- M. Catalisano
- A. Oneto
- Alessandro Gimigliano
- Bernard Mourrain
- Enrico Carlini
In Discrete Mathematics and Combinatorics
Citations in the corpus
- A comparison of different notions of ranks of symmetric tensors (2012, background): “It can be proved that this decomposition has a minimal size (see [13], [14]), so that we have”
- The Hitchhiker Guide to: Secant Varieties and Tensor Decomposition (2018, methodology): “7 was first presented in [166] in the special case of e = 1: this was the key point to prove Theorem 5.”
- How hard is the tensor rank (2016, result): “In comparison to many recent studies that approach the general and symmetric tensor decomposition problems from the point of view of algebraic geometry [3, 12, 32], our methods involve a more combinatorial background.”