Counting factorisations of monomials over rings of integers modulo N

From MaRDI portal
Publication:2199499




Abstract: A sharp bound is obtained for the number of ways to express the monomial Xn as a product of linear factors over mathbbZ/palphamathbbZ. 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.









This page was built for publication: Counting factorisations of monomials over rings of integers modulo \(N\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199499)