Papers
Topics
Authors
Recent
Search
2000 character limit reached

A (244,323)(24_4,32_3)-configuration on the Schur quartic with logarithmic Chern slope $14/5$

Published 8 Jul 2026 in math.AG | (2607.07898v1)

Abstract: Let X⊂P<sup>3X\subset\mathbb{P}<sup>3 be the Schur quartic [ x_04-x_0x_13-x_24+x_2x_33=0. ] We exhibit a connected arrangement of $24$ lines on XX, defined over Q(−3)\mathbb{Q}(\sqrt{-3}), whose singular locus consists of $32$ ordinary triple points and no other intersections. Each line contains four triple points. The resulting reduced divisor DD satisfies D∼6HD\sim6H, where HH is the hyperplane class. If π:Y→Xπ:Y\to X blows up the triple points and B=(π<sup>−1D)redB=(π<sup>{-1}D)_{\mathrm{red}}, then [ \overline{c}{1}{2}(Y,B)=112,\qquad \overline{c}{2}(Y,B)=40, \qquad \frac{\overline{c}{1}{2}(Y,B)}{\overline{c}{2}(Y,B)}=\frac{14}{5}. ] This gives a negative answer to the K3-surface specialization of the proposed $8/3$ bound for transversal arrangements of rational curves. The configuration is one half of the $48$ lines of the second kind on XX; an explicit projective automorphism exchanges the two halves. We deliver the line parametrizations and all $32$ triple-point coordinates. Ancillary exact-arithmetic data record the $120$ line-containment coefficients and all $276$ pair-incidence determinants. A finite-field mixed-integer search is described only as the discovery procedure and is not used in the proof.

Summary

  • The paper presents an explicit construction of a (24_4,32_3)-configuration on the Schur quartic achieving a logarithmic Chern slope of 14/5, thereby challenging previously conjectured bounds.
  • It employs mixed-integer programming along with exact characteristic-zero verification to rigorously compute line incidences, divisors, and geometric invariants.
  • The findings not only refute the 8/3 slope bound for rational curve arrangements on K3 surfaces but also suggest new avenues for studying the interplay between automorphisms and curve configurations.

Explicit Line Configuration with Chern Slope $14/5$ on Schur Quartic

Introduction

The paper examines a specific arrangement of lines on the Schur quartic surface X⊂P3X \subset \mathbb{P}^3, given by x04−x0x13−x24+x2x33=0x_0^4 - x_0 x_1^3 - x_2^4 + x_2 x_3^3 = 0. The focus is on a connected configuration consisting of 24 lines defined over Q(−3)\mathbb{Q}(\sqrt{-3}), whose intersections yield exactly 32 ordinary triple points, with each line containing four triples and no other types of singular points. The work precisely constructs this arrangement, computes all relevant geometric invariants, and demonstrates that its associated logarithmic Chern slope exceeds the previously conjectured upper bound for transversal arrangements of rational curves on K3 surfaces.

Construction and Incidence of the (244,323)(24_4,32_3)-Configuration

The Schur quartic uniquely admits 64 projective lines, with 48 classified as "of the second kind." The authors show that these 48 lines decompose into two complimentary sets of 24, each forming an incidence configuration where all intersections are triple points and every line hosts exactly four such points. The explicit parametrizations for all 24 lines and coordinates of the triple points are provided, with rigorous verification of pairwise incidences conducted via exact-arithmetic certificates.

A projective automorphism, α=diag(1,1,i,i)\alpha = \text{diag}(1,1,i,i), acts on the Schur quartic to exchange these two halves, ensuring their geometric equivalence. The full arrangement of 48 second-kind lines yields combinatorics (t2,t3,t4)=(144,64,0)(t_2,t_3,t_4) = (144,64,0), whereas each half independently achieves (0,32,0)(0,32,0). The arrangement is connected, all intersections are transverse, and the arrangement is semistable.

Logarithmic Chern Number Calculations and Slope

The configuration is analyzed using log surface techniques. Blowing up the 32 triple points yields a surface YY with boundary divisor BB, leading to the computation of logarithmic Chern numbers:

  • X⊂P3X \subset \mathbb{P}^30
  • X⊂P3X \subset \mathbb{P}^31
  • Slope X⊂P3X \subset \mathbb{P}^32

