Related papers: A generalization of the Newton-Puiseux algorithm f…
In [5] Cauchon introduced the so-called deleting derivations algorithm. This algorithm was first used in noncommutative algebra to prove catenarity in generic quantum matrices, and then to show that torus-invariant primes in these algebras…
In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…
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…
In this paper, we present a novel numerical scheme for simulating deformable and extensible capsules suspended in a Stokesian fluid. The main feature of our scheme is a partition-of-unity (POU) based representation of the surface that…
Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their…
Ab-initio calculations of real-time evolution for lattice gauge theory have very interesting potential applications but present challenging computational aspects. We show that tensor renormalization group methods developed in the context of…
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…
We propose a quantum generalisation of a classical neural network. The classical neurons are firstly rendered reversible by adding ancillary bits. Then they are generalised to being quantum reversible, i.e.\ unitary. (The classical networks…
Let $\rho: G \to \operatorname{GL}(V)$ be a rational representation of a reductive linear algebraic group $G$ defined over $\mathbb C$ on a finite dimensional complex vector space $V$. We show that, for any generic smooth (resp. $C^M$)…
In this paper we answer two long-standing questions in the classification of $G$-torsors on curves for an almost simple, simply connected algebraic group $G$ over the field of complex numbers. The first question is to give an intrinsic…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
Geometric graphs form an important family of hidden structures behind data. In this paper, we develop an efficient and robust algorithm to infer a graph skeleton of a high-dimensional point cloud dataset (PCD). Previously, there has been…
In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois…
First we compute the $\mbox{S}^2$ partition function of the supersymmetric $\mathbb{CP}^{N-1}$ model via localization and as a check we show that the chiral ring structure can be correctly reproduced. For the $\mathbb{CP}^1$ case we provide…
In the distributed nucleus approximation we represent the singular nucleus as smeared over a smallportion of a Cartesian grid. Delocalizing the nucleus allows us to solve the Poisson equation for theoverall electrostatic potential using a…
As is well known, the Lefschetz theorems for the \'etale fundamental group of SGA1 do not hold. We fill a small gap in the literature showing they do for tame coverings. Let $X$ be a regular projective variety over a field $k$, and let…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
Model calculations of nuclear properties are peformed using quantum computing algorithms on simulated and real quantum computers. The models are a realistic calculation of deuteron binding based on effective field theory, and a simplified…
We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation}…
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…