Related papers: Root Extraction in Finite Abelian Groups

The universal R-matrices and, dually, the coquasitriangular structures of the group Hopf algebra of a finite Abelian group (resp. of an arbitrary Abelian group) are determined. This is used to formulate graded multilinear algebra in terms…

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

This expository article introduces the topic of roots in a compact Lie group. Compared to the many other treatments of this standard topic, I intended for mine to be relatively elementary, example-driven, and free of unnecessary…

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous…

This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…

By defining the classes of generalized co-Hopfian and relatively co-Hopfian groups, respectively, we consider two expanded versions of the generalized co-Bassian groups and of the classical co-Hopfian groups giving a close relationship with…

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…

Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…

The interaction of a Lie algebra $\LL,$ having a weight space decomposition with respect to a nonzero toral subalgebra, with its corresponding root system forms a powerful tool in the study of the structure of $\LL.$ This, in particular,…

We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…

We introduce a notion of a group-partition for a finite Abelian group, which is a generalized notion of the standard partition. To obtain asymptoticdistributions of group-partition, we study the Dirichlet series for group-partitions by…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…

This paper targets to generalize the notion of Hopfian groups in the commutative case by defining the so-called {\bf relatively Hopfian groups} and {\bf weakly Hopfian groups}, and establishing some their crucial properties and…

Relying on the techniques and ideas from our recent paper [13], we prove several anti-classification results for various rigidity conditions in countable abelian and nilpotent groups. We prove three main theorems: (1) the rigid abelian…

The classification of gradings by abelian groups on finite direct sums of simple finite-dimensional nonassociative algebras over an algebraically closed field is reduced, by means of the use of loop algebras, to the corresponding problem…

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

We describe a new approach for classifying conjugacy classes of elementary abelian subgroups in simple algebraic groups over an algebraically closed field, and understanding the normaliser and centraliser structure of these. For toral…