- G. M. Bergman. The diamond lemma for ring theory. Adv. in Math., 29(2):179--218, 1978.Google ScholarCross Ref
- B. Buchberger. An Algorithm for Finding the Bases Elements of the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal (German). PhD thesis, Univ. of Innsbruck, 1965. English translation published in J. Symbolic Comput., 41(3-4):475--511, 2006. Google ScholarDigital Library
- B. Buchberger. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math., 4:374--383, 1970. English translation in B. Buchberger, F. Winkler (eds.), Gröbner Bases and Applications, Cambridge University Press, 1998.Google ScholarCross Ref
- B. Buchberger. Groebner rings and modules. In S. Maruster, B. Buchberger, V. Negru, and T. Jebelean, editors, Proceedings of SYNASC 2001, pages 22--25, 2001.Google Scholar
- B. Buchberger. Groebner bases in theorema using functors. In J. Faugere and D. Wang, editors, Proceedings of SCC'08, pages 1--15. LMIB Beihang University Press, 2008.Google Scholar
- B. Buchberger et al. Theorema: Towards computer-aided mathematical theory exploration. J. Appl. Log., 4(4):359--652, 2006.Google ScholarCross Ref
- H. Lausch and W. Nöbauer. Algebra of polynomials. North-Holland Publishing Co., Amsterdam, 1973. North-Holland Mathematical Library, Vol. 5.Google Scholar
- K. Madlener and B. Reinert. Non-commutative reduction rings. Rev. Colombiana Mat., 33(1):27--49, 1999.Google Scholar
- T. Mora. An introduction to commutative and noncommutative Gröbner bases. Theoret. Comput. Sci., 134(1):131--173, 1994. Google ScholarDigital Library
- G. Regensburger and M. Rosenkranz. An algebraic foundation for factoring linear boundary problems. Ann. Mat. Pura Appl. (4), 2008. DOI:10.1007/s10231-008-0068-3.Google Scholar
- M. Rosenkranz. A new symbolic method for solving linear two-point boundary value problems on the level of operators. J. Symbolic Comput., 39(2):171--199, 2005. Google ScholarDigital Library
- M. Rosenkranz and G. Regensburger. Integro-differential polynomials and operators. In D. Jeffrey, editor, Proceedings of ISSAC'08. ACM Press, 2008. Google ScholarDigital Library
- M. Rosenkranz and G. Regensburger. Solving and factoring boundary problems for linear ordinary differential equations in differential algebras. J. Symbolic Comput., 43(8):515--544, 2008. Google ScholarDigital Library
- S. Stifter. Gröbner bases of modules over reduction rings. J. Algebra, 159(1):54--63, 1993.Google ScholarCross Ref
- W. Windsteiger. Building up hierarchical mathematical domains using functors in THEOREMA. In A. Armando and T. Jebelean, editors, ENTCS, volume 23, pages 401--419. Elsevier, 1999.Google Scholar
- A. Zapletal. Compilation of Theorema Programs. PhD thesis, Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria, June 2008.Google Scholar
Index Terms
- General polynomial reduction with TH 9 OREM 8 functors: applications to integro-differential operators and polynomials
Recommendations
Discrete generalised polynomial functors
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part IIWe study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. The main theoretical contribution is the introduction of discrete generalised polynomial functors, a ...
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computingGiven an arbitrary but fixed integer r ≥ 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynomials ...
Data Types with Symmetries and Polynomial Functors over Groupoids
Polynomial functors (over Set or other locally cartesian closed categories) are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this ...
Comments