There is a large collection of e ective algorithms for computing information about nite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an e ective algorithm for computing the automorphism grou...

We investigate the complexity of partial order relation Young's lattice. The definable relations are characterized by establishing maximal definability property modulo single automorphism given conjugation; consequently, as an ordered set lattice has undecidable elementary theory and is non-finitely axiomatizable but every ideal generates a finitely universal class equivalence relations. show p...

Abstract We consider the only one known class of non-Kähler irreducible holomorphic symplectic manifolds, described in works by D. Guan and 1st author. Any such manifold $Q$ dimension $2n-2$ is obtained as a finite degree $n^2$ cover some $W_F$, which we call base $Q$. show that algebraic reduction its projective space $n-1$. Besides, give partial classification submanifolds $Q$, describe degen...

Generalized conjugation is the action of a group on its underlying set given by (g, x) 7→ φ(g)xg, where φ : G → G is some fixed endomorphism. Here we study combinatorial properties of the sizes of the orbits of the preceding action. In particular, we reduce the problem to a simpler case if φ has a nontrivial kernel or if it is an inner automorphism, and we give a construction that allows a part...

The question of extendability of the action of a cyclic group of automorphisms of a compact Riemann surface is considered. Particular attention is paid to those cases corresponding to Singerman's list of Fuchsian groups which are not nitely-maximal, and more generally to cases involving a Fuchsian triangle group. The results provide partial answers to the question of which cyclic groups are the...

Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank ...

It is shown that the linear group of automorphism of Hermitian matrices which preserves the tensor product of unitary orbits is generated by natural automorphisms: change of an orthonormal basis in each tensor factor, partial transpose in each tensor factor, and interchanging two tensor factors of the same dimension. The result is then applied to show that automorphisms of the product numerical...

AbstractLet W be a non-empty subset of a free group. The automorphism of a group G is said to be a marginal automorphism, if for all x in G,x^−1alpha(x) in W^*(G), where W^*(G) is the marginal subgroup of G.In this paper, we give necessary and sufficient condition for a purelynon-abelian p-group G, such that the set of all marginal automorphismsof G forms an elementary abelian p-group.

abstractlet w be a non-empty subset of a free group. the automorphism of a group g is said to be a marginal automorphism, if for all x in g,x^−1alpha(x) in w^*(g), where w^*(g) is the marginal subgroup of g.in this paper, we give necessary and sufficient condition for a purelynon-abelian p-group g, such that the set of all marginal automorphismsof g forms an elementary abelian p-group.

let $gamma$ be a normal subgroup of the full automorphism group $aut(g)$ of a group $g$‎, ‎and assume that $inn(g)leq gamma$‎. ‎an endomorphism $sigma$ of $g$ is said to be {it $gamma$-central} if $sigma$ induces the the identity on the factor group $g/c_g(gamma)$‎. ‎clearly‎, ‎if $gamma=inn(g)$‎, ‎then a $gamma$-central endomorphism is a {it central} endomorphism‎. ‎in this article the conditi...