Search arXivSearch

arXiv · 1501.00912

Free idempotent generated semigroups over bands

Abstract

Free idempotent generated semigroups IG$(E)$, where $E$ is a biordered set, have provided a focus of recent research, the majority of the efforts concentrating on the behaviour of the maximal subgroups. Inspired by an example of Brittenham, Margolis and Meakin, several proofs have been offered that any group occurs as a maximal subgroup of some IG$(E)$, the most recent being that of Dolinka and Ruškuc, who show that $E$ can be taken to be a band. From a result of Easdown, Sapir and Volkov, periodic elements of any IG$(E)$ lie in subgroups. However, little else is known of the `global' properties of IG$(E)$, other than that it need not be regular, even where $E$ is a semilattice. Since its introduction by Fountain in the late 1970s, the study of abundant and related semigroups has given rise to a deep and fruitful research area. The classes of abundant and adequate semigroups extend those of regular and inverse semigroups, respectively, and themselves are contained in the classes of weakly abundant and weakly adequate semigroups. Recent significant developments include the description by Kambites, using birooted labelled trees, of the free semigroups in the quasi-variety of adequate semigroups. Our main result shows that for any band $B$, the semigroup IG$(B)$ is a weakly abundant semigroup and moreover satisfies a natural condition called the congruence condition. We show that if $B$ is a band for which $uv=vu=v$ for all $u,v\in B$ with $BvB\subset BuB$ (a condition certainly satisfied for semilattices), then IG$(B)$ is abundant with solvable word problem. Further, IG$(B)$ is also abundant for a normal band $B$ for which IG$(B)$ satisfies a given technical condition, and we give examples of such $B$. On the other hand, we give an example of a normal band $B$ such that IG$(B)$ is not abundant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Dandan, Victoria Gould. 2015-01-05. Free idempotent generated semigroups over bands. https://arxiv.org/abs/1501.00912

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA