Related papers: Efficient Description of some Classes of Codes usi…
Primary Cyclic matrices were used (but not named) by Holt and Rees in their version of Parker's MEAT-AXE algorithm to test irreducibility of finite matrix groups and algebras. They are matrices $X$ with at least one cyclic component in the…
S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if $G$ is a nontrivial finite group which is…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism from FG to Fn which maps G to the standard basis of Fn. Many classical linear codes have been shown to be group…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…
This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…
Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…
Given a Hecke symmetry $R$, one can define a matrix bialgebra $E_R$ and a matrix Hopf algebra $H_R$, which are called function rings on the matrix quantum semi-group and matrix quantum groups associated to $R$. We show that for an even…
For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to…
A shelf is a set with a binary operation~$\op$ satisfying $a \op (b \op c) = (a \op b) \op (a \op c)$. Racks are shelves with invertible translations $b \mapsto a \op b$; many of their aspects, including cohomological, are better understood…
We equip the categorified quantum group attached to a KLR algebra and an arbitrary choice of scalars with duality functor which is cyclic, that is, such that f=f^** for all 2-morphisms f. This is accomplished via a modified diagrammatic…
This article introduces a novel cryptographic paradigm based on nonderived polyadic algebraic structures. Traditional cryptosystems rely on binary operations within groups, rings, or fields, whose well-understood properties can be exploited…
We generalize to the super context, the known fact that if an affine algebraic group $G$ over a commutative ring $k$ acts freely (in an appropriate sense) on an affine scheme $X$ over $k$, then the dur sheaf $X\tilde{\tilde{/}}G$ of…
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all…
Given a collection $\{ G_i\}_{i=1}^d$ of finite groups and a ring $R$, we define a subring of the ring $M_n(R)$ ($n = \sum_{i=1}^d|G_i|)$ that encompasses all the individual group rings $R[G_i]$ along the diagonal blocks as $G_i$-circulant…
Quantum affine reflection algebras are coideal subalgebras of quantum affine algebras that lead to trigonometric reflection matrices (solutions of the boundary Yang-Baxter equation). In this paper we use the quantum affine reflection…
The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…