English
Related papers

Related papers: Reduction-Based Creative Telescoping for Algebraic…

200 papers

We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower…

Symbolic Computation · Computer Science 2012-02-01 Shaoshi Chen , Manuel Kauers

We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed…

Symbolic Computation · Computer Science 2012-11-14 Shaoshi Chen , Frédéric Chyzak , Ruyong Feng , Guofeng Fu , Ziming Li

Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $\Pi\Sigma$-fields, a general class of difference…

Symbolic Computation · Computer Science 2013-12-31 Carsten Schneider

We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…

Symbolic Computation · Computer Science 2023-02-08 Carsten Schneider

We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…

Symbolic Computation · Computer Science 2023-10-03 Shaoshi Chen , Hao Du , Yiman Gao , Ziming Li

A new kind of deformed calculus was introduced recently in studying of parabosonic coordinate representation. Based on this deformed calculus, a new deformation of Hermite polynomials is proposed, its some properties such as generating…

Mathematical Physics · Physics 2007-05-23 Si Cong Jing , Wei Min Yang

It is described how the Hermite-Pad\'e polynomials corresponding to an algebraic approximant for a power series may be used to predict coefficients of the power series that have not been used to compute the Hermite-Pad\'e polynomials. A…

Numerical Analysis · Mathematics 2021-12-14 Herbert H. H. Homeier

We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order…

Symbolic Computation · Computer Science 2014-02-25 Manuel Kauers , Lily Yen

This paper proposes ideas to speed up the process of creative telescoping, particularly when the telescoper is reducible. One can interpret telescoping as computing an annihilator $L \in D$ for an element $m$ in a $D$-module $M$. The main…

Symbolic Computation · Computer Science 2024-05-27 Mark van Hoeij

A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…

Symbolic Computation · Computer Science 2025-06-11 Shaoshi Chen , Yiman Gao , Hui Huang , Carsten Schneider

We develop algebraic methods for computations with tensor data. We give 3 applications: extracting features that are invariant under the orthogonal symmetries in each of the modes, approximation of the tensor spectral norm, and…

Representation Theory · Mathematics 2021-01-19 Neriman Tokcan , Jonathan Gryak , Kayvan Najarian , Harm Derksen

The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the…

Symbolic Computation · Computer Science 2017-10-25 Hui Huang

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

Many computer vision applications require robust and efficient estimation of camera geometry. The robust estimation is usually based on solving camera geometry problems from a minimal number of input data measurements, i.e. solving minimal…

Computer Vision and Pattern Recognition · Computer Science 2019-12-24 Snehal Bhayani , Zuzana Kukelova , Janne Heikkilä

We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…

Symbolic Computation · Computer Science 2026-02-05 Xavier Caruso , Florian Fürnsinn

Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…

Machine Learning · Computer Science 2015-02-10 Alina Ene , Huy L. Nguyen

We show how to convert the generating series of interpolated multiple zeta values, or multiple $t$ values, with repeating blocks of length 1 into hypergeometric series. Then we invoke creative telescoping on their generating functions, in…

Number Theory · Mathematics 2024-04-26 Kam Cheong Au , Steven Charlton

This paper continues the author's previous work on a limit-free algebraic-geometric construction of the derivative in the class of polynomial functions and extends the proposed framework to elementary functions. Derivatives of rational…

General Mathematics · Mathematics 2026-05-21 Davit Kapanadze

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma…

Symbolic Computation · Computer Science 2013-06-19 Frédéric Chyzak , Manuel Kauers , Bruno Salvy

Studies in thermodynamics often require the reduction of some first or second order partial derivatives in terms of a smaller basic set. A simple algorithm to perform such a reduction is presented here, together with a review of earlier…

Computational Physics · Physics 2014-02-11 Jacques H. H. Perk