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
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 as a product of linear factors over . 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
- The number of irreducible factors of a polynomial, II
- On the distribution of polynomials having a given number of irreducible factors over finite fields
- scientific article; zbMATH DE number 3773731
- Counting decomposable polynomials with integer coefficients
- Counting polynomials over finite fields with given root multiplicities
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Number of Points of Varieties in Finite Fields
- La conjecture de Weil. I
- A note on simultaneous congruences
- Title not available (Why is that?)
- On the number of points of algebraic sets over finite fields
- Lectures on forms of higher degree. Notes by S. Raghavan
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Igusa and Denef-Sperber conjectures on nondegenerate \(p\)-adic exponential sums
- Exponential sums: questions by Denef, Sperber, and Igusa
- Title not available (Why is that?)
- Analytic van der Corput lemma for \(p\)-adic and \(\mathbf F_q((t))\) oscillatory integrals, singular Fourier transforms, and restriction theorems
- The Fourier restriction and Kakeya problems over rings of integers modulo N
- An abstract \(L^2\) Fourier restriction theorem
- Regular sequences of power sums and complete symmetric polynomials
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)