Related papers: Presentations on standard generators for classical…
This paper is concerned with integrals which integrands are the monomials of matrix elements of irreducible representations of classical groups. Based on analysis on Young tableaux, we discuss some related duality theorems and compute the…
We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
We study the properties of groups that have presentations in which the square of each generator gives the identity and all relations are of even length. We consider the parabolic subgroups of such a group and show that every element has a…
The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…
The paper gives two approaches to write explicit presentations for the class of Dehn quandles using presentations of their underlying groups. The first approach gives finite presentations for Dehn quandles of a class of Garside groups and…
We exhibit a family of metrizable manifolds such that any finite group appears as the fundamental group of one of them. These spaces are especially interesting as they can be easily visualized, as opposed to classical examples of spaces…
We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
A diverse collection of fusion categories may be realized by the representation theory of quantum groups. There is substantial literature where one will find detailed constructions of quantum groups, and proofs of the…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
We consider a generalization of representations of quivers that can be derived from the ordinary representations of quivers by considering a product of arbitrary classical groups instead of a product of the general linear groups and by…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
We give a presentation of the plane Cremona group over an algebraically closed field with respect to the generators given by the Theorem of Noether and Castelnuovo. This presentation is particularly simple and can be used for explicit…
We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.
We study the class of idempotent-generated pseudo-composition algebras, which is a subclass of the family of axial algebras. More specifically, we utilise the group-algebra correspondence, natural to the axial framework in order to study…
We give a presentation of cyclotomic q-Schur algebras by generators and defining relations. As an application, we give an algorithm for computing decomposition numbers of cyclotomic q-Schur algebras.
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…