Back to Search
Start Over
A direct bijection for the Harer–Zagier formula
- Source :
- Journal of Combinatorial Theory, Series A. (2):224-238
- Publisher :
- Elsevier Inc.
-
Abstract
- We give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribution of a long cycle multiplied by an involution with no fixed points, in the symmetric group on a set of even cardinality. The main result of this paper is a direct bijection of a set Bp,k, the enumeration of which is equivalent to the Harer-Zagier formula. The elements of Bp,k are of the form (µ, π), where µ is a pairing on {1,...,2p}, π is a partition into k blocks of the same set, and a certain relation holds between µ and π. (The set partitions π that can appear in Bp,k are called "shift-symmetric", for reasons that are explained in the paper.) The direct bijection for Bp,k identifies it with a set of objects of the form (ρ, t), where ρ is a pairing on a 2(p - k + 1)-subset of {1, ..., 2p} (a "partial pairing"), and t is an ordered tree with k vertices. If we specialize to the extreme case when p = k - 1, then ρ is empty, and our bijection reduces to a well-known tree bijection.
- Subjects :
- Discrete mathematics
010102 general mathematics
Combinatorial proof
0102 computer and information sciences
Disjoint sets
Fixed point
01 natural sciences
Theoretical Computer Science
Combinatorics
Permutation counting
Cycle distribution
Computational Theory and Mathematics
010201 computation theory & mathematics
Symmetric group
Pairing
Enumeration
Bijection
Partition (number theory)
Discrete Mathematics and Combinatorics
0101 mathematics
Combinatorial bijection
Mathematics
Harer–Zagier formula
Ordered tree
Subjects
Details
- Language :
- English
- ISSN :
- 00973165
- Issue :
- 2
- Database :
- OpenAIRE
- Journal :
- Journal of Combinatorial Theory, Series A
- Accession number :
- edsair.doi.dedup.....a9155db4a2e92d03bcabf4dc78e1f210
- Full Text :
- https://doi.org/10.1016/j.jcta.2004.12.003