Related papers: Solving bihomogeneous polynomial systems with a ze…

Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…

We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal…

Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…

In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

In this paper, we describe efficient MapReduce simulations of parallel algorithms specified in the BSP and PRAM models. We also provide some applications of these simulation results to problems in parallel computational geometry for the…

For positive integers m >= n >= p, we compute the GL_m x GL_n-equivariant description of the local cohomology modules of the polynomial ring S of functions on the space of m x n matrices, with support in the ideal of p x p minors. Our…

The aim of this article is to introduce standard bases of ideals in polynomial rings with respect to a class of orderings which are not necessarily semigroup orderings. Our approach generalises the concept of standard bases with respect to…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Projection methods aim to reduce the dimensionality of the optimization instance, thereby improving the scalability of high-dimensional problems. Recently, Sakaue and Oki proposed a data-driven approach for linear programs (LPs), where the…

The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…

Stillman posed a question as to whether the projective dimension of a homogeneous ideal I in a polynomial ring over a field can be bounded by some formula depending only on the number and degrees of the minimal generators of I. More…

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of…

Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…

The notion of initial ideal for an ideal of a polynomial ring appears in the theory of Gr\"obner basis. Similarly to the initial ideals, we can define the initial algebra for a subalgebra of a polynomial ring, or more generally of a Laurent…

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…

In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…