Sets of Special Subvarieties of Bounded Degree
David Urbanik

TL;DR
This paper develops an algorithm to compute all weakly special subvarieties of a given degree in a family of algebraic varieties, proving finiteness conjectures related to special subvarieties.
Contribution
It introduces an explicit algorithm for enumerating weakly special subvarieties of bounded degree, advancing understanding of their structure and finiteness properties.
Findings
Algorithm for computing weakly special subvarieties of degree ≤ d
Proof of finiteness conjectures for special and weakly special subvarieties
Establishment of bounds on degrees of special subvarieties
Abstract
Let be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base , and let be the integral variation of Hodge structure coming from degree cohomology it induces. Associated to one has the so-called Hodge locus , which is a countable union of "special" algebraic subvarieties of parametrizing those fibres of possessing extra Hodge tensors (and so conjecturally, those fibres of possessing extra algebraic cycles). The special subvarieties belong to a larger class of so-called weakly special subvarieties, which are subvarieties of maximal for their algebraic monodromy groups. For each positive integer , we give an algorithm to compute the set of all weakly special subvarieties of degree at most (with the…
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 Geometry and Number Theory · Geometric and Algebraic Topology · Commutative Algebra and Its Applications
