Related papers: Computing Multidimensional Residues
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…
We give rational expressions for the subresultants of n+1 generic polynomials f_1,..., f_{n+1} in n variables as a function of the coordinates of the common roots of f_1,..., f_n and their evaluation in f_{n+1}. We present a simple…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…
When using a Groebner basis to solve the highly symmetric system of algebraic equations defining the cyclic p-roots, one has the feeling that much of the advantage of computerized symbolic algebra over hand calculation is lost through the…
In this article we analyze the global diffeomorphism property of polynomial maps $F:\mathbb{R}^n\rightarrow\mathbb{R}^n$ by studying the properties of the Newton polytopes at infinity corresponding to the sum of squares polynomials…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
The linear orbit of a degree d hypersurface in $\mathbb{P}^n$ is its orbit under the natural action of PGL(n+1), in the projective space of dimension $N =\binom{n+d}{d} - 1$ parameterizing such hypersurfaces. This action restricted to a…