Related papers: Algorithms on the Pyasetskii involution on local L…
We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…
It is common practice to use Laplace approximations to compute marginal likelihoods in Bayesian versions of generalised linear models (GLM). Marginal likelihoods combined with model priors are then used in different search algorithms to…
We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the…
We give a process to construct non-split, three-dimensional simple Lie algebras from involutions of sl(2,k), where k is a field of characteristic not two. Up to equivalence, non-split three-dimensional simple Lie algebras obtained in this…
Higher-order nonlinear time-evolution equations have widespread applications in science and engineering, such as in solid mechanics, materials science, and fluid mechanics. This paper mainly studies a direct time-parallel algorithm for…
In this paper, discrete analogues of Euler-Poincar\'{e} and Lie-Poisson reduction theory are developed for systems on finite dimensional Lie groups $G$ with Lagrangians $L:TG \to {\mathbb R}$ that are $G$-invariant. These discrete equations…
We propose an optimization algorithm to compute the optimal sensor locations in experimental design in the formulation of Bayesian inverse problems, where the parameter-to-observable mapping is described through an integral equation and its…
We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry,…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
Probabilistic graphical models (PGMs) are widely used to discover latent structure in data, but their success hinges on selecting an appropriate model design. In practice, model specification is difficult and often requires iterative…
Involution words are variations of reduced words for involutions in Coxeter groups, first studied under the name of "admissible sequences" by Richardson and Springer. They are maximal chains in Richardson and Springer's weak order on…
This paper presents a first mathematical runtime analysis of PAES-25, an enhanced version of the original Pareto Archived Evolution Strategy (PAES) coming from the study of telecommunication problems over two decades ago to understand the…
This work puts forth low-complexity Riemannian subspace descent algorithms for the minimization of functions over the symmetric positive definite (SPD) manifold. Different from the existing Riemannian gradient descent variants, the proposed…
We introduce the notion of $\textit{symplectic determinant laws}$ by analogy with Chenevier's definition of determinant laws. Symplectic determinant laws are a way to define pseudorepresentations for symplectic representations of algebras…
The goal of this paper is to remove the irreducibility hypothesis in a theorem of Richard Taylor describing the image of complex conjugations by $p$-adic Galois representations associated with regular, algebraic, essentially self-dual,…
In this paper, we study the following problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the…
We adapt the Faddeev-LeVerrier algorithm for the computation of characteristic polynomials to the computation of the Pfaffian of a skew-symmetric matrix. This yields a very simple, easy to implement and parallelize algorithm of…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
The Lusztig-Shoji algorithm is generalized to a complex reflection group $W$ and give us a version of the Springer correspondence of $W$. We show that the combinatorics of generalized Springer correspondences of dihedral groups of order…
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…