I‑AIMS Institute for Artificial Intelligence
and Mathematical Sciences
/

Elimination Theory in Graded Rings

Shaska

I-AIMS preprint sh-133 · 2026

We present a framework for implicitizing parametrized varieties in weighted projective spaces ℙⁿ_(q,k), preserving weighted homogeneity via two algorithms with explicit degree bounds. The first uses a Veronese-type morphism to ℙⁿₖ for classical elimination, relating weighted and unweighted degrees. The second eliminates directly in the graded ring k_q[x₀, …, xₙ], homogenizing via an auxiliary weight-1 variable to yield a bihomogeneous ideal whose elimination is weighted homogeneous with generators bounded by B(n, d; q̄, D) = (d+1)(q̄ + D)Dᵈ, refined via BKK mixed volumes. The graded method outperforms Veronese when deg(ξᵢ) ≤ m/qᵢ − 1, avoiding degree inflation. We define a grading-compatible weighted resultant, generalizing multigraded versions. Applications compute loci ℒₙ ⊂ ℙ³_((2,4,6,10)) of genus-2 curves with (n,n)-split Jacobians, validating bounds and efficiency.

References

  1. D. A. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 4th ed., Undergraduate Texts in Mathematics, Springer, Cham, 2015.
  2. Tony Shaska, Helmut Voelklein; Elliptic subfields and automorphisms of genus 2 function fields Proceedings of Algebra, arithmetic and geometry with applications, West Lafayette, IN, 2000 (Springer, Berlin, 2004) 703–723
  3. Pierrick Gaudry and Eric Schost. On the invariants of the quotients of the Jacobian of a curvé of genus 2. In Serdar Boztas and Igor E. Shparlinski, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001, Proceedings, volume 2227 of Lecture Notes in Computer Science, pages 373–386. Springer, Berlin, Heidelberg, 2001.
  4. S. Salami and T. Shaska, “Vojta’s conjecture on weighted projective varieties,” Eur. J. Math., vol. 11, no. 1, Paper No. 12, 2025;.
  5. L. Beshaj, J. Gutierrez, and T. Shaska, “Weighted greatest common divisors and weighted heights,” J. Number Theory, vol. 213, pp. 319–346, 2020. (English summary)
  6. Eslam Badr, Elira Shaska, Tony Shaska, Rational Functions on the Projective Line from a Computational Viewpoint (submitted)
  7. I. Kikuchi, A. Kikuchi, “Quantum Computation of Gröbner Basis,” International Research Center for Quantum Technology, Tokyo, August 9, 2022.
  8. T. W. Dubé, “The structure of polynomial ideals and Gröbner bases,” SIAM J. Comput., 19(4):750–773, 1990.
  9. J.-C. Faugère, “A new efficient algorithm for computing Gröbner bases without reduction to zero (F5),” Proc. ISSAC, pp. 75–83, 2002.
  10. L. K. Grover, “A fast quantum mechanical algorithm for database search,” Proc. STOC, pp. 212–219, 1996.
  11. A. W. Harrow, A. Hassidim, S. Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett., 103(15):150502, 2009.
  12. Faugère, J.-C., Safey El Din, M., Verron, T., 2016. On the complexity of computing Gröbner bases for weighted homogeneous systems. J. Symb. Comput. 76, 107–141.
  13. T. Shaska, Genus 2 fields with degree 3 elliptic subfields, Forum Math. 16 (2004), no. 2, 263–280.

All preprints