Search arXivSearch

arXiv · 2207.08507

634 vertex-transitive and more than $10^{103}$ non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane

Abstract

In 1987 Brehm and Kühnel showed that any combinatorial $d$-manifold with less than $3d/2+3$ vertices is PL homeomorphic to the sphere and any combinatorial $d$-manifold with exactly $3d/2+3$ vertices is PL homeomorphic to either the sphere or a manifold like a projective plane in the sense of Eells and Kuiper. The latter possibility may occur for $d\in\{2,4,8,16\}$ only. There exist a unique $6$-vertex triangulation of $\mathbb{RP}^2$, a unique $9$-vertex triangulation of $\mathbb{CP}^2$, and at least three $15$-vertex triangulations of $\mathbb{HP}^2$. However, until now, the question of whether there exists a $27$-vertex triangulation of a manifold like the octonionic projective plane has remained open. We solve this problem by constructing a lot of examples of such triangulations. Namely, we construct $634$ vertex-transitive $27$-vertex combinatorial $16$-manifolds like the octonionic projective plane. Four of them have symmetry group $\mathrm{C}_3^3\rtimes \mathrm{C}_{13}$ of order $351$, and the other $630$ have symmetry group $\mathrm{C}_3^3$ of order $27$. Further, we construct more than $10^{103}$ non-vertex-transitive $27$-vertex combinatorial $16$-manifolds like the octonionic projective plane. Most of them have trivial symmetry group, but there are also symmetry groups $\mathrm{C}_3$, $\mathrm{C}_3^2$, and $\mathrm{C}_{13}$. We conjecture that all the triangulations constructed are PL homeomorphic to the octonionic projective plane $\mathbb{OP}^2$. Nevertheless, we have no proof of this fact so far.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander A. Gaifullin. 2024-03-29. 634 vertex-transitive and more than $10^{103}$ non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane. https://doi.org/10.4213/im9489e

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