Carlos D'Andrea
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carlos D'Andrea has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Martín Sombra
Universitat de Barcelona
13 shared publications - Teresa Krick
Facultad de Ciencias Exactas y Naturales and IMAS CONICET Universidad de Buenos Aires Argentina
11 shared publications - Agnes Szanto
Department of Mathematics North Carolina State University Campus Box 8205 27695 Raleigh North Carolina USA
10 shared publications - Teresa Cortadellas Benitez
Univ Barcelona, Fac Educ, Passeig Vall dHebron 171, Barcelona 08035, Spain
9 shared publications - Gabriela Jeronimo
Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
5 shared publications - Laurent Busé
Université Côte d'Azur, Inria, Sophia Antipolis, France
5 shared publications
Latest Publications
- 11 August 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (5) , 987-990
Special issue on Gröbner free methods and their applications
- 11 August 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (5) , 987-990
Special issue on Gröbner free methods and their applications
- Open Access
Toric Euler-Jacobi vanishing theorem and zeros at infinity
Residues appear naturally in various questions in complex and algebraic geometry: interpolation, duality, representation problems, and obstructions. The first global vanishing result in the projective plane, known as the Euler-Jacobi theorem, was established by Jacobi in 1835. In the toric case, the input is a system of n Laurent sparse polynomials with fixed Newton polytopes, and the first version of the Euler-Jacobi toric vanishing theorem for residues in the n-torus is due to Khovanskii in 1978, under restrictive genericity assumptions. In this paper, we provide geometric conditions on the input Newton polytopes to ensure that this global vanishing is equivalent to the existence of zeros at infinity in the associated compact toric variety. We relate these conditions to the dimension at the toric critical degree of the quotient of the Cox ring by the ideal generated by the (multi)homogenizations of the input polynomials. We also relate the existence of zeros at infinity to interpolation questions.
Open AccessToric Euler-Jacobi vanishing theorem and zeros at infinity
Residues appear naturally in various questions in complex and algebraic geometry: interpolation, duality, representation problems, and obstructions. The first global vanishing result in the projective plane, known as the Euler-Jacobi theorem, was established by Jacobi in 1835. In the toric case, the input is a system of n Laurent sparse polynomials with fixed Newton polytopes, and the first version of the Euler-Jacobi toric vanishing theorem for residues in the n-torus is due to Khovanskii in 1978, under restrictive genericity assumptions. In this paper, we provide geometric conditions on the input Newton polytopes to ensure that this global vanishing is equivalent to the existence of zeros at infinity in the associated compact toric variety. We relate these conditions to the dimension at the toric critical degree of the quotient of the Cox ring by the ideal generated by the (multi)homogenizations of the input polynomials. We also relate the existence of zeros at infinity to interpolation questions.
- Open Access
On the effective Pourchet's Theorem
With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of five squares of rational polynomials -the effective Pourchet's Theorem- and extend it to cover almost all the possible inputs. We also provide examples which are covered with our methods but cannot be detected by previous conjectural algorithms.
Open AccessOn the effective Pourchet's Theorem
With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of five squares of rational polynomials -the effective Pourchet's Theorem- and extend it to cover almost all the possible inputs. We also provide examples which are covered with our methods but cannot be detected by previous conjectural algorithms.
- 29 November 2024
- Published by Wiley in Mathematische Nachrichten
- Vol. 298 (2) , 567-580
Entropy numbers and box dimension of polynomials and holomorphic functions
We study entropy numbers and box dimension of (the image of) homogeneous polynomials and holomorphic functions between Banach spaces. First, we see that entropy numbers and box dimensions of subsets of Banach spaces are related. We show that the box dimension of the image of a ball under a homogeneous polynomial is finite if and only if it spans a finite‐dimensional subspace, but this is not true for holomorphic functions. Furthermore, we relate the entropy numbers of a holomorphic function to those of the polynomials of its Taylor series expansion. As a consequence, if the box dimension of the image of a ball by a holomorphic function is finite, then the entropy numbers of the polynomials in the Taylor series expansion of at any point of the ball belong to for every .
- 29 November 2024
- Published by Wiley in Mathematische Nachrichten
- Vol. 298 (2) , 567-580
Entropy numbers and box dimension of polynomials and holomorphic functions
We study entropy numbers and box dimension of (the image of) homogeneous polynomials and holomorphic functions between Banach spaces. First, we see that entropy numbers and box dimensions of subsets of Banach spaces are related. We show that the box dimension of the image of a ball under a homogeneous polynomial is finite if and only if it spans a finite‐dimensional subspace, but this is not true for holomorphic functions. Furthermore, we relate the entropy numbers of a holomorphic function to those of the polynomials of its Taylor series expansion. As a consequence, if the box dimension of the image of a ball by a holomorphic function is finite, then the entropy numbers of the polynomials in the Taylor series expansion of at any point of the ball belong to for every .
- Open Access
Entropy numbers and box dimension of polynomials and holomorphic functions
We study entropy numbers and box dimension of (the image of) homogeneous polynomials and holomorphic functions between Banach spaces. First, we see that entropy numbers and box dimensions of subsets of Banach spaces are related. We show that the box dimension of the image of a ball under a homogeneous polynomial is finite if and only if it spans a finite-dimensional subspace, but this is not true for holomorphic functions. Furthermore, we relate the entropy numbers of a holomorphic function to those of the polynomials of its Taylor series expansion. As a consequence, if the box dimension of the image of a ball by a holomorphic function $f$ is finite, then the entropy numbers of the polynomials in the Taylor series expansion of $f$ at any point of the ball belong to $\ell_p$ for every $p>1$.Open AccessEntropy numbers and box dimension of polynomials and holomorphic functions
We study entropy numbers and box dimension of (the image of) homogeneous polynomials and holomorphic functions between Banach spaces. First, we see that entropy numbers and box dimensions of subsets of Banach spaces are related. We show that the box dimension of the image of a ball under a homogeneous polynomial is finite if and only if it spans a finite-dimensional subspace, but this is not true for holomorphic functions. Furthermore, we relate the entropy numbers of a holomorphic function to those of the polynomials of its Taylor series expansion. As a consequence, if the box dimension of the image of a ball by a holomorphic function $f$ is finite, then the entropy numbers of the polynomials in the Taylor series expansion of $f$ at any point of the ball belong to $\ell_p$ for every $p>1$. - 9 August 2023
- Published by Elsevier in Journal of Algebra
- Vol. 635, 838-839
Corrigendum to “Multivariate subresultants in roots” [J. Algebra Appl. 302(1) (2006) 16–36]
- 9 August 2023
- Published by Elsevier in Journal of Algebra
- Vol. 635, 838-839
Corrigendum to “Multivariate subresultants in roots” [J. Algebra Appl. 302(1) (2006) 16–36]
- 7 April 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (343) , 2355-2379
Subresultants and the Shape Lemma
In nice cases, a zero-dimensional complete intersection ideal over a field has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.
- 7 April 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (343) , 2355-2379
Subresultants and the Shape Lemma
In nice cases, a zero-dimensional complete intersection ideal over a field has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.
- Open Access
Subresultants and the Shape Lemma
In nice cases, a zero-dimensional complete intersection ideal over a field of characteristic zero has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.
Open AccessSubresultants and the Shape Lemma
In nice cases, a zero-dimensional complete intersection ideal over a field of characteristic zero has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.
- Open Access
The Canny-Emiris conjecture for the sparse resultant
We present a product formula for the initial parts of the sparse resultant associated to an arbitrary family of supports, generalising a previous result by Sturmfels. This allows to compute the homogeneities and degrees of the sparse resultant, and its evaluation at systems of Laurent polynomials with smaller supports. We obtain a similar product formula for some of the initial parts of the principal minors of the Sylvester-type square matrix associated to a mixed subdivision of a polytope. Applying these results, we prove that the sparse resultant can be computed as the quotient of the determinant of such a square matrix by a certain principal minor, under suitable hypothesis. This generalises the classical Macaulay formula for the homogeneous resultant, and confirms a conjecture of Canny and Emiris.
Open AccessThe Canny-Emiris conjecture for the sparse resultant
We present a product formula for the initial parts of the sparse resultant associated to an arbitrary family of supports, generalising a previous result by Sturmfels. This allows to compute the homogeneities and degrees of the sparse resultant, and its evaluation at systems of Laurent polynomials with smaller supports. We obtain a similar product formula for some of the initial parts of the principal minors of the Sylvester-type square matrix associated to a mixed subdivision of a polytope. Applying these results, we prove that the sparse resultant can be computed as the quotient of the determinant of such a square matrix by a certain principal minor, under suitable hypothesis. This generalises the classical Macaulay formula for the homogeneous resultant, and confirms a conjecture of Canny and Emiris.
- 23 December 2020
- Published by Union Matematica Argentina in Revista de la Unión Matemática Argentina
- Vol. 61 (2) , 413-429
Minimal solutions of the rational interpolation problem
- 23 December 2020
- Published by Union Matematica Argentina in Revista de la Unión Matemática Argentina
- Vol. 61 (2) , 413-429
Minimal solutions of the rational interpolation problem