Search arXivSearch

arXiv · 2310.16679

On possible symmetry groups of 27-vertex triangulations of manifolds like the octonionic projective plane

Abstract

In 1987 Brehm and Kühnel showed that any triangulation of a $d$-manifold (without boundary) that is not homeomorphic to the sphere has at least $3d/2+3$ vertices. Moreover, triangulations with exactly $3d/2+3$ vertices may exist only for `manifolds like projective planes', which can have dimensions $2$, $4$, $8$, and $16$ only. There is a $6$-vertex triangulation of the real projective plane $\mathbb{RP}^2$, a $9$-vertex triangulation of the complex projective plane $\mathbb{CP}^2$, and $15$-vertex triangulations of the quaternionic projective plane $\mathbb{HP}^2$. Recently, the author has constructed first examples of $27$-vertex triangulations of manifolds like the octonionic projective plane $\mathbb{OP}^2$. The four most symmetrical have symmetry group $\mathrm{C}_3^3\rtimes \mathrm{C}_{13}$ of order $351$. These triangulations were constructed using a computer program after the symmetry group was guessed. However, it remained unclear why exactly this group is realized as the symmetry group and whether $27$-vertex triangulations of manifolds like $\mathbb{OP}^2$ exist with other (possibly larger) symmetry groups. In this paper we find strong restrictions on symmetry groups of such $27$-vertex triangulations. Namely, we present a list of $26$ subgroups of $\mathrm{S}_{27}$ containing all possible symmetry groups of $27$-vertex triangulations of manifolds like the octonionic projective plane. (We do not know whether all these subgroups can be realized as symmetry groups.) The group $\mathrm{C}_3^3\rtimes \mathrm{C}_{13}$ is the largest group in this list, and the orders of all other groups do not exceed $52$. A key role in our approach is played by the use of Smith and Bredon's results on the topology of fixed point sets of finite transformation groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander A. Gaifullin. 2024-04-01. On possible symmetry groups of 27-vertex triangulations of manifolds like the octonionic projective plane. https://doi.org/10.4213/sm10017e

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