Related papers: An L2-quotient algorithm for finitely presented gr…
We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…
A multi-shell generalization of a fermion representation of the q-deformed compact symplectic sp_q(4) algebra is introduced. An analytic form for the action of two or more generators of the Sp_q(4) symmetry on the basis states is determined…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.
Suppose $4|n$, $n\geq 8$, $F=F_n=\mathbb{Q}(\zeta_n+\bar{\zeta}_n)$, and there is one prime $\mathfrak{p}=\mathfrak{p}_n$ above $2$ in $F_n$. We study amalgam presentations for $\operatorname{PU_{2}}(\mathbb{Z}[\zeta_n, 1/2])$ and…
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…
We prove that the Lie algebra $\mathfrak{sl}_n(\textbf{F}_q)$ of traceless matrices over a finite field of characteristic $p$ can be generated by $2$ elements with exceptions when $(n, p)$ is $(3, 3)$ or $(4,2)$. In the latter cases, we…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…
An explicit form of the generators of quantum and ordinary semisimple algebras for an arbitrary finite-dimensional representation is found. The generators corresponding to the simple roots are obtained in terms of a solution of a system of…
Using the Fronsdal-Galindo formula for the exponential mapping from the quantum algebra $U_{p,q}(gl(2))$ to the quantum group $GL_{p,q}(2)$, we show how the $(2j+1)$-dimensional representations of $GL_{p,q}(2)$ can be obtained by…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
In this work, we study multiplicity-free induced representations of finite groups. We analyze in great detail the structure of the Hecke algebra corresponding to the commutant of an induced representation and then specialize to the…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
Letting $G=F/R$ be a finitely-presented group, Hopf's formula expresses the second integral homology of $G$ in terms of $F$ and $R$. Expanding on previous work, we explain how to find generators of $H_2(G;\mathbb{F}_p)$. The context of the…