نتایج جستجو برای: automorphism

تعداد نتایج: 5935  

2011
ALICE GARBAGNATI ALESSANDRA SARTI Wolf P. Barth Alessandra Sarti

In this paper we investigate when the generic member of a family of complex K3 surfaces admitting a non–symplectic automorphism of finite order admits also a symplectic automorphism of the same order. We give a complete answer to this question if the order of the automorphism is a prime number and we provide several examples and partial results otherwise. Moreover we prove that, under certain c...

Journal: :Australasian J. Combinatorics 2011
Josef Lauri Russell Mizzi Raffaele Scapellato

In this paper we shall present a natural generalisation of the notion of automorphism of a graph or digraph G, namely a two-fold automorphism. This is a pair (α, β) of permutations of the vertex set V(G) which acts on ordered pairs of vertices of G in the natural way. The action of (α, β) on all such ordered pairs gives a graph which is two-fold isomorphic to G. When α = β the two-fold automorp...

2010
THOMAS A. FOURNELLE T. A. FOURNELLE

Scmicomplctc nilpotcnt groups, that is, nilpotent groups with no outer automorphisms, have been of interest for many years. In this paper pscudocomplete nilpotent groups, that is, nilpotent groups in which the automorphism group and the inner automorphism group arc isomorphic (not equal), are constructed. When suitable conditions are placed on the pseudocomplete nilpotent group, the quotient of...

1995
E. T. Schmidt

The Independence Theorem for the congruence lattice and the auto-morphism group of a nite lattice was proved by V. A. Baranski and A. Urquhart. Both proofs utilize the characterization theorem of congruence lattices of nite lattices (as nite distributive lattices) and the characterization theorem of auto-morphism groups of nite lattices (as nite groups). In this paper, we introduce a new, stron...

1999
S. Barry Cooper Barry Cooper

It is shown that the complete Turing degrees do not form an automorphism base. A class A ⊆ the Turing degrees D is an automorphism base (see Lerman [1983]) if and only if any nontrivial automorphism of D necessarily moves at least one of its elements — or, equivalently, the global action of any such automorphism is completely determined by that on A . Jockusch and Posner [1981] demonstrated the...

Journal: :J. Logic & Analysis 2009
Itay Ben-Yaacov Alexander Berenstein

We prove that IHSA, the theory of infinite dimensional Hilbert spaces equipped with a generic automorphism, is א0-stable up to perturbation of the automorphism, and admits prime models up to perturbation over any set. Similarly, APrA, the theory of atomless probability algebras equipped with a generic automorphism is א0-stable up to perturbation. However, not allowing perturbation it is not eve...

2009
VLADIMIR TOLSTYKH

Baumslag conjectured in the 1970s that the automorphism tower of a finitely generated free group (free nilpotent group) must be very short. Dyer and Formanek [9] justified the conjecture concerning finitely generated free groups in the “sharpest sense” by proving that the automorphism group Aut(Fn) of a non-abelian free group Fn of finite rank n is complete. Recall that a group G is said to be ...

Journal: :Des. Codes Cryptography 2000
Ralph-Hardo Schulz Antonino Giorgio Spera

We show that the automorphism group of a divisible design D is isomorhic to a subgroup H of index 1 or 2 in the automorphism group Aut C(D) of the associated constant weight code. Only in very special cases, H is not the full automorphism group.

1997
LAJOS MOLNÁR

The aim of this paper is to show that the automorphism and isometry groups of the suspension of B(H), H being a separable infinite dimensional Hilbert space, are algebraically reflexive. This means that every local automorphism, respectively local surjective isometry of C0(R) ⊗ B(H) is an automorphism, respectively a surjective isometry.

Journal: :Australasian J. Combinatorics 2008
William D. Weakley

Denote the n × n toroidal queen’s graph by Qn. We find its automorphism group Aut(Qn) for each positive integer n, showing that for n ≥ 6, Aut(Qn) is generated by the translations, the group of the square, the homotheties, and (for odd n) the automorphism (x, y) → (y + x, y − x). For each n we find the automorphism classes of edges of Qn, in particular showing that for n > 1, Qn is edge-transit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید