In this paper we develop the theory of polymorphisms of measure spaces, which is a generalization of the theory of measure-preserving transformations. We describe the main notions and discuss relations to the theory of Markov processes, operator theory, ergodic theory, etc. We formulate the important notion of quasi-similarity and consider quasi-similarity between polymorphisms and automorphism...

‎motivated by a celebrated theorem of schur‎, ‎we show that if~$gamma$ is a normal subgroup of the full automorphism group $aut(g)$ of a group $g$ such that $inn(g)$ is contained in $gamma$ and $aut(g)/gamma$ has no uncountable abelian subgroups of prime exponent‎, ‎then $[g,gamma]$ is finite‎, ‎provided that the subgroup consisting of all elements of $g$ fixed by $gamma$ has finite index‎. ‎so...

In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...

let d be a symmetric 2-(121, 16, 2) design with the automorphism group of aut(d). in this paper the order of automorphism of prime order of aut(d) is studied, and some results are obtained about the number of fixed points of these automorphisms. also we will show that |aut(d)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. in addition we prese...

Interval graphs are intersection graphs of closed intervals and circle graphs are intersection graphs of chords of a circle. We study automorphism groups of these graphs. We show that interval graphs have the same automorphism groups as trees, and circle graphs have the same as pseudoforests, which are graphs with at most one cycle in every connected component. Our technique determines automorp...

In this paper an algorithm is presented that can be used to calculate the automorphism group of a finite transformation semigroup. The general algorithm employs a special method to compute the automorphism group of a finite simple semigroup. As an application of the algorithm, all the automorphism groups of semigroup of order at most 7 and of the multiplicative semigroups of some group rings ar...

Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an n-geometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2and 3-geometric a...