Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1608.00881

Enumerative and bijective aspects of combinatorial maps: generalization, unification and application (PhD thesis)

Wenjie Fang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and geometric definition, but are also related to some deep algebraic structures. For instance, a special type of maps called constellations provides a unifying framework for some enumeration problems concerning factorizations in the symmetric group. Standing on a position where many domains meet, maps can be studied using a large variety of methods, and their enumeration can also help us count other combinatorial objects. This thesis is a sampling from the rich results and connections in the enumeration of maps. This thesis is structured into four major parts. The first part, including Chapter 1 and 2, consist of an introduction to the enumerative study of maps. The second part, Chapter 3 and 4, contains my work in the enumeration of constellations, which are a special type of maps that can serve as a unifying model of some factorizations of the identity in the symmetric group. The third part, composed by Chapter 5 and 6, shows my research on the enumerative link from maps to other combinatorial objects, such as generalizations of the Tamari lattice and random graphs embeddable onto surfaces. The last part is the closing chapter, in which the thesis concludes with some perspectives and future directions in the enumerative study of maps.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenjie Fang. 2016-09-30. Enumerative and bijective aspects of combinatorial maps: generalization, unification and application (PhD thesis). https://arxiv.org/abs/1608.00881

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↗