This result provides a counterexample to the proposed X⊂P3X \subset \mathbb{P}^33 bound for the logarithmic Chern slope of transversal arrangements of rational curves on complex K3 surfaces [see also Naskrecki & Pokora, EMS Surv. Math. Sci.]. Notably, this is the first explicit arrangement in the literature to achieve such a value via rational lines on a smooth quartic K3 surface.

Additionally, the divisor formed by the 24 selected lines is numerically equivalent to X⊂P3X \subset \mathbb{P}^34, where X⊂P3X \subset \mathbb{P}^35 is the hyperplane class, with intersection numbers and self-intersection rigorously verified.

Discovery and Computational Verification

The configuration was discovered through a mixed-integer programming approach leveraging finite-field models over X⊂P3X \subset \mathbb{P}^36, followed by exact characteristic-zero reconstruction. The reproducibility package is comprehensive, containing explicit scripts, certificates, and log files that enable independent numerical and symbolic verification of all claims.

The authors emphasize that while automated discovery procedures played a crucial role, all geometric assertions regarding incidence, divisor class, and Chern numbers rely entirely on exact arithmetic checked in characteristic zero. Ancillary files include line containment coefficients, intersection determinants, triple-point coordinates, and MILP solver results.

Implications and Further Directions

The result challenges the previously held belief that the X⊂P3X \subset \mathbb{P}^37 ratio bounds Chern slopes for such configurations. It prompts a re-examination of universal bounds for log Chern slopes on K3 surfaces and suggests that richer combinatorial or group-theoretic structures—such as automorphism invariants—might govern the possible configurations.

The decomposition of the 48-line arrangement into two halves, each equivalent under the Schur quartic’s automorphism group, raises the question of intrinsic characterizations of such colorings and whether similar incidents occur in other line-rich quartic K3 surfaces.

Future work may involve:

  • Developing geometric or lattice-theoretic criteria for such decompositions.
  • Establishing upper bounds for log Chern slopes for more general rational curve arrangements.
  • Investigating analogous arrangements on other quartic K3 surfaces using divisor class identities and automorphism actions.

Conclusion

The paper presents an explicit, algebraically constructive arrangement of 24 rational lines on the Schur quartic with 32 triple points and a logarithmic Chern slope of X⊂P3X \subset \mathbb{P}^38, exceeding the widely conjectured X⊂P3X \subset \mathbb{P}^39 bound. The configuration is rigorously verified, both algebraically and computationally, and opens new avenues for the study of log surfaces, curve arrangements, and their algebraic invariants on K3 surfaces (2607.07898).

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Explain it Like I'm 14

What this paper is about

Think of a beautiful, curved surface floating in 3D space. Mathematicians call one special kind of such surface a “K3 surface.” This paper studies a particular K3 surface called the Schur quartic, defined by the equation:

  • x0⁴ − x0·x1³ − x2⁴ + x2·x3³ = 0

On this surface, the authors look at straight lines that lie entirely on it and how these lines cross each other. They found a special arrangement of 24 lines with a very neat intersection pattern, and they show this arrangement beats a previously suggested limit (a “bound”) on a certain score called the “logarithmic Chern slope.” Their example reaches a slope of 14/5 = 2.8, which is higher than the suggested cap of 8/3 ≈ 2.67 for these kinds of line arrangements on K3 surfaces.

The big questions, in simple terms

  • Can we arrange straight lines on a special curved surface (a K3 surface) so that the “complexity score” of the surface-with-lines-removed (the logarithmic Chern slope) is very high?
  • Is there an upper limit to this score for such arrangements? Earlier work wondered if the score could be at most 8/3.
  • What kinds of line patterns on well-known surfaces (here, the Schur quartic) can push that score higher?

How the authors approached the problem

