Search arXivSearch

arXiv · 1408.2984

Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere

Abstract

Let $\mathcal{G}$ be a properly face 2-coloured (say black and white) \break piecewise-linear triangulation of the sphere with vertex set $V$. Consider the abelian group $\mathcal{A}_W$ generated by the set $V$, with relations $r+c+s=0$ for all white triangles with vertices $r$, $c$ and $s$. The group $\mathcal{A}_B$ can be defined similarly, using black triangles. These groups are related in the following manner $\mathcal{A}_W\cong\mathcal{A}_B\cong\mathbb{Z}\oplus\mathbb{Z}\oplus\mathcal{C}$ where $\mathcal{C}$ is a finite abelian group. The finite torsion subgroup $\mathcal{C}$ is referred to as the canonical group of the triangulation. Let $m_t$ be the maximal order of $\mathcal{C}$ over all properly face two-coloured spherical triangulations with $t$ triangles of each colour. By relating properly face two-coloured spherical triangulations to directed Eulerian spherical embeddings of digraphs whose abelian sand-pile groups are isomorphic to $\mathcal{C}$ we provide improved upper and lower bounds for $\lim \sup_{t\rightarrow\infty}(m_t)^{1/t}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas A. McCourt. 2016-01-20. Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere. https://arxiv.org/abs/1408.2984

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