Related papers: Structure computation and discrete logarithms in f…

We determine the structure of both Abelian and non-Abelian non-global logarithms up to four loops for $e^+e^-$ processes in perturbative QCD, where final-state jets are defined using the Cambridge--Aachen (C/A) clustering algorithm. The…

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Suppose that the finite group $G=AB$ is a mutually permutable product of two subgroups $A$ and $B$. By using Sylow numbers of $A$ and $B$, we present some new bounds of the $p$-length $l_p(G)$ of a $p$-solvable group $G$ and the nilpotent…

It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…

Peterzil and Steinhorn proved that if a group $G$ definable in an $o$-minimal structure is not definably compact, then $G$ contains a definable torsion-free subgroup of dimension one. We prove here a $p$-adic analogue of the…

In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…

Biggs proposed the sandpile group of certain modified wheel graphs for cryptosystems relying on the difficulty of the discrete logarithm problem. Blackburn and independently Shokrieh showed that the discrete logarithm problem is efficiently…

This paper is lead by the question whether there is a nice structure theory of finitely generated modules over the Iwasawa algebra, i.e. the completed group algebra, R of a p-adic analytic group G. For G without any p-torsion element we…

A finite abelian $p$-group having an automorphism $x$ such that $1+\ldots+x^{p-1}=0$, can be viewed as a module over an appropriate discrete valuation ring $\mathcal{O}$ containing $\mathbb{Z}_p$ (the ring of $p$-adic integer). This yields…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

We first provide a detailed proof of Kato's classification theorem of log $p$-divisible groups over a noetherian henselian local ring. Exploring Kato's idea further, we then define the notion of a standard extension of a classical finite…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

We consider four classes of classical groups over a non-archimedean local field F: symplectic, (special) orthogonal, general (s)pin and unitary. These groups need not be quasi-split over F. The main goal of the paper is to obtain a local…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…