Related papers: Orthogonal and Symplectic Black Box Groups, Revisi…
Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm imposing structural geometric conditions (orthogonality) on samples for variance reduction. Due to its simplicity and superior performance as compared to its Quasi Monte…
We present a polynomial time Monte-Carlo algorithm for finite simple black box classical groups of odd characteristic which constructs all root ${\rm{SL}}_2(q)$-subgroups associated with the nodes of the extended Dynkin diagram of the…
In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chevalley groups in the same spirit as the row-column operation…
We develop a biased Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation for arbitrary collision kernels. Given a trajectory with a fixed number of collisions, the algorithm modifies both the waiting…
We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank $>1$, other than any $^2F_4(q)$, over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism.…
The purpose of this paper is presenting a theoretical basis for the study of $\omega$-Hamiltonian vector fields in a more general approach than the classical one. We introduce the concepts of $\omega$-symplectic group and…
We investigate symmetries of the scalar field theory with harmonic term on the Moyal space with euclidean scalar product and general symplectic form. The classical action is invariant under the orthogonal group if this group acts also on…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group…
Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper, besides the oracle complexity, we focus also on iteration…
We engineer a new probabilistic Monte-Carlo algorithm for isomorphism testing. Most notably, as opposed to all other solvers, it implicitly exploits the presence of symmetries without explicitly computing them. We provide extensive…
We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…
We present the symplectic algorithm in the Lagrangian formalism for the Hamiltonian systems by virtue of the noncommutative differential calculus with respect to the discrete time and the Euler--Lagrange cohomological concepts. We also show…
An origami manifold is a manifold equipped with a closed 2-form which is symplectic except on a hypersurface where it is like the pullback of a symplectic form by a folding map and its kernel fibrates with oriented circle fibers over a…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
We give a uniform construction of irreducible polynomial representations of all classical groups, including spin groups, using semistandard domino tableaux. We also give an explicit decomposition of the homogeneous coordinate ring of the…
Algorithms which sort lists of real numbers into ascending order have been studied for decades. They are typically based on a series of pairwise comparisons and run entirely on chip. However people routinely sort lists which depend on…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
In this Letter we identify special systems of (an arbitrary number) N of first-order Ordinary Differential Equations with homogeneous polynomials of arbitrary degree M on their right-hand sides, which feature very simple explicit solutions;…