To make this understandable, here are the main ideas explained with everyday analogies:

  • The surface: The Schur quartic is a special, smooth shape in 3D, cut out by a fourth-degree equation. You can imagine it as a perfectly smooth, slightly mysterious, curved shell.
  • Lines on the surface: Even though the surface is curved, some straight lines lie exactly on it. The Schur quartic is famous for having lots of such lines (64 in total).
  • The arrangement: The authors selected 24 specific lines with a very clean pattern of intersections:
    • There are exactly 32 “triple points,” places where exactly 3 of the selected lines meet.
    • Inside this 24-line network, there are no ordinary “double” crossings and no quadruple crossings.
    • Each of the 24 lines contains exactly 4 of those triple points.
    • This pattern is summarized as a (24₄, 32₃)-configuration: 24 lines, each with 4 special points; 32 special points, each where 3 lines meet.
  • Measuring “complexity”: The “logarithmic Chern numbers” are two integers that summarize how complicated the surface becomes after you remove the lines. Their ratio is the “slope,” which is the main score of interest. You can think of it like this:
    • You start with your smooth shell.
    • You draw 24 straight lines on it.
    • Then you “cut out” those lines and study the shape that remains.
    • Two numbers count different aspects of what’s left, and their ratio (slope) is the overall score.
  • “Blowing up” triple points: At the triple-crossing points (where three lines meet), the geometry can be tight and tricky. A standard tool called “blowing up” replaces each triple point with a tiny circle (or a new curve) to spread things out and make counting and measuring more reliable. Think of zooming in and replacing a crowded intersection with a small roundabout to see traffic flows more clearly.
  • Discovery and verification: The authors first used a computer search in a simpler setting (a finite field, which you can imagine as doing math with a fixed set of “clock arithmetic” numbers) to spot a promising pattern. Then they proved everything exactly in the usual setting (ordinary arithmetic over complex numbers). They also provide all the line equations and intersection coordinates, plus code that anyone can run to verify the results.

What they found

Here are the main facts and why they matter:

  1. A clean 24-line arrangement on the Schur quartic
    • The arrangement has exactly 32 triple points and no double or quadruple points among those 24 lines.
    • Every line passes through exactly 4 of these triple points.
    • The arrangement is connected, meaning the lines and their intersection points form a single “piece” rather than several separate clusters.
  2. A high “logarithmic Chern slope”
    • After “blowing up” the 32 triple points and using standard formulas, the authors compute the two key numbers:
      • c1 = 112
      • c2 = 40
      • slope = c1/c2 = 112/40 = 14/5 = 2.8
    • This is important because it beats the suggested upper bound of 8/3 ≈ 2.67 for such arrangements on K3 surfaces. In other words, this example shows the bound 8/3 is not universal in this setting.
  3. It’s half of a larger, symmetric structure
    • The Schur quartic has a known set of 48 special lines (called “lines of the second kind”). The authors show these 48 lines can be split into two equal halves of 24 lines each.
    • Each half is a configuration just like the one they exhibit: 24 lines with 32 triple points internally.
    • Every crossing between a line from one half and a line from the other half is a simple “double” point, and there are exactly 144 such mixed double points.
    • A symmetry (a “projective automorphism,” think of it as a clever 3D transformation) swaps the two halves. So the picture is very balanced.
  4. A neat “slicing” identity
    • The 24 lines together are “equivalent” to six copies of a plane slicing the surface. This is written as D ~ 6H, where D is the sum of the 24 lines and H is the “hyperplane class” (the class of a plane section).
    • In everyday language: although they are 24 thin lines, as a group their overall effect matches six flat cuts through the surface. This identity is a strong geometric fingerprint of the arrangement.

Why this matters

  • It breaks a proposed limit: For K3 surfaces, it was natural to ask whether the slope of such line arrangements is always at most 8/3. This paper provides a clear, explicit counterexample with slope 14/5 = 2.8, so the answer is “no” in general.
  • It gives a precise, checkable model: The authors not only state their result; they also provide exact line equations and all intersection coordinates, plus a simple program to verify every detail. That sets a high standard for reproducibility and helps others build on their work.
  • It reveals hidden structure: Splitting the 48 “second-kind” lines into two neat halves, each with its own internal triple points and a symmetry that swaps the halves, shows the Schur quartic has deeper patterns than just “lots of lines.”
  • It opens new questions: How high can the slope really go for line arrangements on K3 surfaces? Do similar “two-halves” patterns appear on other surfaces rich in lines? Can we describe the splitting into halves using more intrinsic symmetries or algebraic features?

Key takeaways for a young reader

  • The authors found a special way to draw 24 straight lines on a famous curved surface so that the crossings are extremely well organized.
  • When they measure how “complicated” the remaining surface looks after erasing the lines, the score is bigger than what some people expected might be the maximum.
  • Their construction is precise, symmetrical, and completely checked—like solving a clever geometric puzzle and showing all your work.
View Paper Prompt  View All Prompts 

Knowledge Gaps

