arXiv · 1711.05673
Counting factorisations of monomials over rings of integers modulo $N$
Abstract
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^α\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number of solutions to a certain system of polynomial congruences. The method also applies to more general systems of polynomial congruences that satisfy a non-degeneracy hypothesis.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jonathan Hickman, James Wright. 2017-11-15. Counting factorisations of monomials over rings of integers modulo $N$. https://arxiv.org/abs/1711.05673
Cite the original work for its findings. Save a collection to share your selection of sources.