Related papers: String C-groups as transitive subgroups of Sym(n)

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

The random triangular group \Gamma(n,t) is a group given by a presentation P=<S|R>, where S is a set of n generators and R is a random set of t cyclically reduced words of length three. The asymptotic behavior of \Gamma(n,t) is in some…

Motivated by some known problems concerning combinatorial structures associated with finite one-dimensional affine permutation groups, we study subgroups which are closed in $\operatorname{\Gamma{L}}_1(q)$. This brings us to a description…

A graph pair $(\Gamma, \Sigma)$ is called stable if $\aut(\Gamma)\times\aut(\Sigma)$ is isomorphic to $\aut(\Gamma\times\Sigma)$ and unstable otherwise, where $\Gamma\times\Sigma$ is the direct product of $\Gamma$ and $\Sigma$. A graph is…

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Thoma's theorem states that a group algebra $C^*(\Gamma)$ is of type I if and only if $\Gamma$ is virtually abelian. We discuss here some similar questions for the quantum groups, our main result stating that, under suitable virtually…

Let $p$ be a prime and let $L$ be either the intransitive permutation group $C_p\times C_p$ of degree $2p$ or the transitive permutation group $C_p \wr C_2$ of degree $2p$. Let $\Gamma$ be a connected $G$-vertex-transitive and…

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

The main result of this paper is that, if $\Gamma$ is a connected 4-valent $G$-arc-transitive graph and $v$ is a vertex of $\Gamma$, then either $\Gamma$ is one of a well understood infinite family of graphs, or $|G_v|\leq 2^43^6$ or…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

We define a new variety of loops we call $\Gamma$-loops. After showing $\Gamma$-loops are power associative, our main goal will be showing a categorical isomorphism between Bruck loops of odd order and $\Gamma$-loops of odd order. Once this…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

For a group $G$, we define a graph $\Delta(G)$ by letting $G^{\#} = G \setminus \{ 1 \}$ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\#}$ if and only if the subgroup $\langle x,y\rangle$ is cyclic.…

I. M. Chiswell has asked whether every group that admits a free isometric action (without inversions) on a $\Lambda$-tree is orderable. We give an example of a multiple HNN extension $\Gamma$ which acts freely on a $\mathbb{Z}^2$-tree but…