Related papers: Finite regular semigroups with permutations that m…
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…
We study the universal groups of inverse semigroups associated with point sets and with tilings. We focus our attention on two classes of examples. The first class consists of point sets which are obtained by a cut and projection scheme…
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…
We study generalized inverses on semigroups by means of Green's relations. We first define the notion of inverse along an element and study its properties. Then we show that the classical generalized inverses (group inverse, Drazin inverse…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
In a semiprime ring, von Neumann regular elements are determined by their inner inverses. In particular, for elements $a,b$ of a von Neumann regular ring $R$, $a=b$ if and only if $I(a)=I(b)$, where $I(x)$ denotes the set of inner inverses…
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are…
This paper continues the study of Fourier transforms on finite inverse semigroups, with a focus on Fourier inversion theorems and FFTs for new classes of inverse semigroups. We begin by introducing four inverse semigroup generalizations of…
Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the…
In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
We survey a research program on the strong convergence of unitary and permutation representations of discrete groups. We also take the opportunity to flesh out details that have not appeared elsewhere.
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
This is an account of the theory of inverse semigroups, assuming only that the reader knows the basics of semigroup theory.