Results 91 to 100 of about 76,450 (196)
An exceptional G(2) extension of the Standard Model from the correspondence with Cayley-Dickson algebras automorphism groups. [PDF]
Masi N.
europepmc +1 more source
Groups with Anomalous Automorphisms
Let \(G\) be a group. The set \(\Aut_{nn}G\) of all automorphisms of \(G\) fixing every non-normal subgroup of \(G\) is a normal subgroup of the full automorphism group \(\Aut G\) of \(G\). Of course, \(\Aut_{nn}G\) contains the group \(P\Aut G\) of all power automorphisms of \(G\), and the structure of groups \(G\) such that \(P\Aut G\neq\Aut_{nn}G ...
Brandl, Rolf, Verardi, Libero
openaire +2 more sources
Finite Vertex Bi-Primitive 2-Arc Transitive Graphs Admitting a Two-Dimensional Linear Group
A graph is said to be vertex bi-primitive, if it is a bipartite graph, and the setwise stabilizer of its automorphism group acts primitively on two bi-parts.
Xiaohui Hua
doaj +1 more source
Bounded Automorphisms of Groups
Let \(G\) be the fundamental group of a graph of groups (in the sense of Bass-Serre theory). Such a group has a natural length function and thus a corresponding notion of bounded subgroups and bounded automorphisms. The general result of this paper is that an automorphism of \(G\) is bounded if and only if it is induced by isomorphisms of vertex groups
openaire +2 more sources
A note on one-parameter groups of automorphisms
Let {αt:t∈R} and {βt:t∈R} be two commuting one-parameter groups of ∗-automorphisms of a von Neumann algebra M such that αt+α−t=βt+β−t for all t∈R. The purpose of this note is to provide a simple and short proof of the central decomposition result: αt=βt ...
A. B. Thaheem, Noor Mohammad
doaj +1 more source
Automorphisms of solvable groups [PDF]
It is important to note that in both these statements only the existence of integers t(p, n) and m(p) is claimed. The only specific information known is that in(2) =2, m (3) =2, and mi(5) = 3 (see [1 ]) . Even upper bounds for the values of t(p, n) and m(p) are not known to us.
openaire +1 more source
Given a graph \(\Gamma=(V,E)\), the graph group \(F\langle\Gamma\rangle\) is the group with presentation \(\langle V\mid [E]\rangle\), where \([E]\) denotes the set of commutators \(\{[a,b]\mid\{a,b\}\in E\}\). The graph group \(F\langle\Gamma\rangle\) is modeled to be a group analog of the graph algebra K(\(\Gamma)\) generated as a free associative ...
openaire +2 more sources
Automorphisms of the Dihedral Groups [PDF]
Not ...
openaire +3 more sources
Automorphic group representations [PDF]
openaire +2 more sources
Upper bounds of orders of automorphism groups of leafless metric graphs
We prove a tropical analogue of the theorem of Hurwitz: A leafless metric graph of genus [Formula: see text] has at most 12 automorphisms when g = 2 and [Formula: see text] automorphisms when [Formula: see text].
Yusuke Nakamura, JuAe Song
doaj +1 more source

