English
Related papers

Related papers: Recurrent Sums and Partition Identities

200 papers

A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…

Statistical Mechanics · Physics 2009-11-10 V. I. Yukalov , S. Gluzman , D. Sornette

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…

Combinatorics · Mathematics 2023-06-22 Wenjie Fang

Let $m\in\N_{\geq 2}$ and for given $k\in\N_{+}$ consider the sequence $(A_{m,k}(n))_{n\in\N}$ defined by the power series expansion $$ \prod_{n=0}^{\infty}\frac{1}{\left(1-x^{m^{n}}\right)^{k}}=\sum_{n=0}^{\infty}A_{m,k}(n)x^{n}. $$ The…

Number Theory · Mathematics 2018-09-14 Maciej Ulas , Błażej Żmija

The classical Dedekind sums $s(d, c)$ can be represented as sums over the partial quotients of the continued fraction expansion of the rational $\frac{d}{c}$. Hardy sums, the analog integer-valued sums arising in the transformation of the…

Number Theory · Mathematics 2022-03-21 Alessandro Lägeler

The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…

Combinatorics · Mathematics 2020-11-03 Tej Bade , Kelly Cui , Antoine Labelle , Deyuan Li

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

Probability · Mathematics 2007-05-23 Alexander V. Gnedin , Yuri Yakubovich

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…

Combinatorics · Mathematics 2013-07-09 Godofredo Iommi Amunategui

We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.

Number Theory · Mathematics 2007-05-23 Taekyun Kim

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Combinatorics · Mathematics 2016-08-18 S. P. Glasby

We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , Filip Mazowiecki

We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack…

Number Theory · Mathematics 2017-05-18 Victor J. W. Guo , Su-Dan Wang

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

Number Theory · Mathematics 2022-04-22 Bakir Farhi

This paper deals with strong invariance principles (known also as strong approximation theorems) for sums of the form $\sum_{n=1}^{[Nt]}F\big(X(n),X(2n),...,X(kn), X(q_{k+1}(n)),X(q_{k+2}(n)),..., X(q_\ell(n))\big)$

Probability · Mathematics 2013-02-21 Yuri Kifer

In the work we have considered p-adic functional series with binomial coefficients and discussed its p-adic convergence. Then we have derived a recurrence relation following with a summation formula which is invariant for rational argument.…

Number Theory · Mathematics 2019-11-19 Absos Ali Shaikh , Mabud Ali Sarkar

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…

Number Theory · Mathematics 2021-01-05 Vladimir Pletser

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

Combinatorics · Mathematics 2025-09-30 Marin Knežević , Vedran Krčadinac , Lucija Relić

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…

Number Theory · Mathematics 2018-05-15 Zhi-Guo Liu

We introduce an invertible operation on finite sequences of positive integers and call it "kneading". Kneading preserves three invariants of sequences -- the parity of the length, the sum of the entries, and one we call the "alternant". We…

Number Theory · Mathematics 2014-12-16 Barry R. Smith
‹ Prev 1 4 5 6 7 8 10 Next ›