Related papers: Groebner bases over fields with valuations
In this paper, we give a sufficient condition for a set $\mathal G$ of polynomials to be a Gr\"obner basis with respect to a given term-order for the ideal $I$ that it generates. Our criterion depends on the linkage pattern of the ideal $I$…
The paper has two goals: the study the associated graded ring of contracted homogeneous ideals in $K[x,y]$ and the study of the Groebner fan of the ideal $P$ of the rational normal curve in ${\bf P}^d$. These two problems are, quite…
The main results of this paper establish a partial correspondence between two previously-studied analogues of Groebner bases in the setting of algebras: namely, subalgebra (aka SAGBI) bases for quotients of polynomial rings and Khovanskii…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
We give an introduction to the theory of initial ideals and initial algebras with emphasis on the transfer of structural properties.
Nakajima's graded quiver varieties naturally appear in the study of bases of cluster algebras. One particular family of these varieties, namely the bipartite determinantal varieties, can be defined for any bipartite quiver and gives a vast…
The maximal minors of a p by (m + p) matrix of univariate polynomials of degree n with indeterminate coefficients are themselves polynomials of degree np. The subalgebra generated by their coefficients is the coordinate ring of the quantum…
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…
In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases,…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…
Let $K$ be a field, $\mathcal {O}_v$ a valuation ring of $K$ associated to a valuation $v$: $K\rightarrow\Gamma\cup\{\infty\}$, and ${\bf m}_v$ the unique maximal ideal of $\mathcal {O}_v$. Consider an ideal $\mathcal {I}$ of the free…
In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algebraic geometry and adiabatic quantum computing (AQC), and…
Macaulay's theorem and Fr\"oberg's conjecture deal with the Hilbert function of homogeneous ideals in polynomial rings $S$ over a field $K$. In this short note we present some questions related to variants of Macaulay's theorem and…