[BOOK][B] Involution
WM Seiler - 2010 - Springer
1 3 Werner M.Seiler Page 1 1 3 algorithms and computation in mathematics 24 Involution
The Formal Theory of Differential Equations and its Applications in Computer Algebra Werner …
The Formal Theory of Differential Equations and its Applications in Computer Algebra Werner …
[BOOK][B] Formal algorithmic elimination for PDEs
D Robertz - 2014 - books.google.com
Investigating the correspondence between systems of partial differential equations and their
analytic solutions using a formal approach, this monograph presents algorithms to …
analytic solutions using a formal approach, this monograph presents algorithms to …
Involutive algorithms for computing Gröbner bases
VP Gerdt - arxiv preprint math/0501111, 2005 - arxiv.org
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of
polynomial ideals. The algorithm is based on the concept of involutive monomial division …
polynomial ideals. The algorithm is based on the concept of involutive monomial division …
A combinatorial approach to involution and δ-regularity I: involutive bases in polynomial algebras of solvable type
WM Seiler - Applicable Algebra in Engineering, Communication …, 2009 - Springer
Involutive bases are a special form of non-reduced Gröbner bases with additional
combinatorial properties. Their origin lies in the Janet–Riquier theory of linear systems of …
combinatorial properties. Their origin lies in the Janet–Riquier theory of linear systems of …
Homogenized skew PBW extensions
In this paper, we provide a new and more general filtration to the family of noncommutative
rings known as skew PBW extensions. We introduce the notion of σ-filtered skew PBW …
rings known as skew PBW extensions. We introduce the notion of σ-filtered skew PBW …
Janet bases and applications
D Robertz - Gröbner bases in symbolic analysis, 2007 - degruyter.com
This paper surveys a work in the area of Janet's algorithm and involutive bases at Lehrstuhl
B für Mathematik, RWTH Aachen. The emphasis is on the Maple and C++ implementations …
B für Mathematik, RWTH Aachen. The emphasis is on the Maple and C++ implementations …
[PDF][PDF] Formal computational methods for control theory
D Robertz - 2006 - core.ac.uk
This thesis treats structural properties of control systems, eg controllability or
parametrizability of their behavior, from an algebraic point of view. It is in the tradition of RE …
parametrizability of their behavior, from an algebraic point of view. It is in the tradition of RE …
[HTML][HTML] Degree bounds for Gröbner bases in algebras of solvable type
M Aschenbrenner, A Leykin - Journal of Pure and Applied Algebra, 2009 - Elsevier
We establish doubly-exponential degree bounds for Gröbner bases in certain algebras of
solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of …
solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of …
[PDF][PDF] A combinatorial approach to involution and delta-regularity I: Involutive bases in polynomial algebras of solvable type
WM Seiler - arxiv preprint math/0208247, 2002 - arxiv.org
arxiv:math/0208247v2 [math.AC] 29 Aug 2007 Page 1 arxiv:math/0208247v2 [math.AC] 29
Aug 2007 AAECC manuscript No. (will be inserted by the editor) A Combinatorial Approach …
Aug 2007 AAECC manuscript No. (will be inserted by the editor) A Combinatorial Approach …
[PDF][PDF] Algorithms for the computation of Sato's b-functions in algebraic D-module theory
D Andres - 2010 - math.rwth-aachen.de
In the early 1970s, M. Sato introduced a-, b-and c-functions associated to prehomogeneous
vector spaces [SS72]. Simultaneously and independently, J. Bernstein defined b-functions …
vector spaces [SS72]. Simultaneously and independently, J. Bernstein defined b-functions …