Knowledge gaps, limitations, and open questions

Below is a concise list of unresolved issues and specific directions that the paper leaves open for future work.

  • Intrinsic characterization of the 24+24 partition of the 48 second-kind lines:
    • Find a group-theoretic or lattice-theoretic description (e.g., via a character of a subgroup of Aut(X) or via a distinguished class in NS(X)) that intrinsically defines the two-coloring, independent of chosen coordinates and field of definition.
    • Determine whether the partition is unique up to Aut(X), and compute the stabilizer subgroup and orbit structure of a half.
  • Classification and enumeration of all 24-line halves:
    • Decide whether every (24₄,32₃) half is Aut(X)-equivalent to the one exhibited, or whether non-isomorphic halves exist.
    • Count the number of admissible decompositions C₂ = D ⊔ D* of the 48 second-kind lines with the property “no internal double points and 144 cross-double points,” and classify them up to projective automorphism.
  • Optimality among line arrangements on the Schur quartic:
    • Determine whether slope 14/5 is maximal for connected transversal line arrangements on the Schur quartic, or exhibit arrangements of lines with even larger slope.
    • Provide an exact, optimizer-independent classification of all maximum-slope subsets of the fixed 64-line configuration (beyond the two numerically found halves), with a combinatorial or geometric proof that no other optimal subsets exist.
  • Beyond lines on the Schur quartic:
    • Investigate whether mixed arrangements of rational curves (e.g., lines plus conics or other rational curves) on X can achieve a slope > 14/5, and classify the maximal slope possible on X over all connected transversal arrangements of rational curves.
  • Global bounds on K3 surfaces:
    • Establish a universal upper bound for the logarithmic Chern slope of connected transversal arrangements of rational curves on K3 surfaces (the 8/3 bound is disproved; a new bound is unknown).
    • Identify geometric constraints that force such a bound (e.g., via lattice theory, log MMP, or refined Miyaoka–Yau–Sakai-type inequalities).
  • Extensions to other line-rich quartic K3 surfaces:
    • Test for analogous 24+24 decompositions of second-kind lines (or comparable large subarrangements with purely internal triple points) on other quartic K3s with many lines (e.g., Fermat quartic, other maximizers).
    • Use D ∼ 6H as a diagnostic: check whether similar divisor-class identities arise for putative halves on other surfaces, and whether they constrain existence/uniqueness.
  • Automorphism group action and structure:
    • Describe the Aut(X)-action on the set of second-kind lines and on the set of all admissible halves; identify how the involution α (diag(1,1,i,i)) sits inside Aut(X) and whether other elements yield distinct decompositions.
    • Compute the full stabilizer of the 24-line half and its induced action on the incidence graph.
  • Arithmetic and fields of definition:
    • Determine the minimal field of definition of a half D and of the pair (D, D*); clarify the Galois action on halves and on the 48 second-kind lines.
    • Decide whether a half can be defined over Q (or another smaller field), and study how halves behave under reduction modulo primes (e.g., lifting and specialization patterns).
  • Lattice-theoretic data of the configuration:
    • Compute the sublattice of NS(X) generated by the 24 lines (and, after blow-up, by strict transforms and exceptional curves); determine its rank, discriminant form, and embedding in NS(X).
    • Relate D ∼ 6H and the intersection matrix to intrinsic lattice constraints that might characterize such halves.
  • Log surface geometry beyond numerical invariants:
    • Analyze the linear systems |m(K_Y + B)| (base loci, maps, volumes) and describe the log canonical model of (Y, B); determine whether any canonical birational features characterize the configuration.
    • Study the topology of the complement X \ D (e.g., fundamental group, higher Betti numbers), not just euler characteristic, and compare with known hyperbolic-type uniformizations. Clarify whether any rigidity phenomena occur despite c₁² < 3c₂.
  • Combinatorial characterization inside the 48-line configuration:
    • Give a purely combinatorial criterion on the 48-line incidence graph that detects admissible halves (e.g., forbidden patterns of internal double points), and prove existence/uniqueness from graph-theoretic properties alone.
  • Computational certification:
    • Replace floating-point MILP evidence with exact certification (e.g., exact branch-and-bound or purely combinatorial arguments) to conclusively classify all optimal subsets within the 64-line incidence structure.
    • Develop scalable exact-search methods for larger or different incidence structures (e.g., other quartics or mixed curve systems).
  • Deformation and moduli questions:
    • Determine whether the (24₄,32₃) configuration deforms in moduli (within the Schur quartic or nearby quartics), or if it is rigid; identify loci in the K3 moduli where analogous halves appear.
