Add to ORKGWe determine the 166104 extremal monomials of the discriminant of a quaternary cubic form. These are in bijection with D-equivalence classes of regular triangulations of the 3-dilated tetrahedron. We describe how to compute these triangulations and their D-equivalence classes in order to arrive at our main result. The computation poses several challenges, such as dealing with the sheer number of triangulations effectively, as well as devising a suitably fast algorithm for computation of a D-equivalence class
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
One can associate to any bivariate polynomial P (X,Y) its Newton polygon. This is the convex hull of...
The classical Newton polygon is a device for computing the fractional power series expansions of alg...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
We compute and study two determinantal representations of the discriminant of a cubic quaternary for...
We present a new software for computing Newton polytopes of resultant and discriminant polynomials...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
In this note we calculate the number of crepant valuations of an isolated canonical singularity 0 ∈ ...
International audienceWe consider a conjecture on lattice polytopes Q ⊂ R^d (the vertices are intege...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
The Newton polytope of the resultant, or resultant polytope, characterizes the resultant polynomial ...
Let d \u3e 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift int...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their ...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
One can associate to any bivariate polynomial P (X,Y) its Newton polygon. This is the convex hull of...
The classical Newton polygon is a device for computing the fractional power series expansions of alg...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
We compute and study two determinantal representations of the discriminant of a cubic quaternary for...
We present a new software for computing Newton polytopes of resultant and discriminant polynomials...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
In this note we calculate the number of crepant valuations of an isolated canonical singularity 0 ∈ ...
International audienceWe consider a conjecture on lattice polytopes Q ⊂ R^d (the vertices are intege...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
The Newton polytope of the resultant, or resultant polytope, characterizes the resultant polynomial ...
Let d \u3e 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift int...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their ...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
One can associate to any bivariate polynomial P (X,Y) its Newton polygon. This is the convex hull of...
The classical Newton polygon is a device for computing the fractional power series expansions of alg...