English
Related papers

Related papers: A Poisson formula for the sparse resultant

200 papers

We present a new proof of a fundamental result concerning cycles of random permutations which gives some intuition for the connection between Touchard polynomials and the Poisson distribution. We also introduce a rather novel permutation…

Probability · Mathematics 2017-01-23 Ross G. Pinsky

We compute the spectrum of the "all ones" hypermatrix using the Poisson product formula. This computation includes a complete description of the eigenvalues' multiplicities, a seemingly elusive aspect of the spectral theory of tensors. We…

Spectral Theory · Mathematics 2013-01-22 Joshua Cooper , Aaron Dutle

We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…

Symbolic Computation · Computer Science 2015-04-27 Andrew Arnold , Daniel S. Roche

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…

Combinatorics · Mathematics 2021-08-31 Yan-Hong Bao , Yi-Zheng Fan , Yi Wang , Ming Zhu

We define a 1-parameter family of $r$-matrices on the loop algebra of $sl_{2}$, defining compatible Poisson structures on the associated loop group, which degenerate into the rational and trigonometric structures, and study the Manin…

q-alg · Mathematics 2009-10-28 B. Enriquez , V. N. Rubtsov

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

Computational Complexity · Computer Science 2014-05-19 Pascal Koiran , Natacha Portier , Sébastien Tavenas

We consider families of sparse Laurent polynomials f_1,...,f_n with a finite set of common zeroes Z_f in the complex algebraic n-torus. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over the…

Algebraic Geometry · Mathematics 2015-06-26 Ivan Soprunov

We derive a formula for the the modular class of a Lie algebroid with a regular twisted Poisson structure in terms of a canonical Lie algebroid representation of the image of the Poisson map. We use this formula to compute the modular…

Symplectic Geometry · Mathematics 2012-12-05 Yvette Kosmann-Schwarzbach , Milen Yakimov

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

Algebraic Geometry · Mathematics 2013-04-23 Alicia Dickenstein , Ioannis Emiris , Anna Karasoulou

We introduce a family of compatible Poisson brackets on the space of $2\times 2$ polynomial matrices, which contains the reflection equation algebra bracket. Then we use it to derive a multi-Hamiltonian structure for a set of integrable…

Exactly Solvable and Integrable Systems · Physics 2010-06-22 A. V. Tsiganov

Resultants are important special functions used in description of non-linear phenomena. Resultant $R_{r_1, ..., r_n}$ defines a condition of solvability for a system of $n$ homogeneous polynomials of degrees $r_1, ..., r_n$ in $n$…

Algebraic Geometry · Mathematics 2008-07-30 A. Morozov , Sh. Shakirov

Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…

Symbolic Computation · Computer Science 2014-06-26 Jean-Charles Faugere , Pierre-Jean Spaenlehauer , Jules Svartz

Summation formulae are classical tools in analysis: Taylor-MacLaurin, Euler-MacLaurin, Poisson, Vorono\"i, Circle formulae\ldots We will show how, from a single equation - referred to as the mother-equation - it is possible to unify these…

Complex Variables · Mathematics 2016-04-29 Feauveau Jean-Christophe

This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid…

Algebraic Geometry · Mathematics 2007-05-23 Amit Khetan

We prove a motivic version of the Poisson formula on the adelic points of a split algebraic torus and apply it to the study of the motivic height zeta function of split projective toric varieties, in the context of the motivic Manin-Peyre…

Algebraic Geometry · Mathematics 2026-04-06 Margaret Bilu , Loïs Faisant

We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…

Number Theory · Mathematics 2015-09-04 F. Amoroso , M. Sombra , U. Zannier

We give a general criterion for two toric varieties to appear as fibers in a flat family over the projective line. We apply this to show that certain birational transformations mapping a Laurent polynomial to another Laurent polynomial…

Algebraic Geometry · Mathematics 2012-07-31 Nathan Owen Ilten

A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…

Number Theory · Mathematics 2011-03-15 Ghaith Ayesh Hiary

We develop a "motivic integration" version of the Poisson summation formula for function fields, with values in the Grothendieck ring of definable exponential sums. We also study division algebras over the function field, and obtain…

Logic · Mathematics 2009-02-06 Ehud Hrushovski , David Kazhdan

We derive special forms of the Poisson summation formula for even and odd functions, which are applied to obtain representations for Euler-type numbers and to sum various series related to elliptic functions.

Mathematical Physics · Physics 2008-12-05 M. L. Glasser Nikos Bagis