Related papers: On generation by triality automorphisms
In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…
We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show…
We present a solution to the Conjugacy Problem in the group of outer-automorphisms of $F_3$, a free group of rank 3. We distinguish according to several computable invariants, such as irreducibility, subgroups of polynomial growth, and…
The theory of representations of Clifford algebras is extended to employ the division algebra of the octonions or Cayley numbers. In particular, questions that arise from the non-associativity and non-commutativity of this division algebra…
We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…
By analogy with the definition of group with triality we introduce Lie algebra with triality as Lie algebra L wich admits the group of automorphisms S_3={s,r | s^2=r^3=1, srs=r^2} such that for any x\in L we have…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…
Let X be an irreducible smooth complex projective curve of genus g at least 4. Let M(r,\Lambda) be the moduli space of stable vector bundles over X or rank r and fixed determinant \Lambda, of degree d. We give a new proof of the fact that…
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…
The paper shows the existence of a family of directed strongly regular graphs with parameters (22, 9, 6, 3, 4). The adjacency matrices of the found digraphs are composed of $3\times 3$ circulant blocks. The automorphism group of all the…
The group of automorphisms of the Cuntz algebra $\mathcal{O}_{2}$ is a Polish group with respect to the topology of pointwise convergence in norm. Our main result is that the relations of conjugacy and cocycle conjugacy of automorphisms of…
It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.
We introduce a relation of block conjugacy for irreducible toral automorphism, and prove that block conjugacy is equivalent to weak equivalence of the ideals associated to the automorphisms. We characterize when block conjugate…
We develop a new class of random graph models for the statistical estimation of network formation -- subgraph generated models (SUGMs). Various subgraphs -- e.g., links, triangles, cliques, stars -- are generated and their union results in…
Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…
It is well known that every finite subgroup of automorphism group of polynomial algebra of rank 2 over the field of zero characteristic is conjugated with a subgroup of linear automorphisms. We prove that it is not true for an arbitrary…
We present an identification theorem for the groups $F_4(2)$ and $Aut(F_4(2))$ based on the structure of the centralizer of an element of order 3.