Search arXivSearch

arXiv · 2002.07238

Blossoming bijection for bipartite pointed maps and parametric rationality of general maps of any surface

Abstract

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances from the pointed vertex in the initial map. The main construction generalizes recent work of the second author which covered the case of an orientable surface. Our bijection gives rise to a first combinatorial proof of a parametric rationality result concerning the bivariate generating series of maps of a given surface with respect to their numbers of faces and vertices. In particular, it provides a combinatorial explanation of the structural difference between the aforementioned bivariate parametric generating series in the case of orientable and non-orientable maps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maciej Dołęga, Mathias Lepoutre. 2022-07-31. Blossoming bijection for bipartite pointed maps and parametric rationality of general maps of any surface. https://doi.org/10.1016/j.aam.2022.102408

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

KEEP EXPLORING

Related papers

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

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