2000 character limit reached
A Poisson formula for the sparse resultant
Published 24 Oct 2013 in math.AG, math.AC, and math.CO | (1310.6617v2)
Abstract: We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse resultant associated to a family of supports can be identified with the resultant of a suitable multiprojective toric cycle in the sense of Remond. This connection allows to study sparse resultants using multiprojective elimination theory and intersection theory of toric varieties.
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.