oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
A Variant of the Gr?bner Basis Algorithm for Computing Hilbert Bases  [PDF]
Natalia Dück,Karl-Heinz Zimmermann
Mathematics , 2013,
Abstract: 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 given as a matrix kernel.
Signature-Based Gr?bner Basis Algorithms --- Extended MMM Algorithm for computing Gr?bner bases  [PDF]
Yao Sun
Computer Science , 2013,
Abstract: Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view, this paper aims to give an easier way to understand signature-based Gr\"obner basis algorithms.
The Termination of Algorithms for Computing Gr?bner Bases  [PDF]
Senshan Pan,Yupu Hu,BaoCang Wang
Mathematics , 2012,
Abstract: The F5 algorithm is generally believed as one of the fastest algorithms for computing Gr\"{o}bner bases. However, its termination problem is still unclear. Recently, an algorithm GVW and its variant GVWHS have been proposed, and their efficiency are comparable to the F5 algorithm. In the paper, we clarify the concept of an admissible module order. For the first time, the connection between the reducible and rewritable check is discussed here. We show that the top-reduced S-Gr\"{o}bner basis must be finite if the admissible monomial order and the admissible module order are compatible. This paper presents a complete proof of the termination and correctness of the GVWHS algorithm. What is more, it can be seen that the GVWHS is in fact an F5-like algorithm. Different from the GVWHS algorithm, the F5B algorithm may generate redundant sig-polynomials. Taking into account this situation, we prove the termination and correctness of the F5B algorithm. And we notice that the original F5 algorithm slightly differs from the F5B algorithm in the insertion strategy on which the F5-rewritten criterion is based. Exploring the potential ordering of sig-polynomials computed by the original F5 algorithm, we propose an F5GEN algorithm with a generalized insertion strategy, and prove the termination and correctness of it. Therefore, we have a positive answer to the long standing problem of proving the termination of the original F5 algorithm.
On the robust hardness of Gr?bner basis computation  [PDF]
Gwen Spencer,David Rolnick
Computer Science , 2015,
Abstract: We introduce a new problem in the approximate computation of Gr\"{o}bner bases that allows the algorithm to ignore a constant fraction of the generators - of the algorithm's choice - then compute a Gr\"{o}bner basis for the remaining polynomial system. The set ignored is subject to one quite-natural structural constraint. For lexicographic orders, when the discarded fraction is less than $(1/4-\epsilon)$, for $\epsilon>0$, we prove that this problem cannot be solved in polynomial time, even when the original polynomial system has maximum degree 3 and each polynomial contains at most 3 variables. Qualitatively, even for sparse systems composed of low-degree polynomials, we show that Gr\"{o}bner basis computation is robustly hard: even producing a Gr\"{o}bner basis for a large subset of the generators is NP-hard.
Gr?bner Basis in Algebras Extended by Loops
Chalom,G.; Marcos,E.; Oliveira,P.;
Revista de la Uni?3n Matem??tica Argentina , 2007,
Abstract: in this work we extend, to the path algebras context, some results obtained in the commutative context, [2]. the main result is that one can extend the gr?bner bases of an ungraded ideal to one possible definition of homogenization for the non commutative case.
Lifting algorithms for Gr bner basis computation of invariant ideals
不变理想的Gr bner基提升算法

WU Jie,CHEN Yu-Fu,
吴杰
,陈玉福

中国科学院研究生院学报 , 2009,
Abstract: A polynomial invariant under the action of a finite group can be rewritten into generators of the invariant ring by Gr bner basis method. The key question is how to find an efficient way to compute the Gr bner basis of the invariant ideal which is positive dimensional. We introduce a lifting algorithm for this computation process. If we use straight line program to analyze the complexity result, this process can be done within polynomial time.
On the Complexity of Computing Critical Points with Gr?bner Bases  [PDF]
Pierre-Jean Spaenlehauer
Computer Science , 2013,
Abstract: Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several applications in optimization and in real algebraic geometry. These points are solutions of a highly structured system of multivariate polynomial equations involving maximal minors of a Jacobian matrix. We investigate the complexity of solving this problem by using Gr\"obner basis algorithms under genericity assumptions on the coefficients of the input polynomials. The main results refine known complexity bounds (which depend on the maximum $D=\max(deg(f_1),\ldots,deg(f_p),deg(q))$) to bounds which depend on the list of degrees $(deg(f_1),\ldots,deg(f_p),deg(q))$: we prove that the Gr\"obner basis computation can be performed in $\delta^{O(\log(A)/\log(G))}$ arithmetic operations in $\mathbb Q$, where $\delta$ is the algebraic degree of the ideal vanishing on the critical points, and $A$ and $G$ are the arithmetic and geometric average of a multiset constructed from the sequence of degrees. As a by-product, we prove that solving such generic optimization problems with Gr\"obner bases requires at most $D^{O(n)}$ arithmetic operations in $\mathbb Q$, which meets the best known complexity bound for this problem. Finally, we illustrate these complexity results with experiments, giving evidence that these bounds are relevant for applications.
Fast Gr?bner Basis Computation for Boolean Polynomials  [PDF]
Franziska Hinkelmann,Elizabeth Arnold
Mathematics , 2010,
Abstract: We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
Gr?bner Basis Convex Polytopes and Planar Graph  [PDF]
Dang Vu Giang
Mathematics , 2012,
Abstract: Using the Gr\"obner basis of an ideal generated by a family of polynomials we prove that every planar graph is 4-colorable. Here we also use the fact that the complete graph of 5 vertices is not included in any planar graph.
Predicting zero reductions in Gr?bner basis computations  [PDF]
Christian Eder
Mathematics , 2014,
Abstract: Since Buchberger's initial algorithm for computing Gr\"obner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria may be known the most, especially in the installaton of Gebauer and M\"oller. A relatively new approach are signature-based criteria which were first used in Faug\`ere's F5 algorithm in 2002. For regular input sequences these criteria are known to compute no zero reduction at all. In this paper we give a detailed discussion on zero reductions and the corresponding syzygies. We explain how the different methods to predict them compare to each other and show advantages and drawbacks in theory and practice. With this a new insight into algebraic structures underlying Gr\"obner bases and their computations might be achieved.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.