Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1703.02774

A trinity of duality: non-separable planar maps, $β$-(1,0) trees and synchronized intervals

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

Abstract

The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution on the set of so-called "synchronized intervals" introduced by Préville-Ratelle and the present author. Another example is the class of $β$-(1,0) trees, which has a mysterious involution $h$ proposed by Claesson, Kitaev and Steingrímsson (2009). These two classes of combinatorial objects are all in bijection with the class of non-separable planar maps, which is closed by map duality. In this article, we show that we can identify the notions of duality in these three classes of objects using previously known natural bijections, which leads to a bijective proof of a result from Kitaev and de Mier (2013). We also discuss how various statistics are transferred by duality and by the bijections we used.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenjie Fang. 2017-03-09. A trinity of duality: non-separable planar maps, $β$-(1,0) trees and synchronized intervals. https://doi.org/10.1016/j.aam.2017.10.001

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↗