Related papers: Computing 3-Dimensional Groups : Crossed Squares a…
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the line that passes through the point and…
In this paper we investigate the higher dimensional divergence functions of mapping class groups of surfaces and of CAT(0)--groups. We show that, for mapping class groups of surfaces, these functions exhibit phase transitions at the rank…
We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of group schemes and are in correspondence with graded Hopf algebra. In this setting, graded group varieties…
Group equivariant neural networks have proven effective in modelling a wide range of tasks where the data lives in a classical geometric space and exhibits well-defined group symmetries. However, these networks are not suitable for learning…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Let $H$ be a Hopf algebra in braided category $\cal C$. Crossed modules over $H$ are objects with both module and comodule structures satisfying some comatibility condition. Category ${\cal C}^H_H$ of crossed modules is braided and is…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This is a contribution to the project of quiver approaches to quasi-quantum groups initiated in arXiv:0902.1620. We classify Majid bimodules over groups with 3-cocycles by virtue of projective representations. This leads to a theoretic…
We firstly prove the completeness of the category of crossed modules in a modified category of interest. Afterwards, we define pullback crossed modules and pullback cat$^1$-objects that are both obtained by pullback diagrams with extra…
We determine the precise number of isomorphism classes of elliptic curves over $\mathbb{F}_q(t)$ with $\text{char}(\mathbb{F}_q) = 3,2$. The key idea is to obtain the exact unweighted number of rational points on the classifying stacks…
A complete list of Uq(sl2)-module algebra structures on the quantum plane is produced and the (uncountable family of) isomorphism classes of these structures are described. The composition series of representations in question are computed.…
In this paper the number of isomorphism classes of the right transversals of the symmetric group $\Sigma_{n-1}$ in the symmetric group $\Sigma_n$ is calculated. This result together with the techniques employed along the paper may be used…
We introduce the first work on benchmarking and evaluating deep clustering algorithms on large-scale non-categorical 3D CAD models. We first propose a workflow to allow expert mechanical engineers to efficiently annotate 252,648 carefully…
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ groups, and show their equivalence. In the process, we obtain an…
The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group…
This article is dedicated to the computation of an explicit presentation of some asymptotically rigid mapping class groups, namely the braided Higman-Thompson groups. To do so, we use the action of these groups on the spine complex, a…
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP