English
Related papers

Related papers: Closed form summation of C-finite sequences

200 papers

In this paper we show how to find a closed form solution for third order difference operators in terms of solutions of second order operators. This work is an extension of previous results on finding closed form solutions of recurrence…

Symbolic Computation · Computer Science 2013-01-22 Yongjae Cha

This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…

High Energy Physics - Phenomenology · Physics 2008-11-26 J. A. M. Vermaseren

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…

Classical Analysis and ODEs · Mathematics 2013-11-20 Ivan Gonoskov

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

Combinatorics · Mathematics 2016-05-12 Ilker Akkus

We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…

Number Theory · Mathematics 2022-10-04 Bruce C. Berndt , Sun Kim , Alexandru Zaharescu

In this paper, we present the existence and uniqueness property on a finite sum involving a polynomial and a homogeneous linear recurrence sequence. This finite sum is of the form $\sum_{k=1}^n P(k)s_{hk+r}$ where $n$ is a positive integer,…

Number Theory · Mathematics 2025-09-03 Ivan Hadinata

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…

Number Theory · Mathematics 2022-09-09 Kunle Adegoke

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…

Combinatorics · Mathematics 2010-05-26 Gautami Bhowmik , Immanuel Halupczok , Jan-Christoph Schlage-Puchta

We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…

Number Theory · Mathematics 2025-12-02 Mihai Prunescu

Let A be a positive operator in an infinite sigma-finite von Neumann factor M and let B_j be a sequence of positive elements in M. We give sufficient conditions for decomposing A into a sum of elements C_j equivalent to B_j for all j ( C…

Operator Algebras · Mathematics 2015-12-31 Catalin Dragan , Victor Kaftal

Infinite series of Bessel function of the first kind, $\sum_\nu^{\pm\infty} J_{N\nu+p}(x)$, $\sum_\nu^{\pm\infty} (-1)^\nu J_{N\nu+p}(x)$, are summed in closed form. These expressions are evaluated by engineering a Dirac comb that selects…

Mathematical Physics · Physics 2022-11-04 Suk Hyun Sung , Robert Hovden

Let, for r>=2, (m_r(n)),n>=0, be Moser sequence such that every nonnegative integer is the unique sum of the form s_k+rs_l. In this article we give an explicit decomposition formulas of such form and an unexpectedly simple recursion…

Number Theory · Mathematics 2008-12-02 Vladimir Shevelev

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien

A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…

Rings and Algebras · Mathematics 2023-02-09 Manuel Kauers , Philipp Nuspl , Veronika Pillwein

In this paper, we introduce a novel indefinite summation $\sum_{t} f(t)$ (or antidifference $\Delta ^{-1}f(t) $ ) formula for any given function $f$. We apply the indefinite summation formula to calculate a particular solution to a…

Classical Analysis and ODEs · Mathematics 2024-06-28 Hailu Bikila Yadeta

Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form…

Number Theory · Mathematics 2016-12-30 Sergei V. Konyagin , Melvyn B. Nathanson

This is a discussion of miscellaneous summation, integration and transformation formulas obtained using Fourier analysis. The topics covered are: Series of the form $\sum_{n\in\mathbb{Z}} c_ne^{\pi i \gamma n^2}$; Fusion of integrals, and…

Classical Analysis and ODEs · Mathematics 2025-02-12 Martin Nicholson

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

Computational Complexity · Computer Science 2021-07-15 Pascal Koiran , Mateusz Skomra