Related papers: An algorithm to compute a presentation of pushforw…

Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…

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…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

Consider a singular holomorphic map-germ $f: (X,\underline{0}) \to (\mathbb C,0)$ where $X$ is a singular complex analytic variety in $\mathbb C^N$, and another holomorphic map-germ $g: (X,\underline{0}) \to (\mathbb C,0)$ which is…

In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…

We introduce the computer program MPL for computations with homotopy invariant iterated integrals on moduli spaces $\mathcal{M}_{0,n}$ of curves of genus 0 with $n$ ordered marked points. The program is an implementation of the algorithms…

We deal with monotone inclusion problems of the form $0\in Ax+Dx+N_C(x)$ in real Hilbert spaces, where $A$ is a maximally monotone operator, $D$ a cocoercive operator and $C$ the nonempty set of zeros of another cocoercive operator. We…

Equational reasoning is among the most important tools that functional programming provides us. Curiously, relatively less attention has been paid to reasoning about monadic programs. In this report we derive a backtracking algorithm for…

We compute the corrections of next to leading order in the ${1 \over N}$ expansion to the effective potential of a system described by a Ginzburg-Landau model with $N$ components and quartic interaction, in the case of spontaneous symmetry…

We introduce a framework for quasi-Newton forward--backward splitting algorithms (proximal quasi-Newton methods) with a metric induced by diagonal $\pm$ rank-$r$ symmetric positive definite matrices. This special type of metric allows for a…

We study germs of analytic maps $f:(X,S)\rightarrow(\mathbb{C}^p,0)$, when $X$ is an ICIS of dimension $n<p$. We define an image Milnor number, generalizing Mond's definition, $\mu_I(X,f)$ and give results known for the smooth case such as…

Let $\mathcal{F}$ be a coherent $\mathcal{O}_X$-module over a complex manifold $X$, and let $G$ be a vector bundle on $X$. We describe an explicit isomorphism between two different representations of the global…

Given a Schubert variety $\mathcal{S}$ contained in a Grassmannian $\mathbb{G}_{k}(\mathbb{C}^{l})$, we show how to obtain further information on the direct summands of the derived pushforward $R \pi_{*} \mathbb{Q}_{\tilde{\mathcal{S}}}$…

We study corank one $A$-finite germs $f:(\mathbb{R}^n,0)\rightarrow (\mathbb{R}^{n+1},0)$ and their complexifications. More precisely, we study when these germs provide good real pictures of the complex germs, i.e., when there is a real…

We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

In the recent paper "Mutation in triangulated categories and rigid Cohen-Macaulay modules" Iyama and Yoshino consider two interesting examples of isolated singularities over which it is possible to classify the indecomposable maximal…

We give a formula for the eventual multiplicities of irreducible representations appearing in a finitely-presented FI-module over the rational numbers. The result relies on structure theory due to Sam-Snowden SS16.

For a wide class of Cohen--Macaulay modules over the local ring of the plane curve singularity of type T_44 we explicitly describe the corresponding matrix factorizations. The calculations are based on the technique of matrix problems, in…

Based on the correspondence of projection to an eigenvalue problem via the underlying group structure, we generalize the projection algorithm proposed by Morrison et al. This algorithm is eligible for large-scale computations, because we…