Mixed subdivisions suitable for the greedy Canny-Emiris formula - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Mixed subdivisions suitable for the greedy Canny-Emiris formula

Résumé

The Canny-Emiris formula gives the sparse resultant as a ratio between the determinant of a Sylvester-type matrix and a minor of it, by a subdivision algorithm. The most complete proof of the formula was given by D'Andrea et al. in [9] under general conditions on the underlying mixed subdivision. Before the proof, Canny and Pedersen had proposed a greedy algorithm which provides smaller matrices, in general. The goal of this paper is to give an explicit class of mixed subdivisions for the greedy approach such that the formula holds, and the dimensions of the matrices are reduced compared to the subdivision algorithm. We measure this reduction for the case when the Newton polytopes are zonotopes generated by n line segments (where n is the rank of the underlying lattice), and for the case of multihomogeneous systems. This article comes with a JULIA implementation of the treated cases.
Fichier principal
Vignette du fichier
ISSAC_2022_journal_ (3) (1).pdf (454.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03925899 , version 1 (13-01-2023)

Identifiants

Citer

Carles Checa, Ioannis Z. Emiris. Mixed subdivisions suitable for the greedy Canny-Emiris formula. ISSAC 2022 - International Symposium on Symbolic and Algebraic Computation, Universitté de Lille, Jul 2022, Villenueve d'Asq, France. pp.283-291, ⟨10.1145/3476446.3536180⟩. ⟨hal-03925899⟩
44 Consultations
48 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More