View Paper Prompt  View All Prompts 

Practical Applications

Immediate Applications

The paper’s contributions are both mathematical (an explicit high-slope log pair on a K3 surface) and methodological (a reproducible discovery-to-proof workflow that blends finite-field enumeration, mixed-integer optimization, and exact arithmetic verification). The following items are deployable now.

  • Reproducible “certificate-first” workflow for computational results
    • Sectors: academia, software engineering, policy (open science)
    • What: Package results with a machine-checkable JSON certificate, a standard-library-only verifier (Python), and cryptographic hashes (SHA-256) to make claims independently verifiable without proprietary tools.
    • Tools/workflows: JSON-encoded incidence/line data, exact arithmetic over Q(i,√3) in pure Python, Magma cross-checks, manifest with checksums.
    • Assumptions/dependencies: Accurate encoding of artifacts; long-term archival of code/data; reviewers willing to run the standard-library checker.
  • MILP template for selecting extremal substructures with fractional objectives
    • Sectors: operations research, EDA/CAD, logistics/telecom, software
    • What: Ready-to-adapt modeling pattern using McCormick linearization (binary products), one-hot multiplicity variables, and Dinkelbach iteration for ratio objectives; “no-good” cuts for enumerating distinct optima.
    • Tools/workflows: HiGHS (or any MIP solver), Dinkelbach loop qc − p c°, binary linearizations (McCormick), one-hot equalities, exclusion cuts.
    • Assumptions/dependencies: Incidence data available in combinatorial form; objective expressible as a linear fractional ratio; solver numerics are post-verified.
  • Finite-field enumeration as a rapid discovery engine with exact post-checks
    • Sectors: computational algebra/number theory, cryptanalysis prototyping, combinatorial design
    • What: Exhaustive RREF scanning over Fq to enumerate candidate lines/substructures; incidence extraction; lift candidates to characteristic 0 and certify with exact arithmetic.
    • Tools/workflows: Magma or SageMath for finite-field enumeration; exact characteristic-0 verification via standard-library code.
    • Assumptions/dependencies: Lift does not automatically hold; requires a separate exact certificate; relies on smooth reductions and careful choice of primes.
  • Incidence-graph QA for complex geometric/combinatorial datasets
    • Sectors: CAD/EDA, knowledge graphs, data validation
    • What: Use graph triangles to encode triple incidences, spanning trees to verify connectedness, and determinant tests for exact adjacency; serve as automated integrity checks on high-dimensional configurations.
    • Tools/workflows: Determinant-based intersection tests, graph construction, connectedness and transversality checks.
    • Assumptions/dependencies: Data admits a consistent algebraic representation; numeric tolerances replaced by exact arithmetic to avoid false positives.
  • Benchmarks for optimization and exact-arithmetic toolchains
    • Sectors: software (MIP solvers, CAS), academic OR
    • What: Use the released MILP instances and exact-verification code as regression tests for solver correctness and for exact-arithmetic libraries handling algebraic number fields.
    • Tools/workflows: Re-run recorded MILP with fixed seeds/tolerances; compare results to exact certificate; audit logs.
    • Assumptions/dependencies: Deterministic solver settings; stable software versions; consistent numeric tolerances.
  • Educational modules on “weak combinatorics → geometry” and reproducibility
    • Sectors: education (advanced undergraduate/graduate), training for scientific computing
    • What: Teach how log Chern numbers follow from intersection counts; demonstrate a full discovery-to-proof pipeline with open artifacts.
    • Tools/workflows: Classroom notebooks reusing the repository; visualization of incidence graphs; hands-on verification.
    • Assumptions/dependencies: Students have basic algebraic geometry and OR background.
  • Rapid sanity checks for log surfaces via combinatorial counts
    • Sectors: academia (algebraic geometry)
    • What: Use provided formulas to quickly evaluate c1, c2, and the slope from incidence profiles (t2, t3, t4) before investing in heavy computations.
    • Tools/workflows: Ready-to-use equations for K3 line arrangements; small scripts to sweep candidate profiles.
    • Assumptions/dependencies: Arrangement is transversal with ordinary singularities; K3-specific formulas apply.
  • Internal QA templates for model-risk and scientific claims
    • Sectors: fintech model risk, R&D labs
    • What: Separate discovery (numeric optimization) from certification (exact arithmetic + manifest) to keep exploratory code flexible while preserving audit-grade verification.
    • Tools/workflows: Two-phase pipeline; standardized certificate generation and verification step in CI.
    • Assumptions/dependencies: Organizational acceptance of dual-path workflows; minimal overhead to produce certificates.

