Related papers: Orthogonal and Symplectic Black Box Groups, Revisi…
In this note, we propose a symplectic algorithm for the stable manifolds of the Hamilton-Jacobi equations combined with an iterative procedure in [Sakamoto-van~der Schaft, IEEE Transactions on Automatic Control, 2008]. Our algorithm…
We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…
An explicit algorithmic construction is given for orthogonal bases for spaces of homogeneous polynomials, in the context of Hermitean Clifford analysis, which is a higher dimensional function theory centred around the simultaneous null…
Data valuation using Shapley value has emerged as a prevalent research domain in machine learning applications. However, it is a challenge to address the role of order in data cooperation as most research lacks such discussion. To tackle…
In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with $m$ and $n$ edges respectively, our method runs in…
Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard…
Quasi-Monte Carlo methods replaced classical Monte Carlo methods in many areas of numerical analysis over the last decades. The purpose of this paper is to extend quasi-Monte Carlo methods into a new direction. We construct and implement a…
We present a procedure which enables the computation and the description of structures of isotropy subgroups of the group of complex orthogonal matrices with respect to the action of *congruence on Hermitian matrices. A key ingredient in…
We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of Optimal Control Problems (OCPs) constrained by random partial…
We classify the irreducible complex characters of the symplectic groups $Sp_{2n}(q)$ and the orthogonal groups $Spin_{2n}^\pm(q)$, $Spin_{2n+1}(q)$ of degrees up to the bound D, where $D=(q^n-1)q^{4n-10}/2$ for symplectic groups,…
We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…
The out-of-time-ordered correlation (OTOC) and entanglement are two physically motivated and widely used probes of the "scrambling" of quantum information, a phenomenon that has drawn great interest recently in quantum gravity and many-body…
Random non-commutative geometries are introduced by integrating over the space of Dirac operators that form a spectral triple with a fixed algebra and Hilbert space. The cases with the simplest types of Clifford algebra are investigated…
The main purpose of this paper is to facilitate the communication between the Analytic, Probabilistic and Algorithmic communities. We present a proof of convergence of the Hamiltonian (Hybrid) Monte Carlo algorithm from the point of view of…
We present a decoupled algorithm for motion planning for a collection of unit-balls moving among polyhedral obstacles in $\mathbb{R}^d$, for any $d \ge 2$. We assume that the robots have revolving areas in the vicinity of their start and…
We show in this paper that the Gentry-Szydlo algorithm for cyclotomic orders, previously revisited by Lenstra-Silverberg, can be extended to complex-multiplication (CM) orders, and even to a more general structure. This algorithm allows to…
Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for deciding on the next…
We present a polynomial space Monte Carlo algorithm that given a directed graph on $n$ vertices and average outdegree $\delta$, detects if the graph has a Hamiltonian cycle in $2^{n-\Omega(\frac{n}{\delta})}$ time. This asymptotic scaling…
Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…
We show how to use the method of orthogonal polynomials for integrating, in the planar approximation, the partition function of one-matrix models with a potential with even or odd vertices, or any combination of them.