English
Related papers

Related papers: Recurrent Sums and Partition Identities

200 papers

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

Symbolic Computation · Computer Science 2015-07-16 Sébastien Maulat , Bruno Salvy

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

Combinatorics · Mathematics 2013-02-12 Milan Janjic

In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.

Number Theory · Mathematics 2007-05-23 T. Kim

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

Combinatorics · Mathematics 2016-03-25 David Ellerman

Studies on partition of $I_n$ = $\{1, 2, . . . , n\}$ into subsets $S_1, S_2, . . . , S_x$ so far considered with prescribed sum of the elements in each subset. In this paper, we study constant sum partitions $\{S_1,S_2,...,S_x\}$ of $I_n$…

Combinatorics · Mathematics 2023-12-04 V. Vilfred Kamalappan , Sajidha P

We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are…

Combinatorics · Mathematics 2018-08-09 Abraham Isgur , Vitaly Kuznetsov , Mustazee Rahman , Stephen Tanny

A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…

Number Theory · Mathematics 2011-03-31 Roman Zatorsky

Some examples of naturally arising multisum $q$-series which turn out to have representations as fermionic single sums are presented. The resulting identities are proved using transformation formulas from the theory of basic hypergeometric…

Classical Analysis and ODEs · Mathematics 2018-12-14 Andrew V. Sills

We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…

Combinatorics · Mathematics 2024-06-10 Shaoshi Chen , Ruyong Feng , Manuel Kauers , Xiuyun Li

We consider the $k$-nested sum of integer powers, $F(n,m,k)$, defined as repeated partial sums of the classical Faulhaber polynomials. We provide an explicit recurrence relation relating $F(n,m,k)$ to sums of lower power $m-1$ and higher…

Combinatorics · Mathematics 2025-11-21 Alexander R. Povolotsky

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

Number Theory · Mathematics 2024-06-26 Bernd C. Kellner , Jonathan Sondow

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

Combinatorics · Mathematics 2007-05-23 Helmut Prodinger

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Combinatorics · Mathematics 2021-08-31 Jakub Konieczny

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Distorted sums of models were introduced and discussed in [Sh:463]. This notion generalizes the notion of disjoint (or direct) sums of models by letting the summands overlap. In the first section we investigate types in distorted sums and…

Logic · Mathematics 2019-09-02 Shmuel Lifsches , Saharon Shelah

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Number Theory · Mathematics 2020-08-17 George E. Andrews

We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…

Combinatorics · Mathematics 2007-05-23 Curtis Greene , Herbert S. Wilf

For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0}$, where $p\in\{0,\ldots,q-1\}$. When…

Combinatorics · Mathematics 2019-05-10 Jean-Luc Marichal

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

Combinatorics · Mathematics 2025-02-03 Michael J. Schlosser , Nian Hong Zhou