Corpus ID: 201111993

AN IDENTITY INVOLVING STIRLING NUMBERS OF BOTH KINDS AND ITS CONNECTION TO RIGHT-TO-LEFT MINIMA OF CERTAIN SET PARTITIONS

@inproceedings{Herscovici2019ANII,
  title={AN IDENTITY INVOLVING STIRLING NUMBERS OF BOTH KINDS AND ITS CONNECTION TO RIGHT-TO-LEFT MINIMA OF CERTAIN SET PARTITIONS},
  author={O. Herscovici and R. Pinsky},
  year={2019}
}
For 1 ≤ k ≤ n, n ∈ N, let S(n, k) denote the Stirling numbers of the second kind and let s(n, k) = (−1)n−k|s(n, k)| denote the Stirling numbers of the first kind, where |s(n, k)| denote the unsigned Stirling numbers of the first kind. Extend the definitions to all n, k ∈ N by defining all of these Stirling numbers to be equal to zero if k > n. Let S = {S(n, k)} (respectively, s = {s(n, k)}, |s| = {|s(n, k)|}) denote the infinite matrix whose nk-th entry is S(n, k) (respectively s(n, k), |s(n, k… Expand

References

SHOWING 1-5 OF 5 REFERENCES
Right-jumps and pattern avoiding permutations
  • 6
  • PDF
Permutation Patterns: On three different notions of monotone subsequences
  • 27
  • PDF
Convolution Polynomials, https://arxiv.org/pdf/math/9207221.pdf
  • 1992
Combinatorics of Permutations, Second Edition
  • M. Bóna
  • Mathematics, Computer Science
  • Discrete mathematics and its applications
  • 2012
  • 68
SORTING NUMBERS FOR CYLINDERS AND OTHER CLASSICATION NUMBER
  • 29