English
Related papers

Related papers: Symbolic computation of hypergeometric type and no…

200 papers

Holonomic functions play an essential role in Computer Algebra since they allow the application of many symbolic algorithms. Among all algorithmic attempts to find formulas for power series, the holonomic property remains the most important…

Symbolic Computation · Computer Science 2022-04-18 Bertrand Teguia Tabuguia , Wolfram Koepf

Linear homogeneous recurrence equations with polynomial coefficients are said to be holonomic. Such equations have been introduced in the last century for proving and discovering combinatorial and hypergeometric identities. Given a field K…

Symbolic Computation · Computer Science 2022-01-19 Bertrand Teguia Tabuguia

Polynomial sequence ${P_m}_{m\geq0}$ is $q$-logarithmically concave if $P_{m}^2-P_{m+1}P_{m-1}$ is a polynomial with nonnegative coefficients for any $m\geq{1}$. We introduce an analogue of this notion for formal power series whose…

Classical Analysis and ODEs · Mathematics 2012-11-15 S. I. Kalmykov , D. B. Karp

Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…

Symbolic Computation · Computer Science 2024-10-16 Bertrand Teguia Tabuguia

Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…

Combinatorics · Mathematics 2012-03-23 Victor Kowalenko

We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…

Symbolic Computation · Computer Science 2024-04-22 Bertrand Teguia Tabuguia

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

Symbolic Computation · Computer Science 2022-12-16 Antonio Jiménez-Pastor , Marko Petkovšek

The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called a hypergeometric term if both…

Classical Analysis and ODEs · Mathematics 2016-09-06 Wolfram Koepf

This paper studies the equivalence between generalized holomorphic functions (GHF) and complex analytic functions in the framework of Robinson-Colombeau generalized numbers. In every non-Archimedean ring, the use of ordinary series is…

Functional Analysis · Mathematics 2026-04-21 Sekar Nugraheni , Paolo Giordano

In many applications (hupergeometric-type) special functions like orthogonal polynomials are needed. For example in more than 50% of the published solutions for the (application-oriented) questions in the "Problems Section" of SIAM Review…

Classical Analysis and ODEs · Mathematics 2025-10-20 Wolfram Koepf

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

Symbolic Computation · Computer Science 2018-04-10 Marko Petkovšek

The M-polynomial, introduced by Deutsch and Klav\v{z}ar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Zagreb, Randic, harmonic, and forgotten indices. Despite…

Combinatorics · Mathematics 2026-03-31 El-Mehdi Mehiri

We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…

Symbolic Computation · Computer Science 2016-01-11 Jakob Ablinger , Johannes Bluemlein , Abilio de Freitas , Carsten Schneider

We prove that the homogeneously polyanalytic functions of total order $m$, defined by the system of equations $\overline{D}^{(k_1,\ldots,k_n)} f=0$ with $k_1+\cdots+k_n=m$, can be written as polynomials of total degree $<m$ in variables…

Complex Variables · Mathematics 2021-09-15 Christian Rene Leal-Pacheco , Egor A. Maximenko , Gerardo Ramos-Vazquez

In this paper, we show that the generalized hypergeometric function mF_m-1 has a one parameter group of local symmetries, which is a conjugation of a flow of a rational Calogero-Mozer system. We use the symmetry to construct fermionic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Oleg Gleizer

Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…

Algebraic Geometry · Mathematics 2007-05-23 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernandez

We investigate a class of power series occurring in some problems in quantum optics. Their coefficients are either Gegenbauer or Laguerre polynomials multiplied by binomial coefficients. Although their sums have been known for a long time,…

Mathematical Physics · Physics 2012-10-09 Paulina Marian , Tudor A. Marian

We consider polynomials of the form $\operatorname{h}_m(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]})$, where $\operatorname{h}_m$ is the complete homogeneous polynomial of degree $m$ and $y_j^{[\varkappa_j]}$ denotes $y_j$ repeated…

Combinatorics · Mathematics 2025-01-22 Luis Angel González-Serrano , Egor A. Maximenko

In previous paper I construct an approximative solution of the power series expansion in closed forms of Grand Confluent Hypergeometric (GCH) function only up to one term of A_n's [4]. And I obtain normalized constant and orthogonal…

Mathematical Physics · Physics 2014-11-06 Yoon Seok Choun

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau
‹ Prev 1 2 3 10 Next ›