Results 121 to 130 of about 96,321 (254)
On the automorphism group of a cone
Linear Algebra and its Applications, 1978 AbstractLet V be a real finite dimensional vector space, and let C be a full cone in C. In Sec. 3 we show that the group of automorphisms of a compact convex subset of V is compact in the uniform topology, and relate the group of automorphisms of C to the group of automorphisms of a compact convex cross-section of C.
openaire +2 more sources
Automorphisms of the Unimodular Group [PDF]
Transactions of the American Mathematical Society, 1951 Loo-Keng Hua, Irving Reiner
openaire +1 more source
Covariant representations of C*-algebras and their locally compact automorphism groups [PDF]
, 1967 Masamichi Takesaki
openalex +1 more source
On Hadamard 2-(51,25,12) and 2-(59,29,14) designs
AIMS MathematicsIn this paper, we classified Hadamard $ 2 $-$ (51, 25, 12) $ designs having a non-abelian automorphism group of order 10, i.e., $ {\rm{Frob}}_{10} \cong Z_5:Z_2 $, where a subgroup isomorphic to $ Z_2 $ fixed setwise all the $ Z_5 $-orbits of the sets ...
Doris Dumičić Danilović, Andrea Švob
doaj +1 more source
Bounded Automorphisms of Groups
Journal of Algebra, 1994 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 +3 more sources
Some infinite classes of asymmetric nearly Hamiltonian snarks
Le Matematiche, 2010 We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one.
Carla Fiori, Beatrice Ruini
doaj