Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.14668

Differential equations for the series of hypermaps with control on their full degree profile

Houcine Ben Dali
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the generating series of oriented and non-oriented hypermaps with controlled degrees of vertices, hyperedges and faces. It is well known that these series have natural expansions in terms of Schur and Zonal symmetric functions, and with some particular specializations, they satisfy the celebrated KP and BKP equations. We prove that the full generating series of hypermaps satisfy a family of differential equations. We give a first proof which works for an $α$ deformation of these series related to Jack polynomials. This proof is based on a recent construction formula for Jack characters using differential operators. We also provide a combinatorial proof for the orientable case. Our approach also applies to the series of $k$-constellations with control of the degrees of vertices of all colors. In other words, we obtain an equation for the generating function of Hurwitz numbers (and their $α$-deformations) with control of full ramification profiles above an arbitrary number of points. Such equations are new even in the orientable case.

Explore related subjects

math.COmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Houcine Ben Dali. 2025-11-08. Differential equations for the series of hypermaps with control on their full degree profile. https://arxiv.org/abs/2402.14668

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↗