Related papers: Orthogonal and Symplectic Black Box Groups, Revisi…

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…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

We use a Monte Carlo method to assemble finite element matrices for polynomial Chaos approximations of elliptic equations with random coefficients. In this approach, all required expectations are approximated by a Monte Carlo method. The…

We present a new class of stochastic, geometrically-driven optimization algorithms on the orthogonal group $O(d)$ and naturally reductive homogeneous manifolds obtained from the action of the rotation group $SO(d)$. We theoretically and…

We introduce a recent symplectic integration scheme derived for solving physically motivated systems with non-separable Hamiltonians. We show its relevance to Riemannian manifold Hamiltonian Monte Carlo (RMHMC) and provide an alternative to…

Let $\Omega$ be a finite set of finitary operation symbols. An $\Omega$-expanded group is a group (written additively and called the additive group of the $\Omega$-expanded group) with an $\Omega$-algebra structure. We use the black-box…

The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…

The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new…

We consider stochastic optimization when one only has access to biased stochastic oracles of the objective and the gradient, and obtaining stochastic gradients with low biases comes at high costs. This setting captures various optimization…

Currently, large partially observable Markov decision processes (POMDPs) are often solved by sampling-based online methods which interleave planning and execution phases. However, a pre-computed offline policy is more desirable in POMDP…

The spectra of a finite group is the set of its element orders. We obtain an arithmetic description of finite symplectic and orthogonal groups. In particular, a description of spectra of all finite simple simplectic and orthogonal groups is…

In a previous paper, second- and fourth-order explicit symplectic integrators were designed for a Hamiltonian of the Schwarzschild black hole. Following this work, we continue to trace the possibility of the construction of explicit…

Let either $GL(E)\times SO(F)$ or $GL(E)\times Sp(F)$ act naturally on the space of matrices $E\otimes F$. There are only finitely many orbits, and the orbit closures are orthogonal and symplectic generalizations of determinantal varieties,…

The paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. As the starting point of our programme, we construct Frobenius maps on black box groups of untwisted Lie type in odd…

We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…

We show that for all integers $m\geq 2$, and all integers $k\geq 2$, the orthogonal groups $\Orth^{\pm}(2m,\Fk)$ act on abstract regular polytopes of rank $2m$, and the symplectic groups $\Sp(2m,\Fk)$ act on abstract regular polytopes of…

We define two classes of colorings that have odd or even chirality on hexagonal lattices. This parity is an invariant in the dynamics of all loops, and explains why standard Monte-Carlo algorithms are nonergodic. We argue that adding the…

We discuss various ensembles of homogeneous complex networks and a Monte-Carlo method of generating graphs from these ensembles. The method is quite general and can be applied to simulate micro-canonical, canonical or grand-canonical…