Membership of A ∨ G for classes of finite weakly abundant semigroups

نویسندگان

  • John Fountain
  • Gracinda M. S. Gomes
  • Victoria Gould
چکیده

We consider the question of membership of A ∨ G, where A and G are the pseudovarieties of finite aperiodic semigroups, and finite groups, respectively. We find a straightforward criterion for a semigroup S lying in a class of finite semigroups that are weakly abundant, to be in A ∨ G. The class of weakly abundant semigroups contains the class of regular semigroups, but is much more extensive; we remark that any finite monoid with semilattice of idempotents is weakly abundant. To study such semigroups we develop a number of techniques that may be of interest in their own right.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpreting Graph Colorability in Finite Semigroups

We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.

متن کامل

On weakly $mathfrak{F}_{s}$-quasinormal subgroups of finite groups

Let $mathfrak{F}$ be a formation and $G$ a finite group. A subgroup $H$ of $G$ is said to be weakly $mathfrak{F}_{s}$-quasinormal in $G$ if $G$ has an $S$-quasinormal subgroup $T$ such that $HT$ is $S$-quasinormal in $G$ and $(Hcap T)H_{G}/H_{G}leq Z_{mathfrak{F}}(G/H_{G})$, where $Z_{mathfrak{F}}(G/H_{G})$ denotes the $mathfrak{F}$-hypercenter of $G/H_{G}$. In this paper, we study the structur...

متن کامل

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...

متن کامل

FINITE GROUPS WITH FIVE NON-CENTRAL CONJUGACY CLASSES

‎Let G be a finite group and Z(G) be the center of G‎. ‎For a subset A of G‎, ‎we define kG(A)‎, ‎the number of conjugacy classes of G that intersect A non-trivially‎. ‎In this paper‎, ‎we verify the structure of all finite groups G which satisfy the property kG(G-Z(G))=5, and classify them‎.

متن کامل

On the Regular Power Graph on the Conjugacy Classes of Finite Groups

emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Periodica Mathematica Hungarica

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2009