Related papers: Computing Multidimensional Residues
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…
Multivariate residues appear in many different contexts in theoretical physics and algebraic geometry. In theoretical physics, they for example give the proper definition of generalized-unitarity cuts, and they play a central role in the…
The ring R of real-exponent polynomials in n variables over any field has global dimension n+1 and flat dimension n. In particular, the residue field k = R/m of R modulo its maximal graded ideal m has flat dimension n via a Koszul-like…
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…
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of A-hypergeometric systems of…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…
We introduce excess logarithmic residues for one-dimensional holomorphic foliations tangent to a divisor. They arise from the comparison between the logarithmic normal sheaf and the ordinary normal sheaf of the foliation, and measure the…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
This paper constitutes a first attempt to do analysis with skew polynomials. Precisely, our main objective is to develop a theory of residues for skew rational functions (which are, by definition, the quotients of two skew polynomials). We…
In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…
Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendieck local residues. The key is the notion of Noether…
Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
We prove a global residual formula in terms of logarithmic indices for one-dimensional holomorphic foliations, with isolated singularities, and logarithmic along normal crossing divisors. We also give a formula for the total sum of the…