相关论文: The 2-adic valuations of Stirling numbers of the f…
We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…
For positive integers m and n, denote S(m,n) as the associated Stirling number of the second kind and let z be a complex variable. In this paper, we introduce the Stirling functions S(m,n,z) which satisfy S(m,n,z) = S(m,n) for any z which…
Let S(n,k) denote the Stirling numbers of the second kind. We prove that the p-adic limit of S(p^e a + c, p^e b + d) as e goes to infinity exists for all integers a, b, c, and d. We call the limiting p-adic integer S(p^\infty a + c,…
A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…
In this paper we give simple expressions, involving binomials coefficients, for the value of $c(n,k)$ modulo $p^{v_p(n)}$, when $v_p(n) > 0$. Here $c(n,k)$ denotes a Stirling number of the first kind, and $v_p(n)$ is the highest power of…
Two doubly indexed families of homogeneous and isobaric polynomials in several indeterminates are considered: the (partial) exponential Bell polynomials $B_{n,k}$ and a new family $S_{n,k}$ such that $X_1^{-(2n-1)}S_{n,k}$ and $B_{n,k}$…
For a positive integer $k$, let \[ \sigma_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $\nu_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of…
In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…
For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…
Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…
Let S(n,k) be the Stirling number of the second kind. Wilf conjectured that the alternating sum of S(n,k) for k from 0 to n is not zero for all n>2. In this paper, we prove that Wilf conjecture is true except at most one number with the…
We establish a new identity linking Bernoulli, Stirling (first kind), and Bessel (first kind) numbers: \[ \sum_{k=0}^{n} 2^{\,n-k}\,s(n,k)\,B_k \;=\; \sum_{k=0}^{n} b(n,k)\,\frac{(-1)^k\,k!}{k+1}. \] This parallels the classical…
We construct a new parametrization of double sequences $\{A_{n,k}(s)\}_{n,k}$ between $A_{n,k}(0)= \binom{n-1}{k-1}$ and $A_{n,k}(1)= \frac{1}{n!}\stirl{n}{k}$, where $\stirl{n}{k}$ are the unsigned Stirling numbers of the first kind. For…
Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…
In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…
Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…
Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…
We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]
Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…
We consider generalized Stirling numbers of the second kind $% S_{a,b,r}^{\alpha_{s},\beta_{s},r_{s},p_{s}}\left( p,k\right) $, $% k=0,1,\ldots .rp+\sum_{s=2}^{L}r_{s}p_{s}$, where $a,b,\alpha_{s},\beta_{s} $ are complex numbers, and…