Computing Transformation Semigroups
نویسندگان
چکیده
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been implemented in the share package MONOID within the GAP system for computational algebra.
منابع مشابه
UNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS
We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.
متن کاملTRANSFORMATION SEMIGROUPS AND TRANSFORMED DIMENSIONS
In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.
متن کاملOn certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
متن کاملComputing finite semigroups
Using a variant of Schreier’s Theorem, and the theory of Green’s relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids...
متن کاملComputing automorphisms of semigroups
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 33 شماره
صفحات -
تاریخ انتشار 2002