Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1412.3182

Towards a q-analogue of the Harer-Zagier formula via rook placements

Max Wimberley
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1986 Harer and Zagier computed a certain matrix integral to determine an influential closed-form formula for the number of (orientable) one-face maps on n vertices colored from N colors. Kerov (1997) provided a proof which computed the same matrix integral differently, which gave an interpretation of these numbers as also counting the number of placements of non-attacking rooks on Young diagrams. Bernardi (2010) provided a bijective proof of this formula by putting one-face maps in bijection with tree-rooted maps, which are orientable maps with a designated spanning tree. In the first part of the paper, we explore the connection between these rook placements and tree-rooted maps by developing a bijection between these objects. Rook placements on Young diagrams have a q-analogue due to Garsia and Remmel (1986). In the second part of the paper, we propose a statistic on rook placements that leads to a conjectured identity which is a q-analogue of part of the Harer-Zagier formula. This identity is also expressed in terms of moments of orthogonal polynomials which are rescaling of q-Hermite polynomials. We then use these moments to give a recurrence for the proposed q-analogue.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Max Wimberley. 2014-12-10. Towards a q-analogue of the Harer-Zagier formula via rook placements. https://arxiv.org/abs/1412.3182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