Related papers: A Las Vegas Rewriting Algorithm for the Symmetric …
We propose a new algorithm for classical statistical simulations in scalar and gauge theories undergoing a one dimensional expansion, which allows simulations to study boxes of larger transverse extent and to continue for longer times,…
We reconsider an old problem, namely the dimension of the $G$-invariant subspace in $V^{\otimes p} \otimes V^{*\otimes q}$, where $G$ is one of the classical groups ${\rm GL}(V)$, ${\rm SL}(V)$, ${\rm O}(V)$, ${\rm SO}(V)$, or ${\rm…
We shall investigate randomized algorithms for solving large-scale linear inverse problems with general regularizations. We first present some techniques to transform inverse problems of general form into the ones of standard form, then…
We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups 2G_2(q) = Ree(q), where q = 3^{2m + 1} for some m > 0, in their natural representations of degree 7. The input is a…
Let $q$ be a prime power and let $G$ be an absolutely irreducible subgroup of $GL_d(F)$, where $F$ is a finite field of the same characteristic as $\F_q$, the field of $q$ elements. Assume that $G \cong G(q)$, a quasisimple group of…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to parametrize the basis in which one measures the state by a random…
We formulate a general principle that supplants a Boolean \sigma-algebra of intrinsic properties of a classical system by a \sigma-complex (a union of \sigma-algebras) of extrinsic properties of a quantum system that are elicited by…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
Given a black box group $\mathsf{Y}$ encrypting $\rm{PSL}_2(\mathbb{F})$ over an unknown field $\mathbb{F}$ of unknown odd characteristic $p$ and a global exponent $E$ for $\mathsf{Y}$ (that is, an integer $E$ such that $\mathsf{y}^E=1$ for…
Let $\C$ be a sequence of multisets of subspaces of a vector space $\F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $\C$ under the group action of the general semilinear group. It allows us…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
The N-Queens problem, placing all N queens in a N x N chessboard where none attack the other, is a classic problem for constraint satisfaction algorithms. While complete methods like backtracking guarantee a solution, their exponential time…
Renormalization-Group (RG) improvement has been frequently applied to capture the effect of quantum corrections on cosmological and black-hole spacetimes. This work utilizes an algebraically complete set of curvature invariants to establish…
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically,…
We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.
Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement…
Connecting cosmological simulations to real-world observational programs is often complicated by a mismatch in geometry: while surveys often cover highly irregular cosmological volumes, simulations are customarily performed in a periodic…
The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization. The heart of our…