Related papers: Prescribing Symmetries and Automorphisms for Polyt…

Let G=SO(n,1) and Gamma a geometrically finite Zariski dense subgroup of G which is contained in an arithmetic subgroup of G. Denoting by Gamma(q) the principal congruence subgroup of Gamma of level q, and fixing a positive number \lambda_0…

In this paper we complete the classification of topological symmetry groups for complete graphs $K_n$ by characterizing which $K_n$ can have a cyclic group, a dihedral group, or a subgroup of $D_m \times D_m$ where $m$ is odd, as its…

Given a complete CAT(0) space $X$ endowed with a geometric action of a group $\Gamma$, it is known that if $\Gamma$ contains a free abelian group of rank $n$, then $X$ contains a geometric flat of dimension $n$. We prove a converse of this…

A finitely generated group $\Gamma$ is called strongly scale-invariant if there exists an injective endomorphism $\varphi: \Gamma \to \Gamma$ with the image $\varphi(\Gamma)$ of finite index in $\Gamma$ and the subgroup $\displaystyle…

We show that for a very general and natural class of curvature functions, the problem of finding a complete strictly convex hypersurface satisfying f({\kappa}) = {\sigma} over (0,1) with a prescribed asymptotic boundary {\Gamma} at infinity…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

For a congruence subgroup $\Gamma$, we define the notion of $\Gamma$-equivalence on binary quadratic forms which is the same as proper equivalence if $\Gamma = \mathrm{SL}_2(\mathbb Z)$. We develop a theory on $\Gamma$-equivalence such as…

We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Harding showed that the direct product decompositions of many different types of structures, such as sets, groups, vector spaces, topological spaces, and relational structures, naturally form orthomodular posets. When applied to the direct…

Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…

The Gruenberg--Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is defined as follows. The vertex set of $\Gamma(G)$ is the set of all prime divisors of the order of $G$. Two distinct primes $r$ and $s$ regarded as…

Let $\nabla$ be a meromorphic connection on a vector bundle over a compact Riemann surface $\Gamma$. An automorphism $\sigma:\Gamma\to\Gamma$ is called a symmetry of $\nabla$ if the pull-back bundle and the pull-back connection can be…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

Let $\Gamma$ be a torsion free discrete group acting cocompactly on a two dimensional euclidean building $\Delta$. The centralizer of an element of $\Gamma$ is either a Bieberbach group or is described by a finite graph of finite cyclic…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph of diameter $d\geq 3$. Fix a vertex $\gamma$ of $\Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$. We prove…

In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…

We explore the structure of the p-adic automorphism group Gamma of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turan. We initiate the study of a general dimension…

A polynomial automorphism of $\mathbb{A}^n$ over a field of characteristic zero is called co-tame if, together with the affine subgroup, it generates the entire tame subgroup. We prove some new classes of automorphisms, including…