English
Related papers

Related papers: A Poisson formula for the sparse resultant

200 papers

Subresultant of two univariate polynomials is a fundamental object in computational algebra and geometry with many applications (for instance, parametric GCD and parametric multiplicity of roots). In this paper, we generalize the theory of…

Symbolic Computation · Computer Science 2023-04-28 Hoon Hong , Jing Yang

This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions…

Optimization and Control · Mathematics 2026-04-02 Suhan Zhong , Jinling Zhou , Jiawang Nie , Xindong Tang

We introduce a family of polynomials in $q^2$ and four variables associated with the quantized algebra of functions $A_q(C_2)$. A new formula is presented for the recent solution of the 3D reflection equation in terms of these polynomials…

Mathematical Physics · Physics 2019-02-27 Atsuo Kuniba , Shouya Maruyama

We study spanning properties of a family of functions translated along simple model sets. We characterize tight frame and dual frame generators for such irregular translates and we apply the results to Gabor systems. We use the connection…

Functional Analysis · Mathematics 2019-02-21 Ewa Matusiak

A family of Poisson structures, parametrised by an arbitrary odd periodic function $\phi$, is defined on the space $\cW$ of twisted polygons in $\RR^\nu$. Poisson reductions with respect to two Poisson group actions on $\cW$ are described.…

Mathematical Physics · Physics 2010-07-13 Ian Marshall

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

Commutative Algebra · Mathematics 2021-05-28 Matías R. Bender , Jean-Charles Faugère , Angelos Mantzaflaris , Elias Tsigaridas

Resultants are getting increasingly important in modern theoretical physics: they appear whenever one deals with non-linear (polynomial) equations, with non-quadratic forms or with non-Gaussian integrals. Being a subject of more than…

Mathematical Physics · Physics 2015-05-14 A. Morozov , Sh. Shakirov

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

The binomial, the negative binomial, the Poisson, the compound Poisson and the Erlang distribution do all admit integral representations with respect to its (continuous) parameter. We use the Margulis-Russo type formulas for Bernoulli and…

Probability · Mathematics 2026-02-05 Guenter Last , Sergei Zuyev

We introduce a family of compatible Poisson brackets on the space of rational functions with denominator of a fixed degree and use it to derive a multi-Hamiltonian structure for a family of integrable lattice equations that includes both…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 L. Faybusovich , M. Gekhtman

Let $\cP$ be a system of $n$ linear nonhomogeneous ordinary differential polynomials in a set $U$ of $n-1$ differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in $U$ from…

Classical Analysis and ODEs · Mathematics 2013-06-04 Sonia L. Rueda

We prove that the diffraction formula for regular model sets is equivalent to the Poisson Summation Formula for the underlying lattice. This is achieved using Fourier analysis of unbounded measures on locally compact abelian groups as…

Mathematical Physics · Physics 2020-04-02 Christoph Richard , Nicolae Strungaru

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…

Mathematical Software · Computer Science 2014-03-06 Ioannis Z. Emiris

We take the trace of Von-Neumann's ergodic theorem and get a trace formula of a unitary matrix family. It is an extension of Poisson summation formula in higher dimension. We also construct a family of crystalline measure with complex…

Mathematical Physics · Physics 2025-05-22 Tianhong Zhao

We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik--Zamolodchikov equations, which arise by considering representations of the…

Mathematical Physics · Physics 2015-09-30 Luigi Cantini , Jan de Gier , Michael Wheeler

In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…

Symbolic Computation · Computer Science 2024-09-11 Weidong Wang , Jing Yang

A new approach to Poisson approximation is proposed. The basic idea is very simple and based on properties of the Charlier polynomials and the Parseval identity. Such an approach quickly leads to new effective bounds for several Poisson…

Probability · Mathematics 2010-07-29 Vytas Zacharovas , Hsien-Kuei Hwang

In this note, we consider the resultant of systems of homogeneous multivariate polynomials which are equivariant under the action of direct product of two symmetric groups. We establish a decomposition formula for the resultant of such…

Commutative Algebra · Mathematics 2025-09-01 Sonagnon Julien Owolabi , Ibrahim Nonkane , Joel Tossa

Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…

Complex Variables · Mathematics 2012-02-28 Tomasz Sobieszek

We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…

Symbolic Computation · Computer Science 2022-02-11 AmirHosein Sadeghimanesh , Matthew England