Ménage Numbers and Ménage Permutations

2015/02/21 by Yiting Li, Li, Yiting
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Advanced Mathematical Theories #Combinatorics (math.CO) #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.1502.06068

openalex publication_date 2015/02/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we study the combinatorial structures of straight and ordinary ménage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the ménage numbers and the Catalan numbers. The other two formulas count the ménage permutations by number of cycles.

Related

• Automatic Enumeration of Generalized Menage Numbers
• Enumerations of Permutations Simultaneously Avoiding a Vincular and a\n Covincular Pattern of Length 3
• Eulerian-Catalan Numbers
• On Connection between the Numbers of Permutations and Full Cycles with\n Some Restrictions on Positions and Up-Down Structure
• Stirling permutations, cycle structures of permutations and perfect matchings