180 research outputs found
Complexity Estimates for Two Uncoupling Algorithms
Uncoupling algorithms transform a linear differential system of first order
into one or several scalar differential equations. We examine two approaches to
uncoupling: the cyclic-vector method (CVM) and the
Danilevski-Barkatou-Z\"urcher algorithm (DBZ). We give tight size bounds on the
scalar equations produced by CVM, and design a fast variant of CVM whose
complexity is quasi-optimal with respect to the output size. We exhibit a
strong structural link between CVM and DBZ enabling to show that, in the
generic case, DBZ has polynomial complexity and that it produces a single
equation, strongly related to the output of CVM. We prove that algorithm CVM is
faster than DBZ by almost two orders of magnitude, and provide experimental
results that validate the theoretical complexity analyses.Comment: To appear in Proceedings of ISSAC'13 (21/01/2013
Automatic Classification of Restricted Lattice Walks
We propose an experimental mathematics approach leading to the
computer-driven discovery of various structural properties of general counting
functions coming from enumeration of walks
Fast Conversion Algorithms for Orthogonal Polynomials
We discuss efficient conversion algorithms for orthogonal polynomials. We
describe a known conversion algorithm from an arbitrary orthogonal basis to the
monomial basis, and deduce a new algorithm of the same complexity for the
converse operation
Efficient Algorithms for Mixed Creative Telescoping
Creative telescoping is a powerful computer algebra paradigm -initiated by
Doron Zeilberger in the 90's- for dealing with definite integrals and sums with
parameters. We address the mixed continuous-discrete case, and focus on the
integration of bivariate hypergeometric-hyperexponential terms. We design a new
creative telescoping algorithm operating on this class of inputs, based on a
Hermite-like reduction procedure. The new algorithm has two nice features: it
is efficient and it delivers, for a suitable representation of the input, a
minimal-order telescoper. Its analysis reveals tight bounds on the sizes of the
telescoper it produces.Comment: To be published in the proceedings of ISSAC'1
Explicit formula for the generating series of diagonal 3D rook paths
Let denote the number of ways in which a chess rook can move from a
corner cell to the opposite corner cell of an
three-dimensional chessboard, assuming that the piece moves closer to the goal
cell at each step. We describe the computer-driven \emph{discovery and proof}
of the fact that the generating series admits
the following explicit expression in terms of a Gaussian hypergeometric
function: G(x) = 1 + 6 \cdot \int_0^x \frac{\,\pFq21{1/3}{2/3}{2} {\frac{27
w(2-3w)}{(1-4w)^3}}}{(1-4w)(1-64w)} \, dw.Comment: To appear in "S\'eminaire Lotharingien de Combinatoire
- …