Long-Term Applications

These require further research, scaling, or standardization before deployment.

  • Automated extremal-geometry search platforms (OR + CAS + AI)
    • Sectors: academia, scientific software
    • What: Generalize the pipeline to scan families of surfaces and curve arrangements, automatically propose high-slope candidates, and certify or refute them.
    • Potential products: “Geometry search engine” combining finite-field scouting, MILP selection, exact verifiers, and interactive visualization.
    • Assumptions/dependencies: Efficient CAS–MIP interfacing; scalable candidate generation; richer certificate schemas.
  • Proof-carrying optimization for regulated domains
    • Sectors: energy grid planning, aviation, finance
    • What: Augment MIP solutions with machine-checkable proof objects (e.g., dual certificates, verifiable cutting-plane logs), analogous to SAT proof certificates, to meet audit and compliance needs.
    • Tools/workflows: Solver-side proof logging; independent proof checkers; domain adapters.
    • Assumptions/dependencies: Community standards for proof formats; solver support; regulator acceptance.
  • Policy frameworks for verifiable computational claims
    • Sectors: policy, research funding, journals
    • What: Require submission of minimal-dependency verification artifacts (data + standard-library checker + hashes) for computational results, improving trust and reusability.
    • Tools/workflows: Journal/funder guidelines; archives with long-term identifiers; automated artifact checks in peer review.
    • Assumptions/dependencies: Incentives for researchers; infrastructure for artifact hosting and curation.
  • Industrial adoption of fractional-objective MIP patterns
    • Sectors: logistics, manufacturing, telecom, sustainability
    • What: Use Dinkelbach-style loops to optimize efficiency ratios (e.g., throughput/energy, profit/risk) where direct linearization is cumbersome.
    • Tools/workflows: Prebuilt wrappers integrating Dinkelbach with mainstream MIP solvers; template libraries.
    • Assumptions/dependencies: Objective structure matches ratio form; convergence and stability monitored; domain-specific constraints encoded.
  • Incidence-structure mining for network design
    • Sectors: IoT, telecom, sensor networks
    • What: Select subgraphs with targeted overlap multiplicities (e.g., triple coverage for fault tolerance) using the paper’s multiplicity-encoding and linearization approach.
    • Tools/workflows: One-hot multiplicity variables; determinant-like constraints adapted to network overlap measures.
    • Assumptions/dependencies: Meaningful translation from algebraic incidences to network overlaps; scalable formulations for large graphs.
  • Finite-field–guided design in coding and combinatorics
    • Sectors: communications, error-correcting codes, experimental design
    • What: Leverage finite-field enumeration to propose structured incidence patterns that inform code constructions or balanced designs, then lift/translate to practical alphabets.
    • Tools/workflows: Enumeration tools; lifting/transformation heuristics; certification of desired properties (distance, girth).
    • Assumptions/dependencies: Mappings from geometric incidences to code/design parameters; feasibility of lifting while preserving structure.
  • CAS–OR–proof integration for moduli-space exploration
    • Sectors: scientific software, academia
    • What: Develop integrated systems that navigate moduli spaces using OR-guided search, CAS-level exactness, and automatic proof/certificate generation.
    • Tools/workflows: Shared intermediate representations; certified arithmetic kernels; proof object standards.
    • Assumptions/dependencies: Interoperability across ecosystems; performance on large-scale instances.
  • Community standards for minimal-dependency verification artifacts
    • Sectors: policy, academia, software
    • What: Normalize manifest files, hashing, and standard-library verifiers to reduce bit-rot and enhance long-term reproducibility across disciplines.
    • Tools/workflows: Schema definitions; repository checkers; training materials.
    • Assumptions/dependencies: Cross-publisher coordination; sustained maintenance of standards.

