Related papers: A proof of Hilbert's Nullstellensatz based on Groe…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
We discuss, using the Hilbert basis method, how to efficiently construct a complete basis for D-flat directions in supersymmetric Abelian and non-Abelian gauge theories. We extend the method to discrete (R and non-R) symmetries. This…
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…
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…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…
The geometric form of Hilbert's Nullstellensatz may be understood as a property of "geometric saturation" in algebraically closed fields. We conceptualise this property in the language of first order logic, following previous approaches and…
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
Let $f_i$ be polynomials in $n$ variables without a common zero. Hilbert's Nullstellensatz says that there are polynomials $g_i$ such that $\sum g_if_i=1$. The effective versions of this result bound the degrees of the $g_i$ in terms of the…
The results in the paper are related to the classification problem for invariant subspaces of multiplication operators in several variables. The main results consist of characterizations, in the two dimensional case, of ideals of…
In this thesis we consider the geometry of the Hilbert scheme of points in P^n, concentrating on the locus of points corresponding to the Gorenstein subschemes of P^n. New results are given, most importantly we provide tools for…
In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…
A Nullstellensatz is a theorem providing information on polynomials that vanish on a certain set: David Hilbert's Nullstellensatz (1893) is a cornerstone of algebraic geometry, and Noga Alon's Combinatorial Nullstellensatz (1999) is a…
Hilbert's Nullstellensatz is one of the most fundamental correspondences between algebra and geometry, and has inspired a plethora of noncommutative analogs. In last two decades, there has been an increased interest in understanding…
In this paper we prove a strong version of the Hilbert Nullstellensatz in the ring $\mathbb H[q_1,\ldots,q_n]$ of slice regular polynomials in several quaternionic variables. Our proof deeply depends on a detailed analysis of the common…