Related papers: An algorithm to compute a presentation of pushforw…
Let ${\mathcal C}$ be a fixed equisingularity class of irreducible germs of complex analytic plane curves. We compute a basis of the ${\mathbb C}[[x]]$-module of K\"ahler differentials for generic $\Gamma \in {\mathcal C}$, algorithmically,…
We propose a variable metric extension of the forward--backward-forward algorithm for finding a zero of the sum of a maximally monotone operator and a Lipschitzian monotone operator in Hilbert spaces. In turn, this framework provides a…
Moduli of rings and quadrilaterals are frequently applied in geometric function theory, see e.g. the Handbook by K\"uhnau. Yet their exact values are known only in a few special cases. Previously, the class of planar domains with polygonal…
We exhibit an algorithm to compute a Dirichlet domain for a cofinite Fuchsian group Gamma. As a consequence, we compute the invariants of Gamma, including an explicit finite presentation for Gamma.
We give an algorithm which computes a presentation for a subgroup, denoted $\AM_{g,1,p}$, of the automorphism group of a free group. It is known that $\AM_{g,1,p}$ is isomorphic to the mapping-class group of an orientable genus-$g$ surface…
We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…
The goal in this preprint is to give an efficient algorithm to compute Puiseux expansions at cusps of X0(N). It is based on a relation with a hypergeometric function that holds for any N.
The notion of a Moreau envelope is central to the analysis of first-order optimization algorithms for machine learning. Yet, it has not been developed and extended to be applied to a deep network and, more broadly, to a machine learning…
An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output…
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…
In this paper, we propose a variable metric version of Tseng's algorithm (the forward-backward-forward algorithm: FBF) combined with extrapolation from the past that includes error terms for finding a zero of the sum of a maximally monotone…
We present a new, practical algorithm for computing the determinant of a non-singular dense, uniform matrix over Z; the aim is to achieve better practical efficiency, which is always at least as good as currently known methods. The…
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…
With the advent of generalized unitarity and parametric integration techniques, the construction of a generic Next-to-Leading Order Monte Carlo becomes feasible. Such a generator will entail the treatment of QCD color in the amplitudes. We…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
Let $X=G/P$ be a partial flag variety, where $G$ is a semi-simple, simply connected algebraic group defined over an algebraically closed field $K$ of positive characteristic. Let $\mathsf{F}\colon X\to X$ be the absolute Frobenius morphism.…
The goal of this paper is to generalize several basic results from the theory of $\cal{D}$-modules to the representation theory of rational Cherednik algebras. We relate characterizations of holonomic modules in terms of singular support…
We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…
In this work, various versions of the so-called Omega-Lemma are provided, which ensure differentiability properties of pushforwrds between spaces of C^r-sections (or compactly supported C^r-sections) in vector bundles over…
In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is…