Notes on feasibility and scope:

  • The mathematical headline (a slope 14/5 log pair on a K3 surface) primarily advances algebraic geometry; its direct industrial impact is modest. However, the discovery/verification methods are broadly transferable.
  • Finite-field discovery does not guarantee characteristic-0 realizability; exact post-verification is a required dependency whenever a lift is claimed.
  • Fractional programming templates assume objective structures compatible with Dinkelbach’s method; otherwise, surrogate formulations or convexification are needed.
  • Proof-carrying optimization requires solver and ecosystem support that is still emerging; policy adoption depends on community consensus.
View Paper Prompt  View All Prompts 

Glossary

  • Adjunction: A formula relating the canonical divisor of a variety to that of a subvariety, often used to compute self-intersection of curves. "Adjunction gives Ci2=−2C_i^2=-2."
  • Big (divisor): A divisor whose Iitaka dimension equals the dimension of the variety; equivalently, it has sufficiently many sections asymptotically. "The boundary BB is semistable and KY+BK_Y+B is big."
  • Blow-up: A birational modification replacing a point (or subvariety) with an exceptional divisor to resolve singularities or separate intersections. "If π:Y→X\pi:Y\to X blows up the triple points and B=(π−1D)redB=(\pi^{-1}D)_{\mathrm{red}}, then"
  • Cyclotomic field: A number field generated by a primitive root of unity. "This is one of the three quadratic subfields of Q(ζ12)=Q(i,3)Q(\zeta_{12})=Q(i,\sqrt3); the other two are Q(i)Q(i) and Q(3)Q(\sqrt3). The cyclotomic field is not needed to define the selected configuration, which is already defined over KK."
  • Effective divisor: A divisor that is a nonnegative linear combination of irreducible subvarieties. "Moreover, KY+B=D′+2∑EpK_Y+B=D'+2\sum E_p is effective and has positive square $112$."
  • Exceptional curve: The irreducible curve introduced by blowing up a point on a surface. "let E1,…,E32E_1,\ldots,E_{32} be the exceptional curves"
  • Euler characteristic: A topological invariant denoted e(⋅)e(\cdot), equal to the alternating sum of Betti numbers; in this context used for complex varieties and complements. "The logarithmic Chern numbers are c1(Y,B)=(KY+B)2,c2(Y,B)=e(Y∖B)=e(S∖C).c_1(Y,B)=(K_Y+B)^2, \qquad c_2(Y,B)=e(Y\setminus B)=e(S\setminus C)."
  • Fermat quartic: The smooth quartic surface defined by a Fermat-type equation, notable for many lines. "Three $32$-line subarrangements of the Fermat quartic attain $8/3$, see~\cite{NaskreckiPokora}."
  • Geometrically smooth: Smooth after base change to an algebraic closure of the ground field. "The surface XX is smooth over QQ, and its reduction modulo $5$ is geometrically smooth."
  • Hyperplane class: The divisor class on a projective variety given by intersection with a hyperplane. "The resulting reduced divisor DD satisfies D∼6HD\sim6H, where HH is the hyperplane class."
  • Inclusion–exclusion principle: A combinatorial identity used to compute the Euler characteristic (or counts) of unions from overlaps. "Inclusion-exclusion gives e(C)=2n−∑r≥2(r−1)tre(C)=2n-\sum_{r\ge2}(r-1)t_r"
  • K3 surface: A smooth, simply connected complex surface with trivial canonical bundle and h1,0=0h^{1,0}=0. "The present paper concerns the specialization of this problem to rational curve arrangements on K3 surfaces"
  • Line of the second kind: A special type of line on a quartic surface characterized by its contact with the surface; on the Schur quartic there are 48 such lines. "Among its $64$ lines, $48$ are of the second kind"
  • Linear equivalence: An equivalence relation on divisors where two divisors differ by the divisor of a rational function. "Thus D∼6HD\sim6H."
  • Log surface: A pair consisting of a smooth surface and a boundary divisor, used in logarithmic birational geometry. "What can be said about the logarithmic Chern slope of the associated log surface?"
  • Logarithmic Bogomolov–Miyaoka–Yau theorem: An inequality bounding c12c_1^2 by 3c23c_2 for certain log surfaces with semistable boundary and big log canonical class. "Sakai's logarithmic Bogomolov--Miyaoka--Yau theorem states that

c1(Y,B)≤3c2(Y,B)c_1(Y,B)\le3c_2(Y,B)

