Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/modular-techniques-for-noncommutative-gr-bner-bases-0Z9q0ePMxv
References (40)
-
Heinz Kredel (1993)
Solvable polynomial rings -
Howard Cheng, G. Labahn (2007)
Output-sensitive modular algorithms for polynomial matrix normal formsJ. Symb. Comput., 42
-
G. Greuel, G. Pfister (2002)
A Singular Introduction to Commutative Algebra -
Abdelilah Kandri-Rody, V. Weispfenning (1990)
Non-Commutative Gröbner Bases in Algebras of Solvable TypeJ. Symb. Comput., 9
-
J. Bueso, J. Gómez-Torrecillas, A. Verschoren (2003)
Algorithmic Methods in Non-Commutative Algebra -
C. Sabbah (1987)
Proximité évanescente. I. La structure polaire d’un $\mathcal {D}$-moduleCompositio Mathematica, 62
-
M. Ceria (2017)
Buchberger-Zacharias Theory of multivariate Ore extensionsJournal of Pure and Applied Algebra, 221
-
Elizabeth Arnold (2003)
Modular algorithms for computing Gröbner basesJ. Symb. Comput., 35
-
M Noro (2002)
Mathematical Software (Beijing, 2002) -
J. Böhm, W. Decker, C. Fieker, G. Pfister (2012)
The use of bad primes in rational reconstructionMath. Comput., 84
-
Huishi Li (2002)
Noncommutative Gröbner Bases and Filtered-Graded Transfer -
V. Levandovskyy (2006)
PBW Bases , Non – Degeneracy Conditions and Applications -
F.LEON Pritchard (1996)
The Ideal Membership Problem in Non-Commutative Polynomial RingsJ. Symb. Comput., 22
-
(1988)
Gröbnerbasen in nichtkommutativen Algebren und ihre Anwendung -
(2015)
Plural. a singular 4-0-2 subsystem for computations with non-commutative polynomial algebras. http://www.singular.uni-kl.de -
G. Greuel, G. Pfister, H. Schönemann (2001)
SINGULAR: a computer algebra system for polynomial computationsACM Commun. Comput. Algebra, 42
-
G. Ebert (1983)
Some comments on the modular approach to Gröbner-basesSIGSAM Bull., 17
-
G. Krause, T. Lenagan (1985)
Growth of Algebras and Gelfand-Kirillov Dimension -
J. Bueso, J. Gómez-Torrecillas, F. Lobillo (2001)
RE-FILTERING AND EXACTNESS OF THE GELFAND-KIRILLOV DIMENSIONBulletin Des Sciences Mathematiques, 125
-
V Levandovskyy, C Koutschan, O Motsak (2011)
Proceedings of CASC ’2011, Volume 6885 of LNCS -
K. Yokoyama (2012)
Usage of Modular Techniques for Efficient Computation of Ideal OperationsMathematics in Computer Science, 12
-
Hans-Gert Gräbe, A. Nareike, S. Johanning (2014)
The SymbolicData Project -
V. Levandovskyy, H. Schönemann (2003)
Plural: a computer algebra system for noncommutative polynomial algebras -
N. Takayama (1989)
Gröbner basis and the problem of contiguous relationsJapan Journal of Applied Mathematics, 6
-
(1988)
Gr¨obnerbasen in nichtkommutativen Algebren und ihre Anwendung. (Gr¨obner bases in noncommutative algebras and their applications). Leipzig -
Daniel Andres, Michael Brickenstein, V. Levandovskyy, J. Martín-Morales, H. Schönemann (2010)
Constructive D-Module Theory with SingularMathematics in Computer Science, 4
-
Nazeran Idrees, G. Pfister, S. Steidel (2010)
Parallelization of Modular AlgorithmsJ. Symb. Comput., 46
-
J. Bueso, J. Gómez-Torrecillas, A. Verschoren (2003)
Algorithmic Methods in Non-Commutative Algebra: Applications to Quantum Groups -
V. Weispfenning (1992)
Finite Gröbner bases in non-Noetherian skew polynomial rings -
T. Mora (1994)
An Introduction to Commutative and Noncommutative Gröbner BasesTheor. Comput. Sci., 134
-
I. Bernshtein (1971)
Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficientsFunctional Analysis and Its Applications, 5
-
M. Ceria, T. Mora (2016)
Buchberger-Weispfenning theory for effective associative ringsJ. Symb. Comput., 83
-
V. Levandovskyy, C. Koutschan, O. Motsak (2011)
On Two-Generated Non-commutative Algebras Subject to the Affine Relation -
Hans-Jörg Reiffen (1967)
Das Lemma von Poincaré für holomorphe Differentialformen auf komplexen RäumenMathematische Zeitschrift, 101
-
V. Levandovskyy (2005)
Non-commutative Computer Algebra for polynomial algebras: Gröbner bases, applications and implementation -
Juan García, Jesús Miranda, F. Lobillo (2009)
Elimination orderings and localization in PBW algebrasLinear Algebra and its Applications, 430
-
M. Román, Socorro Román (2005)
Gröbner bases and syzygies on bimodules over PBW algebrasJ. Symb. Comput., 40
-
C Sabbah (1987)
Proximité évanescente I. La structure polaire d’un D-ModuleCompos. Math., 62
-
M. Noro (2002)
AN EFFICIENT MODULAR ALGORITHM FOR COMPUTING THE GLOBAL B-FUNCTION -
(1987)
Calculs effectifs pour les idéaux d’opérateurs différentiels
- Publisher
- Springer Journals
- Copyright
- Copyright © Springer Nature Switzerland AG 2019
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-019-00412-9
- Publisher site
- See Article on Publisher Site
Abstract
We extend modular techniques for computing Gröbner bases from the commutative setting to the vast class of noncommutative G-algebras. As in the commutative case, an effective verification test is only known to us in the graded case. In the general case, our algorithm is probabilistic in the sense that the resulting Gröbner basis can only be expected to generate the given ideal, with high probability. We have implemented our algorithm in the computer algebra system Singular and give timings to compare its performance with that of other instances of Buchberger’s algorithm, testing examples from D-module theory as well as classical benchmark examples. A particular feature of the modular algorithm is that it allows parallel runs.
Journal
Mathematics in Computer Science – Springer Journals
Published: Mar 21, 2020