Related papers: The vanishing ideal of a finite set of points with…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
The vanishing ideal of a set of points $X\subseteq \mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\mathbf{x} \in X$ and admits an efficient representation by a finite set of polynomials called generators. To…
In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…
The second Veronese ideal $I_n$ contains a natural complete intersection $J_n$ generated by the principal $2$-minors of a symmetric $(n\times n)$-matrix. We determine subintersections of the primary decomposition of $J_n$ where one…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We compute the reverse lexicographic generic initial ideals of the powers of a 2-complete intersection ideal I. In particular, we give six algorithms to compute these generic initial ideals, the choice of which depends on the power and on…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
We present here an overview of the hypermatrix spectral decomposition deduced from the Bhattacharya-Mesner hypermatrix algebra. We describe necessary and sufficient conditions for the existence of a spectral decomposition. We further extend…
Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.
Given a finite set $\mathbf{X}$ of distinct points, Marinari-Mora's 'Axis of Evil Theorem' states that a combinatorial algorithm and interpolation enable to find a 'linear' factorization for a lexicographical minimal Groebner basis…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
Let $\K$ be a finite field and $X$ be a complete simplicial toric variety over $\K$. We give an algorithm relying on elimination theory for finding generators of the vanishing ideal of a subgroup $Y_Q$ parameterized by a matrix $Q$ which…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…