when BB is semistable and κ(Y,KY+B)=2\kappa(Y,K_Y+B)=2,"

  • Logarithmic Chern numbers: The Chern numbers of the log pair (Y,B)(Y,B), namely c1(Y,B)=(KY+B)2c_1(Y,B)=(K_Y+B)^2 and c2(Y,B)=e(Y∖B)c_2(Y,B)=e(Y\setminus B). "The logarithmic Chern numbers are c1(Y,B)=(KY+B)2,c2(Y,B)=e(Y∖B)=e(S∖C).c_1(Y,B)=(K_Y+B)^2, \qquad c_2(Y,B)=e(Y\setminus B)=e(S\setminus C)."
  • Logarithmic Chern slope: The ratio c1(Y,B)/c2(Y,B)c_1(Y,B)/c_2(Y,B) for a log surface, used as a numerical invariant. "with logarithmic Chern slope $14/5$"
  • Mixed-integer search: An optimization search over variables some of which are constrained to be integers, typically via MILP. "A finite-field mixed-integer search is described only as the discovery procedure and is not used in the proof."
  • Néron–Severi group: The group of divisors modulo algebraic equivalence; for K3 surfaces it is torsion-free. "and the N \"eron--Severi group of a K3 surface is torsion-free, numerical and linear equivalence agree here."
  • Numerically trivial: A divisor whose intersection number with every curve is zero. "so EE is numerically trivial."
  • Ordinary triple point: A point where exactly three smooth branches meet transversely. "whose singular locus consists of $32$ ordinary triple points and no other intersections."
  • Picard group: The group of line bundles (divisor classes) on a variety; Pic⁡0\operatorname{Pic}^0 denotes degree-zero line bundles. "Since Pic⁡0(X)=0\operatorname{Pic}^0(X)=0"
  • Projective automorphism: An automorphism of projective space (or a projective variety) induced by an invertible linear transformation. "Thus α\alpha is a projective automorphism of XX."
  • Projective equivalence: Equivalence under projective transformations of the ambient projective space. "the unique smooth complex quartic with $64$ lines up to projective equivalence."
  • Projective linear group (PGL): The group of projective automorphisms, matrices modulo scalars. "α=diag⁡(1,1,i,i)∈PGL⁡4(C).\alpha=\operatorname{diag}(1,1,i,i)\in\operatorname{PGL}_4(\mathbb{C})."
  • Reduced divisor: A divisor with all coefficients equal to 1 (no multiplicities). "The resulting reduced divisor DD satisfies D∼6HD\sim6H"
  • Reduced row-echelon form (RREF): A canonical row-reduced matrix form; here used to represent lines in projective space. "the unique 2×42\times4 RREF representative of each line"
  • Schur quartic: A specific smooth quartic surface in P3\mathbb{P}^3 defined by Schur’s equation. "Let X⊂P3X\subset\mathbb{P}^3 be the Schur quartic"
  • Self-intersection number: The intersection number of a curve with itself on a surface. "Every line on a K3 surface has self-intersection −2-2."
  • Semistable (boundary): An SNC boundary where each rational component meets the rest of the boundary in at least two points. "The boundary BB is semistable"
  • Simple normal crossing (SNC) divisor: A divisor whose components are smooth and meet transversely like coordinate hyperplanes. "A reduced simple-normal-crossing divisor is called semistable"
  • Strict transform: The proper transform of a subvariety under a blow-up, obtained by removing components lying in the exceptional divisor. "let D′D' be the strict transform of DD."
  • Tangent-plane section: The plane section of a surface by its tangent plane at a point. "since all such lines are components of the degree-four tangent-plane section."
  • Transversal arrangement: A collection of smooth curves meeting only in ordinary (transverse) intersections. "A \emph{transversal arrangement} is a finite collection D={C1,…,Cn}D=\{C_1,\ldots,C_n\} of smooth irreducible curves such that distinct components are disjoint or meet with distinct tangent directions, all singularities of the reduced divisor C=∑iCiC=\sum_iC_i are ordinary, and CC is connected."
  • Zariski decomposition: A decomposition of a divisor into a nef part and a negative definite part, used to study bigness and linear systems. "By the surface Zariski-decomposition criterion for bigness, an effective divisor with positive self-intersection is big."
View Paper Prompt  View All Prompts 

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now