35 research outputs found
Effective Scalar Products for D-finite Symmetric Functions
Many combinatorial generating functions can be expressed as combinations of
symmetric functions, or extracted as sub-series and specializations from such
combinations. Gessel has outlined a large class of symmetric functions for
which the resulting generating functions are D-finite. We extend Gessel's work
by providing algorithms that compute differential equations these generating
functions satisfy in the case they are given as a scalar product of symmetric
functions in Gessel's class. Examples of applications to k-regular graphs and
Young tableaux with repeated entries are given. Asymptotic estimates are a
natural application of our method, which we illustrate on the same model of
Young tableaux. We also derive a seemingly new formula for the Kronecker
product of the sum of Schur functions with itself.Comment: 51 pages, full paper version of FPSAC 02 extended abstract; v2:
corrections from original submission, improved clarity; now formatted for
journal + bibliograph
Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms
International audienceWe consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. The framework presented in Telen et al. (2018) uses truncated normal forms (TNFs) to compute the algebra structure of R/I and the solutions of I. This framework allows for the use of much more general bases than the standard monomials for R/I. This is exploited in this paper to introduce the use of two special (nonmonomial) types of basis functions with nice properties. This allows, for instance, to adapt the basis functions to the expected location of the roots of I. We also propose algorithms for efficient computation of TNFs and a generalization of the construction of TNFs in the case of non-generic zero-dimensional systems. The potential of the TNF method and usefulness of the new results are exposed by many experiments
The Dynamic Dictionary of Mathematical Functions (DDMF)
International audienceWe describe the main features of the Dynamic Dictionary of Mathematical Functions (version 1.5). It is a website consisting of interactive tables of mathematical formulas on elementary and special functions. The formulas are automatically generated by computer algebra routines. The user can ask for more terms of the expansions, more digits of the numerical values, or proofs of some of the formulas
Sparsity optimized high order finite element functions for H(curl) on tetrahedra
AbstractH(curl) conforming finite element discretizations are a powerful tool for the numerical solution of the system of Maxwellʼs equations in electrodynamics. In this paper we construct a basis for conforming high-order finite element discretizations of the function space H(curl) in 3 dimensions. We introduce a set of hierarchic basis functions on tetrahedra with the property that both the L2-inner product and the H(curl)-inner product are sparse with respect to the polynomial degree. The construction relies on a tensor-product based structure with properly weighted Jacobi polynomials as well as an explicit splitting of the basis functions into gradient and non-gradient functions. The basis functions yield a sparse system matrix with O(1) nonzero entries per row.The proof of the sparsity result on general tetrahedra defined in terms of their barycentric coordinates is carried out by an algorithm that we implemented in Mathematica. A rewriting procedure is used to explicitly evaluate the inner products. The precomputed matrix entries in this general form for the cell-based basis functions are available online
Generating all polynomial invariants in simple loops
AbstractThis paper presents a method for automatically generating all polynomial invariants in simple loops. It is first shown that the set of polynomials serving as loop invariants has the algebraic structure of an ideal. Based on this connection, a fixpoint procedure using operations on ideals and Gröbner basis constructions is proposed for finding all polynomial invariants. Most importantly, it is proved that the procedure terminates in at most m+1 iterations, where m is the number of program variables. The proof relies on showing that the irreducible components of the varieties associated with the ideals generated by the procedure either remain the same or increase their dimension at every iteration of the fixpoint procedure. This yields a correct and complete algorithm for inferring conjunctions of polynomial equalities as invariants. The method has been implemented in Maple using the Groebner package. The implementation has been used to automatically discover non-trivial invariants for several examples to illustrate the power of the technique
Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras
The present text surveys some relevant situations and results where basic
Module Theory interacts with computational aspects of operator algebras. We
tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be
published in Lecture Notes in Computer Scienc
Algorithm FIRE -- Feynman Integral REduction
The recently developed algorithm FIRE performs the reduction of Feynman
integrals to master integrals. It is based on a number of strategies, such as
applying the Laporta algorithm, the s-bases algorithm, region-bases and
integrating explicitly over loop momenta when possible. Currently it is being
used in complicated three-loop calculations.Comment: Comparison with AIR update