Related papers: Intermediate Semigroups are Groups
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…
We study self-adjoint semigroups of partial isometries on a Hilbert space. These semigroups coincide precisely with faithful representations of abstract inverse semigroups. Groups of unitary operators are specialized examples of…
The full lattices in a finite dimensional commutative ${\mathbb Q}$-algebra form a commutative semigroup. In the case of an algebraic number field the top part of a certain quotient semigroup is the class group. For a separable algebra some…
In this paper we give a small review of some recent results of elementary equivalence of linear and algebraic groups and our last new results of elementary equivalence of categories of modules, endomorphism rings of modules, lattices of…
Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and $T_n(\mathbb{K})$ be the set of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups that are generated by $n+1$…
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
In this paper we define some ballean structure on the power set of a group and, in particular, we study the subballean with support the lattice of all its subgroups. If $G$ is a group, we denote by $L(G)$ the family of all subgroups of $G$.…
Every semigroup containing an ideal subgroup is called a homogroup, and it is a grouplike if and only if it has only one central idempotent. On the other hand, a class of algebraic structures covering group-$e$-semigroups…
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.
We consider the lattice of supercharacter theories, in the sense of Diaconis and Isaacs, of the cyclic group of order n. We find necessary and sufficient conditions on n for that lattice to be upper or lower semimodular.
Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…