Related papers: Minimum transformation representations of diagram …

We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…

We study representations of diagram categories by binary relations and matrices over rings and semirings. Our main result is a faithful involutive tensor representation of the partition category $P$ (and consequently of each partition…

We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…

The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…

In this paper we compute the minimum degree of a faithful representation by partial transformations of a finite semigroup admitting a faithful completely reducible matrix representation over the field of complex numbers. This includes all…

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…

Classical diagram categories and monoids, including the Temperley--Lieb, Brauer, and partition cases, arise as special instances of the category of two dimensional cobordisms and admit additional twists that produce a large new family of…

The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial…

We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb,…

We introduce and study several affine (=annular in this paper) versions of the classical diagram algebras such as Temperley-Lieb, partition, Brauer, Motzkin, rook Brauer, rook, planar partition, and planar rook algebras. We give generators…

By the theorems of Cayley and Vagner-Preston, the full transformation monoids and the symmetric inverse monoids play analogous roles in the theory of monoids and inverse monoids, as the symmetric groups do in the theory of groups. Every…

In this article we calculate the minimal faithful permutation degree for all of the irreducible Coxeter groups. We also exhibit new examples of finite groups that possess a quotient whose minimal degree is strictly greater than that of the…

We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…

We determine the minimal degree of a faithful permutation representation for each group of order $p^6$ where $p$ is an odd prime. We also record how to obtain such a representation.

The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters $m, k \in \mathbb{Z}_{>0}$, which has simultaneously and independently generated interest from other researchers as…

The linear decomposition attack provides a serious obstacle to direct applications of noncommutative groups and monoids (or semigroups) in cryptography. To overcome this issue we propose to look at monoids with only big representations, in…

L. Babai has shown that a faithful permutation representation of a nonsplit extension of a group by an alternating group $A_k$ must have degree at least $k^2(\frac{1}{2}-o(1))$, and has asked how sharp this lower bound is. We prove that…