Related papers: Signed partitions - A balls into urns approach
In this note, we derive an alternative recursive formula for the sums of powers of integers involving the Stirling numbers of the first kind. As a remarkable by-product, we provide a non-recursive definition of the Catalan numbers.
This paper is concerned with the function $r_{k,s}(n)$, the number of (ordered) representations of $n$ as the sum of $s$ positive $k$-th powers, where integers $k,s\ge 2$. We examine the mean average of the function, or equivalently,…
This article describes a purely analytic approach to urn models of the generalized or extended P\'olya-Eggenberger type, in the case of two types of balls and constant ``balance,'' that is, constant row sum. The treatment starts from a…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.
It is shown in this note that non-central Stirling numbers s(n,k,a) of the first kind naturally appear in the expansion of derivatives of the product of a power function and a logarithn function. We first obtain a recurrence relation for…
Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form…
In this article, we give a positive answer to a question posed in 1960 by D.S. Mitrinovi\'{c} and R.S. Mitrinovi\'{c} (see: D.S. Mitrinovi\'{c} et R.S. Mitrinovi\'{c}, Tableaux qui fournissent des polyn\^{o}mes de Stirling, Publications de…
We introduce a guessing game, permutation Wordle, in which a guesser attempts to recover a hidden permutation in $S_n$. In each round, the guesser guesses a permutation (using information from previous rounds) and is told which entries of…
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…
Spin, $s$ in quantum theory can assume only half odd integer or integer values. For a given $s$, there exist $n=2s+1$ states $|s,m\rangle$, $m=s,s-1,........,-s$. A statistical assembly of particles (like a beam or target employed in…
In a recent paper, we generalized a partition identity stated by Siladi\'c in his study of the level one standard module of type $A_2^{(2)}$. The proof used weighted words with an arbitrary number of primary colors and all the secondary…
In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
This paper presents a family of rapidly convergent summation formulas for various finite sums of the form $\sum_{k=0}^{\lfloor x\rfloor}f(k)$, where $x$ is a positive real number.
In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
A class of generalized Schr\"{o}dinger problems in bounded domain is studied. A complete overview of the set of solutions is provided, depending on the values assumed by parameters involved in the problem. In order to obtain the results, we…