Related papers: Commuting graph of $A$-orbits
The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
For a commutative ring $A$ we consider a related graph, $\Gamma(A)$, whose vertices are the unimodular rows of length $2$ up to multiplication by units. We prove that $\Gamma(A)$ is path-connected if and only if $A$ is a…
In this note we survey recent results on automorphisms of affine algebraic varieties, infinitely transitive group actions and flexibility. We present related constructions and examples, and discuss geometric applications and open problems.
Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…
Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…
Let $G$ be a permutation group acting on a finite set $\Omega$ of cardinality $n$. The number of orbits of the induced action of $G$ on the set $\Omega_m$ of all size $m$ subsets of $\Omega$ satisfies the trivial inequalities…
We look at group actions on metric spaces, particularly at group actions on geodesic hyperbolic spaces. We classify the types of automorphisms on these spaces and prove several results about the density of the hyperbolic limit set of the…
We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…
Let $G$ be an algebraic group and $\Gamma$ a finite subgroup of automorphisms of $G$. Fix also a possibly ramified $\Gamma$-covering $\widetilde{X} \to X$. In this setting one may define the notion of $(\Gamma,G)$-bundles over…
For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…
Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $i:a\mapsto a^{-1}$. A Cayley graph $\Gamma=\mathrm{Cay}(A,S)$ is said to have an automorphism group \emph{as small as possible} if $\mathrm{Aut}(\Gamma)=…
Let $G$ be a finite group. Recall that an $A$-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable $A$-group. Assuming that the commuting…
In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…
A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…
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…
This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…
Let $\Gamma$ be a sub-semigroup of $G=GL(d,\mathbb R),$ $d>1.$ We assume that the action of $\Gamma$ on $\R^d$ is strongly irreducible and that $\Gamma$ contains a proximal and expanding element. We describe contraction properties of the…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…