Permutations and Combination Locks

DOI10.2307/2690567zbMath0858.05009OpenAlexW4248468098WikidataQ29300779 ScholiaQ29300779MaRDI QIDQ4891762

Daniel J. Velleman, Gregory S. Call

Publication date: 12 September 1996

Full work available at URL: https://doi.org/10.2307/2690567

zbMATH Keywords

generating functionsStirling numbersinteger sequencepermutation countingcombination lock

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic enumeration (05A16)

Related Items (7)

Extensions of set partitions and permutations ⋮ Eulerian fractions and Stirling, Bernoulli and Euler functions with complex order parameters and their impact on the polylogarithm function ⋮ On the generalization of the Lambert $W$ function ⋮ A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices ⋮ Some identities of degenerate Fubini polynomials arising from differential equations ⋮ On certain summation problems and generalizations of Eulerian polynomials and numbers ⋮ On discrete Picard operators

This page was built for publication: Permutations and Combination Locks