Search

Abstract: An algorithm is presented that computes explicit generators for the ring of differential operators on an orbifold, the quotient of a complex vector space by a finite group action. The algorithm also describes the relations among these generators. The algorithm presented in this paper is based on Schwarz’s study of a map carrying invariant operators to operators on the orbifold and on an algorithm to compute rings of invariants using Gröbner bases due to Derksen [Derksen, Harm, 1999. Computation of invariants for reductive groups. Adv. Math. 141 (2), 366–384]. It is also possible to avoid using Derksen’s algorithm, instead relying on the Reynolds operator and the Molien series. [Copyright &y& Elsevier]

Abstract: One approach for computations with special functions in computer algebra is the systematic use of analytic functions whenever possible. This naturally leads to problems of how to answer questions about analytic functions in a fully effective way. Such questions comprise the determination of the radius of convergence or the evaluation of the analytic continuation of the function at the endpoint of a broken line path. In this paper, we propose a first definition for the notion of an effective analytic function and we show how to effectively solve several types of differential equations in this context. We will limit ourselves to functions in one variable. [Copyright &y& Elsevier]

In this paper, we propose algorithms for the following problems in the implicitization of a set of differential rational parametric equations P. (1) To find a characteristic set for the implicit prime ideal of P. (2) To find a canonical representation for the image of P. (3) To decide whether the parameters of P are independent, and if not, to re-parameterize P so that the new parametric equations have independent parameters. (4) To compute the inversion maps of P, and as a consequence, to decide whether P is proper. If the implicit variety is of dimension one and P is not proper, to find a proper re-parameterization for P. [Copyright &y& Elsevier]