55 citations · 118 across the 9 of their papers we have counts for
10 papers
Schreyer Resolutions over the Exterior Algebra
Janko Boehm, Lakshmi Ramesh
Schreyer's algorithm is usually the fastest way to determine a (typically non-minimal) free resolution of a finitely presented module over a polynomial ring. We adapt a refined ver…
Classification of Complex Singularities with Non-Degenerate Newton Boundary
Janko Boehm, Magdaleen S. Marais, Gerhard Pfister
In his groundbreaking work on classification of singularities with regard to right and stable equivalence of germs, Arnold has listed normal forms for all isolated hypersurface sin…
Module Intersection for the Integration-by-Parts Reduction of Multi-Loop Feynman Integrals
Dominik Bendle, Janko Boehm, Wolfram Decker +4
In this manuscript, which is to appear in the proceedings of the conference "MathemAmplitude 2019" in Padova, Italy, we provide an overview of the module intersection method for th…
IBP reduction coefficients made simple
Janko Boehm, Marcel Wittmann, Zihao Wu +2
We present an efficient method to shorten the analytic integration-by-parts (IBP) reduction coefficients of multi-loop Feynman integrals. For our approach, we develop an improved v…
Integration-by-parts reductions of Feynman integrals using Singular and GPI-Space
Dominik Bendle, Janko Boehm, Wolfram Decker +5
We introduce an algebro-geometrically motived integration-by-parts (IBP) reduction method for multi-loop and multi-scale Feynman integrals, using a framework for massively parallel…
Massively parallel computations in algebraic geometry - not a contradiction
Janko Boehm, Anne Frühbis-Krüger, Mirko Rahn
The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GP…