Results 241 to 250 of about 12,736,939 (290)
Some of the next articles are maybe not open access.

Automorphism Groups of Nilpotent Groups

Bulletin of the London Mathematical Society, 1989
Let \({\mathfrak X}\) denote the class of all finitely generated torsion-free nilpotent groups G such that the derived factor group G/G' is torsion- free. For G in \({\mathfrak X}\), let Aut *(G) denote the group of automorphisms of G/G' induced by the automorphism group of G. If G/G' has rank n and we choose a \({\mathbb{Z}}\)-basis for G/G' then Aut *
Bryant, R. M., Papistas, A.
openaire   +3 more sources

The automorphism group of the bipartite Kneser graph

Proceedings - Mathematical Sciences, 2018
Let n and k be integers with n>2k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin ...
S. Mirafzal
semanticscholar   +1 more source

IMPRIMITIVE AUTOMORPHISM GROUPS

The Quarterly Journal of Mathematics, 1992
Let \(G\) be a permutation group on a countably infinite set \(\Omega\), and for every positive integer \(k\) let \(n_ k\) denote the number of orbits under the action of \(G\) on subsets of order \(k\) of \(\Omega\). It was proved by \textit{P. J. Cameron} [Math. Z. 148, 127-139 (1976; Zbl 0313.20022)] that the sequence \((n_ k)_{k\in \mathbb{N}}\) is
openaire   +1 more source

Automorphism group of the complete transposition graph

, 2014
The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group $$S_n$$Sn, and two vertices $$\alpha $$α and $$\beta $$β are adjacent in this graph iff there is some transposition (i, j) such that ...
Ashwin Ganesan
semanticscholar   +1 more source

The Automorphism Group of the Hilbert Scheme of Two Points on a Generic Projective K3 Surface

, 2014
We determine the automorphism group of the Hilbert scheme of two points on a generic projective K3 surface of any polarization. We obtain in particular new examples of Hilbert schemes of points having non-natural non-symplectic automorphisms.
Samuel Boissière   +3 more
semanticscholar   +1 more source

Noetherian Automorphisms of Groups

Mediterranean Journal of Mathematics, 2005
An automorphism α of a group G is called a noetherian automorphism if for each ascending chain $$ X_1 < X_2 < \ldots < X_n < X_{n + 1} < \ldots $$ of subgroups of G there is a positive integer m such that \(X_n^{\alpha} = X_n \) for all n ≥ m. The structure of the group of all noetherian automorphisms of a group is investigated in this paper.
DE GIOVANNI, FRANCESCO, DE MARI, FAUSTO
openaire   +2 more sources

Small Groups of Automorphisms

Bulletin of the London Mathematical Society, 1998
Let \(A\) be a group of automorphisms of the finite group \(G\) such that \((|A|,|G|)=1\). The authors prove that \(|A|0\), groups \(G\) and \(A\leq\Aut(G)\) can be found such that \((|A|,|G|)=1\) and \(|A|>|G|^{2-\varepsilon}\). Furthermore, if \(A\) is nilpotent of class at most 2, then \(|A|
Pálfy, P. P., Pyber, L.
openaire   +1 more source

On orbits of the automorphism group on a complete toric variety

, 2011
Let X be a complete toric variety and Aut(X) be the automorphism group. We give an explit description of Aut(X)-orbits on X. In particular, we show that Aut(X) acts on X transitively if and only if X is a product of projective spaces.
Ivan Bazhov
semanticscholar   +1 more source

Half-Transitive Automorphism Groups

Canadian Journal of Mathematics, 1966
Let G be a finite group and A a group of automorphisms of G. Clearly A acts as a permutation group on G#, the set of non-identity elements of G. We assume that this permutation representation is half transitive, that is all the orbits have the same size. A special case of this occurs when A acts fixed point free on G.
Isaacs, I. M., Passman, D. S.
openaire   +1 more source

Automorphisms of Metabelian Groups

Canadian Mathematical Bulletin, 1998
AbstractWe investigate the problem of determining when IA(Fn(AmA)) is finitely generated for all n and m, with n ≥ 2 and m ≠ 1. If m is a nonsquare free integer then IA(Fn(AmA)) is not finitely generated for all n and if m is a square free integer then IA(Fn(AmA)) is finitely generated for all n, with n ≠ 3, and IA(F3(AmA)) is not finitely generated ...
openaire   +1 more source

Home - About - Disclaimer - Privacy