Related papers: Minimum transformation representations of diagram …

Aiming at a complete classification of unitary N=2 minimal models (where the assumption of space-time supersymmetry has been dropped), it is shown that each modular invariant candidate of a partition function for such a theory is indeed the…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups,…

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

We prove that, over any field, the dimension of the indeterminacy locus of a rational transformation $f$ of $P^n$ which is defined by monomials of the same degree $d$ with no common factors is at least $(n-2)/2$, provided that the degree of…

We define a class of monoidal categories whose morphisms are diagrams, and which are enhancements and generalisations of the Brauer category obtained by adjoining infinitesimal braids, "coupons" and poles. Properties of these categories are…

Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…

We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented)…

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term…

For a finite group G, we denote by $\mu(G)$, and c(G), the minimal degree of faithful permutation representation of G, and the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C,…

In this thesis we study the following property of a finite group G: the minimal number n such that G embeds in Sn. We start with an explicit formula for the number n for abelian groups. Then, we study the behavior of this group property in…

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

The minimal faithful permutation degree of a finite group $G$, denote by $\mu(G)$ is the least non-negative integer $n$ such that $G$ embeds inside the symmetric group $\Sym(n)$. In this paper, we outline a Magma proof that 10 is the…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…