Towards massively parallel computations in algebraic geometry
From MaRDI portal
Publication:2040457
DOI10.1007/s10208-020-09464-xzbMath1485.14109arXiv1808.09727OpenAlexW3038794244MaRDI QIDQ2040457
Mirko Rahn, Anne Frühbis-Krüger, Franz-Josef Pfreundt, Janko Böhm, Lukas Ristau, Wolfram Decker
Publication date: 14 July 2021
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09727
Related Items (7)
Families of polynomials in the study of biochemical reaction networks ⋮ Integration-by-parts reductions of Feynman integrals using singular and GPI-space ⋮ \textsc{pfd-parallel}, a singular/GPI-space package for massively parallel multivariate partial fractioning ⋮ Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians ⋮ \textsc{NeatIBP} 1.0, a package generating small-size integration-by-parts relations for Feynman integrals ⋮ Computing GIT-fans with symmetry and the Mori chamber decomposition of \overline{𝑀}_{0,6} ⋮ Embedded desingularization for arithmetic surfaces – toward a parallel implementation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theoretical computer science. Petri nets.
- Constructing big Gorenstein ideals from small ones
- La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
- A structure to decide reachability in Petri nets
- Global moduli for surfaces of general type
- Canonical desingularization in characteristic zero by blowing up the maximum strata of a local invariant
- A smoothness test for higher codimensions
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Strong resolution of singularities in characteristic zero
- Parallel algorithms for normalization
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Implementing the Kustin-Miller complex construction
- On the characters \(\nu^*\) and \(\tau^*\) of singularities
- Parallel program schemata
- A simplified proof of desingularization and applications
- Surfaces of general type with geometric genus zero: a survey
- A construction of numerical Campedelli surfaces with torsion ℤ/6
- Mora’s holy graal: Algorithms for computing in localizations at prime ideals
- Constructiveness of Hironaka's resolution
- Contact maximal en caractéristique positive
- Can programming be liberated from the von Neumann style?
- Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve
- SINGULAR
- The use of bad primes in rational reconstruction
This page was built for publication: Towards massively parallel computations in algebraic geometry