Related papers: Structure computation and discrete logarithms in f…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

We study the finitely generated abelian group $T(G)$ of endo-trivial $kG$-modules where $kG$ is the group algebra of a finite group $G$ over a field of characteristic $p>0$. When the representation type of the group algebra is not wild, the…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…

We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

For every finite abelian group $G$, there are positive integers $n$ and $d$ such that $G$ is isomorphic to the multiplicative group of $d$-th powers of reduced residues modulo $n$.

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

Given a computably locally compact Polish space $M$, we show that its 1-point compactification $M^*$ is computably compact. Then, for a computably locally compact group $G$, we show that the Chabauty space $\mathcal S(G)$ of closed…

For $G$ a symplectic or orthogonal $p$-adic group (not necessarily split), or an inner form of a general linear $p$-adic group, we compute the endomorphism algebras of some induced projective generators \`a la Bernstein of the category of…

The aim of this paper is to give all quasitriangular structures on a class of semisimple Hopf algebras constructed through abelian extensions of $\Bbbk\mathbb{Z}_{2}$ by $\Bbbk^G$ for an abelian group $G$. We first introduce the concept of…

We study the structure of the abelian category of modules for the triplet $W$-algebra $\mathcal{W}_{p_+,p_-}$. Using the logarithmic deformation by Fjelstad et al.(2002), we construct logarithmic $\mathcal{W}_{p_+,p_-}$-modules that have…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

We study the non-abelian tensor square $G\otimes G$ for the class of groups G that are finitely generated modulo their derived subgroup. In particular, we find conditions on G/G' so that $G\otimes G$ is isomorphic to the direct product of…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…