Related papers: Identities in Brandt semigroups, revisited

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

The content of this preprint together with additional material appears now in 0706.2154.

The purpose of this note is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup S(t), following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the norm…

The recent proof of the Boij-Soederberg conjectures reveals new structure about Betti diagrams of modules, giving a complete description of the cone of Betti diagrams. We begin to expand on this new structure by investigating the semigroup…

This paper contains a complete proof of a fundamental theorem on the normalizers of unipotent subgroups in semisimple algebraic groups.

In this note, we introduce a new concept of a {\it generalized algebraic rational identity} to investigate the structure of division rings. The main theorem asserts that if a non-central subnormal subgroup $N$ of the multiplicative group…

In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.

We consider semigroup algorithmic problems in the wreath product $\mathbb{Z} \wr \mathbb{Z}$. Our paper focuses on two decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain the…

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.

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…

We give a simplified proof of Tits' classification of semisimple algebraic groups that remains valid over semilocal rings. In particular, we provide explicit necessary and sufficient conditions that anisotropic groups of a given type appear…

To solve two problems of Bergman stated in 1981, we construct a group $G$ such that $G$ contains a free noncyclic subgroup (hence, $G$ satisfies no group identity) and $G$, as a group, is generated by its subsemigroup that satisfies a…

In this paper we study semigroups satisfying the identity $aba=ab$.

In this paper we explicitly compute finite bases of disjunctive identities and finite bases of regular representations for a number of interesting finite groups.

In the paper we study (countably) compact and (absolutely) $H$-closed primitive topological inverse semigroups. We describe the structure of compact and countably compact primitive topological inverse semigroups and show that any countably…

We show that a topological semigroup of finite partial bijections $\mathscr{I}_\lambda^n$ of an infinite set with a compact subsemigroup of idempotents is absolutely $H$-closed and any countably compact topological semigroup does not…

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

We exhibit a simple condition under which a finite involutary semigroup whose semigroup reduct is inherently nonfinitely based is also inherently nonfinitely based as a unary semigroup. As applications, we get already known as well as new…