Related papers: An L(1/3) algorithm for ideal class group and regu…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…
Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the principal ideal problem using the reductions to $S$-unit…
In this paper we identify the structure of complex finite-dimensional Leibniz algebras with associated Lie algebras $sl_2^1\oplus sl_2^2\oplus \dots \oplus sl_2^s\oplus R,$ where $R$ is a solvable radical. The classifications of such…
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper…
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…
We study the structure of a Leibniz triple system $\mathcal{E}$ graded by an arbitrary abelian group $G$ which is considered of arbitrary dimension and over an arbitrary base field $\mathbb{K}$. We show that $\mathcal{E}$ is of the form…
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
Let $F$ denote a number field and let $\mathfrak{q}\subset O_F$ traverse a sequence of prime ideals with norm $N(\mathfrak{q}) \to \infty$ and for each $\mathfrak{q}$, let $\chi \in \widehat{F^{\times}\setminus \mathbb{A}^\times}$ be a…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator $A$, a time $t>0$, an arbitrary initial vector $u_0$ and an error tolerance…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
We classify up to isomorphism the gradings by arbitrary groups on the exceptional classical simple Lie superalgebras $G(3)$, $F(4)$ and $D(2,1;\alpha)$ over an algebraically closed field of characteristic $0$. To achieve this, we apply the…
We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…