Related papers: Gaussian Elimination in Symplectic and split ortho…
We establish that in the large degree limit, the value of certain optimization problems on sparse random hypergraphs is determined by an appropriate Gaussian optimization problem. This approach was initiated in Dembo et. al.(2016) for…
This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…
If $G$ is a linearly reductive group acting rationally on a polynomial ring $S$, then the inclusion $S^{G} \hookrightarrow S$ possesses a unique $G$-equivariant splitting, called the Reynolds operator. We describe algorithms for computing…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…
The analogies between symplectic and orthogonal groups, regarded as symmetries of real bilinear forms, are manifest in their (metaplectic and spin) projective representations. In finite dimensions, those are true representations of doubly…
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
A variational integrator of arbitrarily high-order on the special orthogonal group $SO(n)$ is constructed using the polar decomposition and the constrained Galerkin method. It has the advantage of avoiding the second-order derivative of the…
We introduce some general tools to design exact splitting methods to compute numerically semigroups generated by inhomogeneous quadratic differential operators. More precisely, we factorize these semigroups as products of semigroups that…
We prove various results about the Local Converse Problem for split reductive groups $G$ over a non-archimedean local field~$F$ of characteristic $0$ and residual characteristic $p$. In particular, we prove that when $G$ is a symplectic or…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
As is well known, both sampling from the posterior and computing the mean of the posterior in Gaussian process regression reduces to solving a large linear system of equations. We study the use of stochastic gradient descent for solving…
The paper considers the problem of network-based computation of global minima in smooth nonconvex optimization problems. It is known that distributed gradient-descent-type algorithms can achieve convergence to the set of global minima by…
Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.