Related papers: Construction of long root SL(2,q)-subgroups in bla…

In earlier work, Katz exhibited some very simple one parameter families of exponential sums which gave rigid local systems on the affine line in characteristic p whose geometric (and usually, arithmetic) monodromy groups were SL(2,q), and…

The quantum group SL_q(2,R) at roots of unity is introduced by means of duality pairings with the quantum algebra U_q(sl(2,R)). Its irreducible representations are constructed through the universal T-matrix. An invariant integral on this…

We present the subalgebra structure of sl(3,O), a particular real form of e6 chosen for its relevance to particle physics and its close relation to generalized Lorentz groups. We use an explicit representation of the Lie group SL(3,O) to…

A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…

Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…

We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of…

We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…

We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree <q, has a root in F_q. A corollary of our method --- the first with complexity sub-linear…

Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…

This paper is a continuation of [5]. Using the root categories, we define the compact real forms of the complex semisimple Lie algebras, and maximal compact subgroups of the Chevalley groups over $\mathbb{C}$. In [7], Lusztig used the…

A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from \fun\ to \uqg\ , given by elements of the pure braid group. These operators --- the `reflection matrix' $Y \equiv…

As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with…

Let $X$ be a Hausdorff compact space and $C(X)$ be the algebra of all continuous complex-valued functions on $X$, endowed with the supremum norm. We say that $C(X)$ is (approximately) $n$-th root closed if any function from $C(X)$ is…

We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…

A classification of weakly compact multiplication operators on L(L_p), $1<p<\infty$, is given. This answers a question raised by Saksman and Tylli in 1992. The classification involves the concept of $\ell_p$-strictly singular operators, and…

Using the fact that Hopf-Galois structures on separable extensions and skew bracoids are both intrinsically connected to transitive subgroups of the holomorph of a finite group, we present algorithms to classify and enumerate these objects…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

For the two-parameter matrix quantum group GLp,q(2) all bicovariant differential calculi (with a four-dimensional space of 1-forms) are known. They form a one-parameter family. Here, we give an improved presentation of previous results by…

Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G must be determined from a quantum state y uniformly supported…

Let $K$ be a non-archimedean local field with residue field of characteristic $p$. We give necessary and sufficient conditions for a two-generator subgroup $G$ of ${\rm PSL_2}(K)$ to be discrete, where either $K=\mathbb{Q}_p$ or $G$…