Related papers: Groebner bases in Java with applications in comput…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
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.
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
We extend the group law of curves of degree three by chords and tangents to the Jacobi variety of plane curves of degree n>4 by replacing points by point groups and lines by algebraic curves. The curves are nonsingular or have simple…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…
In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…
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…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
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…
This paper gathers results obtained with a software written in Java. For exceptional minuscule, quasi-minuscule, cominuscule or adjoint homogeneous spaces, the Schubert cells are expressed as polynomials in the generators of the quantum…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
In this talk I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then…
These notes accompany the open-source code published in GitHub which implements a GPU-based line-segment, surface-triangle intersection algorithm in CUDA. It mentions some relevant works and discusses issues specific to this implementation.…
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…