相关论文: The q-theory of finite semigroups: history and mat…

In this paper, we summarize the work on the characterization of finite simple groups and the study on finite groups with the set of element orders and two orders (the order of group and the set of element orders). Some related topics, and…

Rational semigroups were introduced by Hinkkanen and Martin as a generalization of the iteration of a single rational map. There has subsequently been much interest in the study of rational semigroups. Quasiregular semigroups were…

This is an account of the theory of inverse semigroups, assuming only that the reader knows the basics of semigroup theory.

In the 1940's Graham Higman initiated the study of finite subgroups of the unit group of an integral group ring. Since then many fascinating aspects of this structure have been discovered. Major questions such as the Isomorphism Problem and…

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

We determine many of the atoms of the algebraic lattices arising in $\mathfrak{q}$-theory of finite semigroups.

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

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…

Primitive representations of finite groups as well as primitive finite groups were classified in the O'Nan-Scott Theorem. In this paper we classify faithful finite primitive semigroup representations. To each finite primitive…

It is known from work by H. Abels and P. Abramenko that for a classical Fq-group G of rank n the arithemetic lattice G(Fq[t]) of Fq[t]-rational points is of type Fn-1 provided that q is large enough. We show that the statement is true…

This is a survey article on the theory of finite complex reflection groups. No proofs are given but numerous references are included.

This is the third and last of three papers containing the complete proof that all finitely presented groups are QSF.

These notes are devoted to lattices in products of trees and related topics. They provide an introduction to the construction, by M. Burger and S. Mozes, of examples of such lattices that are simple as abstract groups. Two features of that…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

PhD thesis concerning cohomological finiteness conditions of infinite discrete groups. Much of the material in this thesis has also appeared in arXiv:1311.7629, arXiv:1310.6262, arXiv:1311.6156, and arXiv:1207.1597.

In this paper we obtain some noncommutative multiplier theorems and maximal inequalities on semigroups. As applications, we obtain the corresponding individual ergodic theorems. Our main results extend some classical results of Stein and…

We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

I explicitly compute the Eilenberg-Mac Lane homology of a completely simple semigroup using topological means. I also complete Gray and Pride's investigation into the homological finiteness properties of completely simple semigroups, as…

The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal…