Symbolic solution of certain problems in permutations

DOI10.1090/S0002-9904-1944-08261-XzbMath0063.03136WikidataQ55981256 ScholiaQ55981256MaRDI QIDQ5843868

Irving Kaplansky

Publication date: 1944

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Related Items

The \(q\)-log-concavity and unimodality of \(q\)-Kaplansky numbers ⋮ An analysis of the last round matching problem ⋮ Distributions of successions of arbitrary multisets ⋮ Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Counting Successions in Permutations ⋮ Matching the finitized Poisson distribution to the matching distributions ⋮ On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation ⋮ The problem of coincidences ⋮ A vector space analog of permutations with restricted position ⋮ On the permanents of complements of the direct sum of identity matrices ⋮ On the problème des ménages ⋮ \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position ⋮ Enumeration of sequences by levels and rises ⋮ Permutations and successions ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments ⋮ Permutations without 3-sequences ⋮ Symbolic solution of card matching problems ⋮ The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach ⋮ From Hertzsprung's problem to pattern-rewriting systems ⋮ The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.