Counting factorisations of monomials over rings of integers modulo N

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

A sharp bound is obtained for the number of ways to express the monomial Xn as a product of linear factors over Z/pα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.
Original languageEnglish
Pages (from-to)255-282
JournalJournal de Théorie des Nombres
Volume31
Issue number1
DOIs
Publication statusPublished - 28 Jul 2019

Fingerprint

Dive into the research topics of 'Counting factorisations of monomials over rings of integers modulo N'. Together they form a unique fingerprint.

Cite this