Related papers: Construction of Curtis-Phan-Tits system in black b…
In this paper we make a step towards a time and space efficient algorithm for the hidden shift problem for groups of the form $\mathbb{Z}_k^n$. We give a solution to the case when $k$ is a power of 2, which has polynomial running time in…
In this manuscript, for $q:=2^n$ with $n\geq2$, we study two primitive maximal subgroups of the alternating group ${\sf A}_{q-1}$. These subgroups are the full automorphism groups of $2$-designs which are constructed from algebraic curves…
This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known…
[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$…
We develop the theory of $q$-characters for quantum affine superalgebras of type $A$ in connection with deformed Cartan matrices. To achieve this, we establish a Khoroshkin-Tolstoy-type multiplicative formula of the universal $R$-matrix of…
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…
Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of…
The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…
Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
Monte Carlo studies involving real time dynamics are severely restricted by the sign problem that emerges from highly oscillatory phase of the path integral. In this letter, we present a new method to compute real time quantities on the…
We classify all non-collapsing Curtis-Tits and Phan amalgams with $3$-spherical diagram over all fields. In particular, we show that amalgams with spherical diagram are unique, a result required by the classification of finite simple…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…
We compute the Euler-Poincar\'e characteristic of quotients of the Bruhat-Tits building of PGL(n) under the action of arithmetic groups arising from central division algebras over rational function fields of positive characteristic. We use…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.