Search arXivSearch

arXiv · 2608.06863

On two conjectures on triangulations of 2-manifolds

Abstract

For a closed, connected 2-manifold $M$, and for a triangulation $T$ of $M$, we write $V(T)$ in place of the vertex set associated with $T$. A cyclic coloration of a triangulation $T$ of $M$ refers to a face coloring of $T$ such that: For each $v \in V(T)$, the faces incident to $v$ have distinct colors. Chen and Lawrencenko [Yokohama Math. J., 1999] conjectured that there exists a constant $C(M)$ (depending only on $M$) such that $|V(T)| + C(M)$ colors suffice for there to exist a cyclic coloration of a triangulation $T$ of $M$. We prove this conjecture, using a greedy algorithm related to the Euler-Poincaré formula for surface triangulations. Chen and Lawrencenko also conjectured that: If $M$ is not the projective plane and $T$ is a triangulation of $M$ that is minimal with respect to the number of vertices, then $ξ(T) = |V(T)| = V_{\min}(M)$, where $V_{\min}(M)$ denotes the minimum possible number of vertices among all triangulations of the 2-manifold $M$, and where $ξ(T)$ denotes the minimal value $k$ such that $T$ admits a cyclic coloration with $k$ colors. We disprove this latter conjecture via an explicit counterexample, using an 8-vertex triangulation of the Klein bottle with 16 faces. It appears that both of the Chen-Lawrencenko conjectures have remained open, prior to our work.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2026-08-07. On two conjectures on triangulations of 2-manifolds. https://arxiv.org/abs/2608.06863

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT