Searcharxiv⌕ Search

arXiv · 2610.04491

A non-plain virtually free group with a strictly 2-geodetic Cayley graph

Abstract

We construct an explicit infinite virtually free group $G=C_4\ast_{C_2}D_3$ with a finite inverse-closed generating set whose Cayley graph is $2$-geodetic but not geodetic. More precisely, we describe the full language of geodesics and show that every element of $G$ has a unique geodesic representative except for a single element, which has exactly two. This gives a counterexample to the conjecture that an infinite group admitting a $k$-geodetic Cayley graph must admit a geodetic Cayley graph with respect to the same generating set. We further prove that $G$ is freely indecomposable and hence non-plain. Consequently, Shapiro's conjecture that every geodetic group is plain and the conjecture that every hyperbolic $k$-geodetic group is geodetic cannot both hold.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

André Carvalho. 2026-10-03. A non-plain virtually free group with a strictly 2-geodetic Cayley graph. https://arxiv.org/abs/2610.04491

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

KEEP EXPLORING

Related papers

Unsolved Problems in Group Theory. The Kourovka Notebook

This is a collection of open problems in group theory proposed by hundreds of mathematicians from all over the world. It has been published every 2--4 years since 1965. This is the 21st edition, which contains 150 new problems and a number of comments on problems from the previous editions.

math.GR↗

On embeddings of the difference graph of the intersection power graph and the power graph

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The intersection power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices $x$, $y$ are adjacent if $\langle x\rangle \cap \langle y \rangle \neq \{e\}$. The difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the intersection power graph $\mathcal{G}_{1}(G)$ and power graph $\mathcal{P}(G)$ with all isolated vertices removed. We characterized all the finite nilpotent groups $G$ such that the difference graph is planar. Further, we determine all the finite nilpotent groups whose difference graph has genus at most $2$. Moreover, we prove that there does not exist any group whose difference graph is projective planar.

math.GR↗

Soficity of One-Relator Groups and Reducible Presentations

We prove that every one-relator group is sofic, answering a question of Nate Brown. More generally, every group admitting a reducible presentation without proper powers is sofic, with one proper-power relation allowed at the final reducible step. The proof starts from the endpoint-preserving edge replacements of Poulin--Wróbel. We retain the free-group word carried by each terminal replacement and use it to define an \(F(S)\)-valued cocycle repair; in its relative form, the repair preserves the previously chosen generator coordinates while controlling the new relator defect. Coinduction transports the lower cocycle through successive one-relator-product extensions, allowing the construction to be iterated along reducible presentations. For a final relator \(w^m\), cyclic translates of the repaired set amplify a zero-defect set of measure close to \(1/m\) to one of measure close to one. A cocycle criterion then converts arbitrarily small relator defect into finite permutation approximations via a treeable skew-product orbit relation.

math.GR↗