On Computational Aspects of the Fourier-Mukai Transform
Nikolaj M. Glazunov

TL;DR
This paper explores the computational challenges and methods related to the Fourier-Mukai transform, a fundamental tool in algebraic geometry, providing insights into its practical implementation.
Contribution
It offers a survey and analysis of computational techniques for the Fourier-Mukai transform, highlighting new approaches and open problems.
Findings
Identified key computational bottlenecks
Proposed algorithms for efficient computation
Outlined future research directions
Abstract
We survey and investigate some computational aspects of the Fourier-Mukai transform.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Chaos-based Image/Signal Encryption · Algebraic Geometry and Number Theory
