Related papers: Computing 3-Dimensional Groups : Crossed Squares a…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
The geometric and algebraic properties of Gray categories with duals are investigated by means of a diagrammatic calculus. The diagrams are three-dimensional stratifications of a cube, with regions, surfaces, lines and vertices labelled by…
Given a crossed module $\chi$, we introduce $\chi$-graded monoidal categories and $\chi$-fusion categories. We use spherical $\chi$-fusion categories to construct (via the state sum method) 3-dimensional Homotopy Quantum Field Theories with…
The quantum permutation group of the set $X_n=\{1,..., n\}$ corresponds to the Hopf algebra $A_{aut}(X_n)$. This is an algebra constructed with generators and relations, known to be isomorphic to $\cc (S_n)$ for $n\leq 3$, and to be…
We examine higher-form symmetries of quantum lattice gauge theories through the lens of homotopy theory and operator algebras. We show that in the operator-algebraic approach both higher-form symmetries and 't Hooft anomalies arise from…
Algebraic structures such as monoids, groups, and categories can be formulated within a category using commutative diagrams. In many common categories these reduce to familiar cases. In particular, group objects in Grp are abelian groups,…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We compare the structure of a mapping cone in the category Top^D of spaces under a space D with differentials in algebraic models like crossed complexes and quadratic complexes. Several subcategories of Top^D are identified with algebraic…
We generalize the notion of a crossed module of groups to that of a crossed module of racks. We investigate the relation to categorified racks, namely strict 2-racks, and trunk-like objects in the category of racks, generalizing the…
This paper has two tightly intertwined aims: (i) To introduce an intuitive and universal graphical calculus for multi-qubit systems, the ZX-calculus, which greatly simplifies derivations in the area of quantum computation and information.…
Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning…
Using the computer algebra program GAP, we show that all crystallographic groups in dimensions at most 4 are distinguished from each other by their sets of finite quotients.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
It is proved that the mapping class group of any closed surface with finitely many marked points is quasiisometric to a CAT(0) cube complex. We provide two distinct proofs, one tailored to mapping class groups, and one applying to a larger…
We give a description in terms of square matrices of the family of group-like algebras with $S*id=id*S=u\epsilon$. In the case that $S=id$ and $char\Bbbk$ is not 2 and does not divide the dimension of the algebra, this translation take us…
This is the second part of the paper. Results of the first part about crossed modules are applied here to study of quantum groups in braided categories. Correct cross product in the class of quantum braided groups is built. Criterion when…
InfoMod is a new software and application devoted to the modular group, PSL2(Z). It has algorithms that deals with the classical correspondences among continued fractions, geodesics on the modular surface and binary quadratic forms. In…
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…
A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…