An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
From MaRDI portal
Publication:6060360
DOI10.1145/3597066.3597115OpenAlexW4383222057MaRDI QIDQ6060360
Sayak Chakrabarti, Nitin Saxena
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597115
treezeta functiondeterministicpolynomialbivariate\(p\)-adicroot-findingroot-countingprime-powerIgusa
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single-factor lifting and factorization of polynomials over local fields
- The rationality of the Poincaré series associated to the p-adic points on a variety
- On algorithms to find \(p\)-ordering
- Roots of polynomials modulo prime powers
- Solvability of systems of polynomial congruences modulo a large prime
- Newton polyhedra and Igusa's local zeta function
- Counting points on elliptic curves over finite fields
- Computing zeta functions of large polynomial systems over finite fields
- Efficiently factoring polynomials modulo \(p^4\)
- Polynomial root finding over local rings and application to error correcting codes
- Algorithms for modular counting of roots of multivariate polynomials
- On Hensel factorization. I
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
- Computing all factorizations in ***
- Fast Polynomial Factorization and Modular Composition
- A Recursive Method for Computing Zeta Functions of Varieties
- Computing zeta functions of arithmetic schemes
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Factoring polynomials over finite fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Some Observations on Higher Degree Characters
- A Remark on the Hensel Factorization Method
- Counting Points on Elliptic Curves Over F 2 m
- Beating Brute Force for Systems of Polynomial Equations over Finite Fields
- Complex powers and asymptotic expansions. I. Functions of certain types.
- An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers
- Fast Computation of the Roots of Polynomials Over the Ring of Power Series
- Factorization of Polynomials over Z/(p n )
- Randomized polynomial-time root counting in prime power rings
- Algorithmic Number Theory
- Factoring Polynomials Over Large Finite Fields
- A CRITERION FOR THE p-ADIC SOLUBILITY OF DIOPHANTINE EQUATIONS
- Automata, Languages and Programming
- Computing Igusa’s local zeta function of univariates in deterministic polynomial-time
- Root sets of polynomials modulo prime powers
- Counting roots for polynomials modulo prime powers
