Counting factorisations of monomials over rings of integers modulo N

被引：0
|
作者：
Hickman, Jonathan [1 ]
Wright, James [2 ,3 ]
机构：
[1] Univ St Andrews, Math Inst, St Andrews KY16 9SS, Fife, Scotland
[2] Univ Edinburgh, Maxwell Inst Math Sci, JCMB, Kings Bldg,Peter Guthrie Tait Rd, Edinburgh EH9 3FD, Midlothian, Scotland
[3] Univ Edinburgh, Sch Math, JCMB, Kings Bldg,Peter Guthrie Tait Rd, Edinburgh EH9 3FD, Midlothian, Scotland
来源：
JOURNAL DE THEORIE DES NOMBRES DE BORDEAUX | 2019年 / 31卷 / 01期
基金：
美国国家科学基金会;
关键词：
SUMS; SPERBER; DENEF;
D O I：
10.5802/jtnb.1079
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A sharp bound is obtained for the number of ways to express the monomial X-n as a product of linear factors over Z/p(alpha)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.
引用
收藏
页码：255 / 282
页数：28
相关论文
共 50 条
  • [31] The Polychromatic Number of Small Subsets of the Integers Modulo n
    Curl, Emelie
    Goldwasser, John
    Sampson, Joe
    Young, Michael
    GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [32] ON THE ORDER OF ODD INTEGERS MODULO 2n
    Jung, Soon-Mo
    Nam, Doyun
    Rassias, Michael Th
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2019, 13 (02) : 619 - 631
  • [33] The Polychromatic Number of Small Subsets of the Integers Modulo n
    Emelie Curl
    John Goldwasser
    Joe Sampson
    Michael Young
    Graphs and Combinatorics, 2022, 38
  • [34] MODULO COUNTING QUANTIFIERS OVER FINITE TREES
    POTTHOFF, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 581 : 265 - 278
  • [35] General Linear Group over a Ring of Integers of Modulo k
    Han, Juncheol
    KYUNGPOOK MATHEMATICAL JOURNAL, 2006, 46 (02): : 255 - 260
  • [36] A Tighter Bound for the Character Sum of Primitive Sequences over Residue Rings Modulo Square-Free Odd Integers
    Wang, Lin
    Zhou, Yu
    Gao, Ying
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (01): : 246 - 249
  • [37] Trivial units for group rings over rings of algebraic integers
    Herman, A
    Li, YL
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2006, 134 (03) : 631 - 635
  • [38] Counting codes over rings
    Dougherty, Steven T.
    Salturk, Esengul
    DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 151 - 165
  • [39] Counting codes over rings
    Steven T. Dougherty
    Esengül Saltürk
    Designs, Codes and Cryptography, 2014, 73 : 151 - 165
  • [40] Polynomial multiple recurrence over rings of integers
    Bergelson, Vitaly
    Robertson, Donald
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2016, 36 : 1354 - 1378
12345