Related papers: On Border Basis and Groebner Basis Schemes

Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…

We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…

Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…

The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…

With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the…

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…

The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…

A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…

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…

For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…

Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p\in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…

This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…

In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches…

Border bases are traditionally restricted to 0-dimensional ideals due to the finiteness of the underlying order ideal. In this paper we extend the theory to homogeneous ideals of positive Krull dimension by introducing homogeneous border…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…