SearcharxivSearch

arXiv · 2307.00546

The full automorphism groups of general position graphs

Abstract

Let $S$ be a non-empty finite set. A flag of $S$ is a set $f$ of non-empty proper subsets of $S$ such that $X\subseteq Y$ or $Y\subseteq X$ for all $X,Y\in f$. The set $\{|X|:X\in f\}$ is called the type of $f$. Two flags $f$ and $f'$ are in general position with respect to $S$ if $X\cap Y=\emptyset$ or $X\cup Y=S$ for all $X\in f$ and $Y\in f'$. For a fixed type $T$, Klaus Metsch defined the general position graph $\Gamma(S,T)$ whose vertices are the flags of $S$ of type $T$ with two vertices being adjacent when the corresponding flags are in general position. In this paper, we characterize the full automorphism groups of $\Gamma(S,T)$ in the case that $|T|=2$. In particular, we solve an open problem proposed by Klaus Metsch.

Explore related subjects

Keep this discovery

BibTeXRIS

Junyao Pan. 2023-07-02. The full automorphism groups of general position graphs. https://doi.org/10.1016/j.jcta.2023.105800

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR