Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1511.01773

The distance-dependent two-point function of triangulations: a new derivation from old results

Emmanuel Guitter
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a new derivation of the distance-dependent two-point function of random planar triangulations. As it is well-known, this function is intimately related to the generating functions of so-called slices, which are pieces of triangulation having boundaries made of shortest paths of prescribed length. We show that the slice generating functions are fully determined by a direct recursive relation on their boundary length. Remarkably, the kernel of this recursion is some quantity introduced and computed by Tutte a long time ago in the context of a global enumeration of planar triangulations. We may thus rely on these old results to solve our new recursion relation explicitly in a constructive way.

Explore related subjects

math.COmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emmanuel Guitter. 2015-11-05. The distance-dependent two-point function of triangulations: a new derivation from old results. https://doi.org/10.4171/aihpd%2F38

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↗