Counting factorisations of monomials over rings of integers modulo N

From MaRDI portal
Publication:2199499

DOI10.5802/JTNB.1079zbMATH Open1470.11309arXiv1711.05673OpenAlexW2969893466MaRDI QIDQ2199499FDOQ2199499


Authors: Jonathan Hickman, James Wright Edit this on Wikidata


Publication date: 11 September 2020

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

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.


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




Recommendations




Cites Work


Cited In (1)





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)