Counting integers representable as images of polynomials modulo n

MaRDI QIDQ5236587zbMATH OpenFDO

Authors Fabián Arias, Jerson Borja, Luis Rubio

Publication date 9 October 2019

Full work available at URL https://arxiv.org/abs/1812.11599, https://cs.uwaterloo.ca/journals/JIS/VOL22/Borja/borja3.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

polynomial congruencerecurrence formulasum of squares

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Additive bases, including sumsets (11B13) Recurrences (11B37) Sums of squares and representations by other particular quadratic forms (11E25)

Abstract: Given a polynomial $f(x_1,x_2,ldots,x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $alpha(n)$ be the number of integers $0leqa<n$ such that the polynomial congruence $f(x_1,x_2,ldots,x_t)equiva(modn)$ is solvable. We describe a method that allows to determine the function $alpha$ associated to polynomials of the form $c_1{x}_1^k+c_2{x}_2^k+cdots+c_t{x}_t^k$. Then we apply this method to polynomials that involve sums and differences of squares, mainly to the polynomials $x^2+y^2,x^2-y^2$ and $x^2+y^2+z^2$.

Recommendations

• Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)
• The representation function for sums of three squares along arithmetic progressions
• On representations of positive integers as a sum of two polynomials. II
• On binary quadratic forms modulo \(n\)
• scientific article; zbMATH DE number 3842011

Cites work

• scientific article; zbMATH DE number 2186860 (Why is no real title available?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• Representing integers as the sum of two squares in the ring Z_n

Cited in

(2)

• On polynomial congruences
• Counting integers representable as sums of k-th powers modulo n

This page was built for publication: Counting integers representable as images of polynomials modulo \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236587)