Related papers: Algorithms in the classical N\'eron Desingularizat…

We give an uniform General Neron Desingularization for one dimensional local rings with respect to morphisms which coincide modulo a high power of the maximal ideal. The result has interesting applications in the case of Cohen-Macaulay…

We complete Dyson's dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random…

We first propose a concise singular value decomposition of dual matrices. Then, the randomized version of the decomposition is presented. It can significantly reduce the computational cost while maintaining the similar accuracy. We analyze…

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…

We present a study on how to effectively reduce the dimensions of the $k$-means clustering problem, so that provably accurate approximations are obtained. Four algorithms are presented, two \textit{feature selection} and two \textit{feature…

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…

As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model,…

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.

This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…

In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…

A problem of constructing quantum groups from classical r-matrices is discussed.

$k$-Clustering in $\mathbb{R}^d$ (e.g., $k$-median and $k$-means) is a fundamental machine learning problem. While near-linear time approximation algorithms were known in the classical setting for a dataset with cardinality $n$, it remains…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.

We construct an algorithm for the minimal model program in dimension three over the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein…

For matrices with displacement structure, basic operations like multiplication, inversion, and linear system solving can all be expressed in terms of the following task: evaluate the product $\mathsf{A}\mathsf{B}$, where $\mathsf{A}$ is a…

Neural algorithmic reasoning aims to capture computations with neural networks by training models to imitate the execution of classical algorithms. While common architectures are expressive enough to contain the correct model in the weight…

We prove that the algorithm for desingularization of algebraic varieties in characteristic zero of the first two authors is functorial with respect to regular morphisms. For this purpose, we show that, in characteristic zero, a regular…

This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…