Related papers: Cesaro's integral formula for the Bell numbers (co…
In this paper, the integral representations of the $k$-Pell and $k$-Pell-Lucas numbers are presented. Using Binet's formulas for these numbers, we obtain a number of identities and use elementary integral calculus to confirm their integral…
It is very difficult and important to construct Bell inequalities for n-partite, k-settings of measurement, and d-dimensional (n,k,d) systems. Inspired by the iteration formula form of the Mermin-Ardehali-Belinski{\u{\i}}-Klyshko (MABK)…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
Bell inequalities are a vital tool to detect the nonlocal correlations, but the construction of them for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of $(n+1)$-partite Bell inequalities…
Euler's solution in 1734 of the Basel problem, which asks for a closed form expression for the sum of the reciprocals of all perfect squares, is one of the most celebrated results of mathematical analysis. In the modern era, numerous proofs…
The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…
Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…
Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…
Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated $(s, m s \pm 1)$-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these…
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…
Based on two involutions and a bijection, we completely determine the difference between the number of $\ell$-regular partitions of $n$ into an even number of parts and into an odd number of parts for all positive integers $n$ and $\ell>1$,…
We prove that the number of partitions of an integer into at most b distinct parts of size at most n forms a unimodal sequence for n sufficiently large with respect to b. This resolves a recent conjecture of Stanley and Zanello.
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…
In this paper we derive congruences expressing Bell numbers and derangement numbers in terms of each other modulo any prime.
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
Building on work by Zagier, Bousquet-M\'elou et al., and Khamis, we give an asymptotic formula for the number of labelled interval orders on an $n$-element set.
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for theevaluation of Feynman diagrams. We describe the operational rules and illustrate the method…
Partitions of [n]={1,2,...,n} into sets of lists are counted by sequence number A000262 in the On-Line Encyclopedia of Integer Sequences. They are somewhat less numerous than partitions of [n] into lists of sets, A000670. Here we observe…