A factorization algorithm for G-algebras and its applications
DOI10.1016/J.JSC.2017.06.005zbMATH Open1387.13060OpenAlexW4207022083MaRDI QIDQ2409016FDOQ2409016
Authors: V. Levandovskyy, Albert Heinle 
Publication date: 10 October 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2017.06.005
Recommendations
- A factorization algorithm for \(G\)-algebras and applications
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- Polynomial algorithms in computer algebra
- Modular techniques for noncommutative Gröbner bases
- Factoring linear partial differential operators in \(n\) variables
factorizationnoncommutative algebra\(G\)-algebraalgebra of solvable typefactorized Groebner basisfactorizing Groebner basisnoncommutative factorizationnoncommutative Groebner basisPBW algebraGröbner basis
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05)
Cites Work
- CALI
- Primitive ideals in enveloping algebras
- Involution. The formal theory of differential equations and its applications in computer algebra
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Title not available (Why is that?)
- Non-commutative Gröbner bases in algebras of solvable type
- On decomposing systems of polynomial equations with finitely many solutions
- Localization in general rings, a historical survey.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree bounds for Gröbner bases in algebras of solvable type
- Solving zero-dimensional algebraic systems
- Title not available (Why is that?)
- Noncommutative Gröbner bases and filtered-graded transfer.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- Solving algebraic equations via Buchberger's algorithm
- Unique Factorization Domains
- Re-filtering and exactness of the Gelfand-Kirillov dimension
- Weyl closure of a linear differential operator
- On noncommutative finite factorization domains
- Contraction of Ore ideals with applications
- Factoring linear partial differential operators in \(n\) variables
- Factoring linear differential operators in \(n\) variables
- Title not available (Why is that?)
- Factorization of \( \mathbb {Z}\)-homogeneous polynomials in the first \(q\)-Weyl algebra
Cited In (8)
- Factoring linear differential operators in \(n\) variables
- Constructive arithmetics in Ore localizations of domains
- On the factorization of non-commutative polynomials (in free associative algebras)
- Factorization of \( \mathbb {Z}\)-homogeneous polynomials in the first \(q\)-Weyl algebra
- On noncommutative finite factorization domains
- A factorization algorithm for \(G\)-algebras and applications
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- A Factorization inGSp(V)
Uses Software
This page was built for publication: A factorization algorithm for \(G\)-algebras and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409016)
