Counting roots for polynomials modulo prime powers

DOI10.2140/obs.2019.2.191arXiv1711.01355OpenAlexW3099599705MaRDI QIDQ6165864

J. Maurice Rojas, Shuhong Gao, Daqing Wan, Qi Cheng

Publication date: 2 August 2023

Published in: The Open Book Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01355

zbMATH Keywords

polynomialsprime powerroot counting

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Solving polynomial systems; resultants (13P15)

Related Items (4)

On algorithms to find \(p\)-ordering ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Noisy polynomial interpolation modulo prime powers ⋮ Randomized polynomial-time root counting in prime power rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic root finding over finite fields using Graeffe transforms
• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
• Single-factor lifting and factorization of polynomials over local fields
• Factoring polynomials with rational coefficients
• Factoring modular polynomials
• \(p\)-adic numbers: An introduction.
• Counting solutions to equations in many variables over finite fields
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Sparse univariate polynomials with many roots over finite fields
• Polynomial root finding over local rings and application to error correcting codes
• A new incremental algorithm for computing Groebner bases
• Fast Polynomial Factorization and Modular Composition
• Computing zeta functions of nondegenerate curves
• A new framework for computing Gröbner bases
• Complex powers and asymptotic expansions. I. Functions of certain types.
• Heuristics for the Brauer–Manin Obstruction for Curves
• On the deterministic complexity of factoring polynomials

This page was built for publication: Counting roots for polynomials modulo prime powers