Related papers: Algorithms for arithmetic groups with the congruen…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We show that the generalized holonomy groups of ungauged supergravity theories with 8 real supercharges must be contained in SL(2-\nu,H)\ltimes{\nu H^{2-\nu}}\subseteq SL(2,H), where SL(2,H) is the generalized structure group. Here n=4\nu…
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…
In this paper we extend the algorithm for extraspecial groups in \cite{iss07}, and show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure. The…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
Mixed integer nonlinear programming (MINLP) problems are encountered in modeling a physical/industrial process consisting both nonlinearity and discrete selective parameters. There are variety of algorithms for solving MINLP problems most…
To answer a question about the distribution of products of elliptic curves in isogeny classes of abelian surfaces defined over finite fields, we compute specific orbital integrals in the group $\mathrm{GSp}_4$. More precisely, we compute…
We investigate two-parameter quantum groups corresponding to the general linear and special linear Lie algebras gl_n and sl_n. We show that these quantum groups can be realized as Drinfel'd doubles of certain Hopf subalgebras with respect…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
Let $A_p(G)$ denote the Figa-Talamanca-Herz Banach Algebra of the locally compact group $G$, thus $A_2(G)$ is the Fourier Algebra of $G$. If $G$ is commutative then $A_2(G)=L^1(\hat{G}){\hat{}}$. Let $A^r_p(G)=A_p\cap L^r(G)$ with norm…
Let G be a reductive algebraic group over Q, and suppose that Gamma is an arithmetic subgroup of G(R) defined by congruence conditions. A basic problem in arithmetic is to determine the multiplicities of discrete series representations in…
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…
We extend the decomposition conjecture to 2d quantum field theories with a gauged $\text{Rep}(H)$ symmetry category for $H$ a finite-dimensional semisimple Hopf algebra with $\text{Rep}(G)$ trivially-acting and $\text{Vec}(\Gamma)$ the…
This work begins with a review of complexification and realification of Hopf algebras. We emphasize the notion of multiplier Hopf algebras for the description of different classes of functions (compact supported, bounded, unbounded) on…
In a series of papers the present authors and their coworkers have developed a family of algebraic techniques to solve a number of problems in the theory of discrete or continuous dynamical systems and to analyze numerical integrators.…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…
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…