Reduzibilität ebener Kurven.

DOI10.1515/crll.1986.369.167zbMath0584.14012OpenAlexW4240478737MaRDI QIDQ3708901

Wolfgang M. Ruppert

Publication date: 1986

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/152855

zbMATH Keywords

reduction modulo pBouniakowsky conjecturereducibility of plane algebraic curves

Mathematics Subject Classification ID

Special algebraic curves and curves of low genus (14H45) Complete intersections (14M10) Algebraic functions and function fields in algebraic geometry (14H05)

Related Items (29)

Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Families of polynomials and their specializations ⋮ On the reduction modulo \(p\) of an absolutely irreducible polynomial \(f(x,y)\) ⋮ A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Irreducibility of polynomials modulo \(p\) via Newton polytopes. ⋮ Symbolic computations of first integrals for polynomial vector fields ⋮ Points of bounded height on curves and the dimension growth conjecture over Fq[t$\mathbb {F}_q[t]$] ⋮ On the global determinant method ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ The dimension growth conjecture, polynomial in the degree and without logarithmic factors ⋮ On the total order of reducibility of a pencil of algebraic plane curves ⋮ Mini-workshop: Interactions between low-dimensional topology and complex algebraic geometry. Abstracts from the mini-workshop held October 22--28, 2017 ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Reducibility of rational functions in several variables ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Bounding the number of remarkable values via Jouanolou's theorem ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ The total reducibility order of a polynomial in two variables ⋮ On Functional Graphs of Quadratic Polynomials ⋮ Towards toric absolute factorization ⋮ On certain extremal pencils of curves with respect to the total reducibility order ⋮ Reducibility of polynomials \(f(x,y)\) modulo \(p\) ⋮ Uniform bounds for the number of rational points on varieties over global fields ⋮ Complements to Ample Divisors and Singularities ⋮ Control of the non-geometrically integral reductions

This page was built for publication: Reduzibilität ebener Kurven.