Related papers: Configuration sets for groups

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…

These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…

A group pair $(G, X)$ consists of a group $G$ together with a $G$-set $X$. Such a pair encodes properties of $G$ relative to the stabilisers of points in $X$. In this paper, we show how to combine properties of group pairs and their…

In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…

We prove a conjectured graph theoretic characterization of a geometric property of 3 dimensional linkages posed 15 years ago by Sitharam and Gao, motivated by their equivalent characterization for $d\le 2$ that does not generalize to $d\ge…

We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we…

Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism…

We consider the moduli space of flat G-bundles over the twodimensional torus, where G is a real, compact, simple Lie group which is not simply connected. We show that the connected components that describe topologically non-trivial bundles…

The pairs $(\mathcal{D},G)$, where $\mathcal{D}$ is a non-trivial $2$-$(k^{2},k,\lambda )$ design, with $\lambda \mid k$, and $G$ is a flag-transitive automorphism group of $\mathcal{D}$ of affine type such that $G \nleq A \Gamma…

We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations.…

Let $\mathfrak F$ be a class of groups. A group $G$ is called $ca$-$\mathfrak F$-group if its every non-abelian chief factor is simple and $H/K \leftthreetimes C_G(H/K) \in \mathfrak F$ for every abelian chief factor $H/K$ of $G$. In this…

Let K<x,y> be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K<x,y> are equivalent under an automorphism of…

For a class of groups $G$ over a field $\mathbb{F}$, including certain Lie groups, Algebraic groups and finite groups, we develop a general method to determine rational and real elements, thereby unifying earlier group-specific results into…