Abstract
We address the problem of enumeration of seating arrangements of married couples around a circular table such that no spouses sit next to each other and no k consecutive persons are of the same gender. While the case of \(k=2\) corresponds to the classical problème des ménages with a well-studied solution, no closed-form expression for the number of seating arrangements is known when \(k\ge 3\).
We propose a novel approach for this type of problems based on enumeration of walks in certain algebraically weighted de Bruijn graphs. Our approach leads to new expressions for the menage numbers and their exponential generating function and allows one to efficiently compute the number of seating arrangements in general cases, which we illustrate in detail for the ternary case of \(k=3\).
The work is supported by the National Science Foundation under grant No. IIS-1462107.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We remark that \(A^2\) does not depend on y, so it is not surprising that the eigenvalues of A do not depend on y either.
References
Bleistein, N., Handelsman, R.A.: Asymptotic Expansions of Integrals. Dover Books on Mathematics, Revised edn. Dover Publications, New York (2010)
Bogart, K.P., Doyle, P.G.: Non-sexist solution of the ménage problem. Am. Math. Monthly 93, 514–519 (1986)
de Bruijn, N.G.: A combinatorial problem. Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam 49(7), 758–764 (1946)
Golin, M.J., Leung, Y.C.: Unhooking circulant graphs: a combinatorial method for counting spanning trees and other parameters. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 296–307. Springer, Heidelberg (2004)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley, Reading, MA (1994)
Lucas, E.: Théorie des Nombres. Gauthier-Villars, Paris (1891)
Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press, New York, NY (1997)
The OEIS Foundation: The On-Line Encyclopedia of Integer Sequences. Published electronically at http://oeis.org (2016)
Touchard, J.: Sur un probléme de permutations. C. R. Acad. Sci. Paris 198, 631–633 (1934)
Wyman, M., Moser, L.: On the problème des ménages. Can. J. Math. 10, 468–480 (1958)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Alekseyev, M.A. (2016). Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations. In: Mäkinen, V., Puglisi, S., Salmela, L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science(), vol 9843. Springer, Cham. https://doi.org/10.1007/978-3-319-44543-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-44543-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44542-7
Online ISBN: 978-3-319-44543-4
eBook Packages: Computer ScienceComputer Science (R0)