Solution of the “Problème des ménages”

DOI10.1090/S0002-9904-1943-08035-4zbMath0060.02904MaRDI QIDQ5834384

No author found.

Publication date: 1943

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

zbMATH Keywords

combinatoricsmarriage problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (35)

Two selection problems revisited ⋮ On the problème des ménages ⋮ The number of s-separated k-sets in various circles ⋮ THE ESTIMATION OF ERROR ON POISSON APPROXIMATION FOR THE MÉNAGE PROBLEM ⋮ Successions in words and compositions ⋮ On partial information retrieval: the unconstrained 100 prisoner problem ⋮ Set partitions with circular successions ⋮ Counting permutations by simsun successions ⋮ Automatic counting of generalized Latin rectangles and trapezoids ⋮ The extended Frobenius problem for Fibonacci sequences incremented by a Fibonacci number ⋮ Counting permutations by the number of successions within cycles ⋮ On the number of combinations without unit separation ⋮ On the problème des ménages ⋮ On the number of combinations without certain separations ⋮ Dickson–Stirling numbers ⋮ The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint ⋮ Subsets without \(q\)-separation and binomial products of Fibonacci numbers ⋮ A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization ⋮ A new proof of a theorem of Mansour and Sun ⋮ Monotypical uniformly homogeneous sets of permutations ⋮ Block-connected set partitions ⋮ On Two Families of Generalizations of Pascal's Triangle ⋮ The log-behavior of ménage numbers ⋮ A market problem ⋮ 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 ⋮ Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ On arithmetic partitions of \(\mathbb Z_n\) ⋮ Latin rectangles and quadrature formulas ⋮ Permutations without 3-sequences ⋮ Symbolic solution of card matching problems ⋮ On the Failure Rates of Consecutive−k−out−of−n Systems ⋮ A partition identity ⋮ Selecting non-consecutive balls arranged in many lines

This page was built for publication: Solution of the “Problème des ménages”