Related papers: Partial transformation monoids preserving a unifor…
The original purpose of component-based development was to provide techniques to master complex software, through composition, reuse and parametrisation. However, such systems are rapidly moving towards a level in which software becomes…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…
We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…
We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion…
We provide a compilation of metallic systems in which a low-temperature ferromagnetic or similar transition is observed. Our objective is to demonstrate the universal first-order nature of such transitions in clean systems in two or three…
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…
In this paper, we consider the inverse submonoids $AM_n$ of monotone transformations and $AO_n$ of order-preserving transformations of the alternating inverse monoid $AI_n$ on a chain with $n$ elements. We compute the cardinalities,…
We study the representation theory of the increasing monoid. Our results provide a fairly comprehensive picture of the representation category: for example, we describe the Grothendieck group (including the effective cone), classify…
In this article, when G is a locally compact quantum group, we associate to a braided-commutative G-Yetter-Drinfel'd algebra $(N,a,\hat{a})$ equipped with a normal faithful semi-finite weight verifying some appropriate condition, a…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We first motivate the study of a certain quotient of the loop braid category, both for the mathematics underpinning recent approaches to topological quantum computation; and as a key example in non-semisimple higher representation theory.…
We study the partial Brauer monoid and its planar submonoid, the Motzkin monoid. We conduct a thorough investigation of the structure of both monoids, providing information on normal forms, Green's relations, regularity, ideals, idempotent…
We study centrality of morphisms in a setting derived from that of a pointed category in which binary products commute with coequalisers. The main results of this paper show that much of the behaviour of central morphisms for unital…
Monoids and groupoids are examples of poloids. On the one hand, poloids can be regarded as one-sorted categories; on the other hand, poloids can be represented by partial magmas of partial transformations. In this article, poloids are…
Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as equations. A finite rule set is most informative when it…
We compute the representation theory of two families of noncrossing partition quantum groups connected to amalgamated free products and free wreath products. This illustrates the efficiency of the methods developed in our previous joint…