Related papers: Computations of generating lengths with GAP

Many important questions about a model cannot be answered just by explaining how much each feature contributes to its output. To answer a broader set of questions, we generalize a popular, mathematically well-grounded explanation technique,…

Approximate Bayesian computation (ABC) can be used for model fitting when the likelihood function is intractable but simulating from the model is feasible. However, even a single evaluation of a complex model may take several hours,…

We prove a vanishing theorem for one forms on the moduli stack of principally polarized abelian varieties of genus g>1 with level structure N over fields of characteristic p different from two. This is used to compute the Picard groups of…

Half-integral weight modular forms are naturally viewed as automorphic forms on the so-called metaplectic covering of $\operatorname{GL}_2(\mathbf{A}_{\mathbf{Q}})$ -- a central extension by the roots of unity $\mu_2$ in $\mathbf{Q}$. For…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

Let $p$ be a prime and $a$ a quadratic non-residue $\bmod p$. Then the set of integral solutions of the diophantine equation $x_0^2 - ax_1^2 -px_2^2 + apx_3^2=1$ form a cocompact discrete subgroup $\Gamma_{p,a}\subset SL(2,\mathbb{R})$ and…

We explain how the computation of induced crossed modules allows the computation of certain homotopy 2-types and, in particular, second homotopy groups. We discuss various issues involved in computing induced crossed modules and give some…

Continuous-time trajectory representations are a powerful tool that can be used to address several issues in many practical simultaneous localization and mapping (SLAM) scenarios, like continuously collected measurements distorted by robot…

We consider generating functionals for computing correlators in quantum field theories with random potentials. Examples of such theories include condensed matter systems with quenched disorder (e.g. spin glass) or cosmological systems in…

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…

Surveying some of the recent developments on approximate subgroups and super-strong approximation for thin groups, we describe the Bourgain-Gamburd method for establishing spectral gaps for finite groups and the proof of the classification…

Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…

In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois…

Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error…

Geometric realizations for the restrictions of GNS representations to unitary groups of $C^*$-algebras are constructed. These geometric realizations use an appropriate concept of reproducing kernels on vector bundles. To build such…

Let $G$ be a finite $p$-group. We construct a $G$-extension $K/k$ of number fields such that the $p$-adic completion of the unit group of $K$ has a prescribed $\mathbb{Z}_p[G]$-module structure, up to free direct summands.

We use the theory of trianguline $(\varphi,\Gamma)$-modules over pseudorigid spaces to prove a modularity lifting theorem for certain Galois representations which are trianguline at $p$, including those with characteristic $p$ coefficients.…

We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of group schemes and are in correspondence with graded Hopf algebra. In this setting, graded group varieties…