Regular sets in residue classes (Q1282531): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02310305 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044425172 / rank
 
Normal rank

Latest revision as of 11:05, 30 July 2024

scientific article
Language Label Description Also known as
English
Regular sets in residue classes
scientific article

    Statements

    Regular sets in residue classes (English)
    0 references
    3 October 1999
    0 references
    Let \(E_m\) denote a complete set of residues mod \(m\), \(A\) a subset of \(E_m\) of cardinality \(| A| \). Call the set \(A\) a basis of \(E_m\) of order \(k=k(A)\) if \(k\) is the least positive integer such that all the equations \(x_1+\cdots+x_k\equiv l\mod m\), \(l\in E_m\), are soluble with some \(x_i\in A\), \(i=1\), \dots, \(k\). Finally, a basis is regular modulo \(m\) if \(k\leq c(\log m)(\log | A|)^{-1}\) for some absolute \(c\geq 1\). The function \(k=k(A)\) is the analog of the function \(G(k)\) in Waring's problem and of course it is of interest to know some explicit regular sets. This paper reviews some known results, including the existence of regular sets mod \(p^N\), \(p\) odd prime and \(N\) large, and also in the more general setting of finite groups. The main new result is the proof that if \(p\) is an odd prime, \(\varepsilon>0\) is fixed and \(N\) is large, then for \(m=\varphi(p^N)\) and \(g\) a primitive root mod \(p^N\), the set \(A=\{\text{ind}_g x:\) \((x,p)=1\), \(x=1\), \dots, \([m^\varepsilon]\}\) is regular mod \(m\) with \(k\leq 2(\log m)(\log | A|)^{-1}+3\).
    0 references
    regular sets modulo primes
    0 references
    additive congruences
    0 references
    Waring problem
    0 references
    residue classes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references