Results 61 to 70 of about 523 (177)
Groebner basis in Boolean rings is not polynomial-space
CoRR, 2015 We give an example where the number of elements of a Groebner basis in a Boolean ring is not polynomially bounded in terms of the bitsize and degrees of the input.
openaire +2 more sources
Small Groebner Fans of Ideals of Points [PDF]
, 2019 In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this property ...
Dimitrova, Elena +3 more
core +2 more sources
Geometric theorem proving using the Groebner basis algorithm [PDF]
, 2009 The purpose fo this project is to study ideals in polynomial rings and affine varieties in order to establish a connection between these two different concepts. Doing so will lead to an in depth examination of Groebner bases.
Rivas, Karla FrineĢ
core +1 more source
, 2014 We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u27s Lemma, closely following the proof in Cox, Little, and O\u27Shea\u27s Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic ...
Fitzpatrick, Amy Eva
core
Free integro-differential algebras and Groebner-Shirshov bases [PDF]
, 2014 The notion of commutative integro-differential algebra was introduced for the algebraic study of boundary problems for linear ordinary differential equations. Its noncommutative analog achieves a similar purpose for linear systems of such equations.
Guo, Li +5 more
core +1 more source
Computing huge Groebner basis like cyclic10 over $\Q$ with Giac. [PDF]
, 2019 We present a short description on how to fine-tune the modular algorithm implemented in the Giac computer algebra system to reconstruct huge Groebner basis over $\Q$.The classical cyclic10 benchmark will serve as ...
Parisse, Bernard
core +1 more source
Experiments with the Groebner Walk [PDF]
, 1996 The Groebner Walk is an algorithm which converts a given Groebner basis of a polynominal ideal I of arbitrary dimension to a Groebner basis of I with respect to another term order.
Kuechlin, W. +3 more
core
Groebner Basis Procedures for Testing Petri Nets
, 2000 This paper contains introductory material on Petri nets and Groebner basis theory and makes some observations on the relation between the two areas. The aim of the paper is to show how Groebner basis procedures can be applied to the problem of reachability in Petri nets, and to give details of an application to testing models of navigational systems.
Chandler, Angie, Heyworth, Anne
openaire +2 more sources