Skip to main content

All Questions

16 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
9 votes
0 answers
324 views

Semi-primes represented by quadratic polynomials

According to Lemke-Oliver, irreducible quadratic polynomials $G$ with positive leading coefficient and $\rho(2)<2$, (where $\rho(m)$ denotes the number of incongruent solutions to the congruence $G(...
Delmastro's user avatar
  • 195
8 votes
0 answers
224 views

Is there an approximate formula for the discriminant of a sparse polynomial?

Consider integer polynomials $P \in \mathbb{Z}[X] \setminus \{0\}$ of a degree $D \geq 1$ and without multiple complex roots. Let me introduce a notation $$ d(P) := \frac{1}{D} \log{|\mathrm{Disc}(P)|}...
Vesselin Dimitrov's user avatar
5 votes
0 answers
205 views

Is there a polynomial version of Wilson's theorem which can avoid Cramer flavored conjectures?

Wilson's theorem states that a natural number $n > 1$ is a prime number if and only if the product of all the positive integers less than $n$ is one less than a multiple of $n$. Is there a version ...
Turbo's user avatar
  • 13.9k
4 votes
0 answers
134 views

$\delta$-equidistributed polynomials over finite fields

I'm trying to show that a polynomial over finite (prime) field is "close enough" to being equidistributed over its range. A polynomial $p(\cdot)$ from $\mathbb{F}^n$ to $\mathbb{F}$ is $\...
GWB's user avatar
  • 301
4 votes
0 answers
432 views

square-free parts of values of polynomials

Given a polynomial $f(x) \in \mathbb{Z}[x]$ of degree $d$, consider the following three sets: $$N_1(x) = \#\{k \leq x: f(k) \text{ is square-free}\}$$ $$N_2(x) = \#\{n \leq x: n = f(k) \text{ is ...
stl's user avatar
  • 585
2 votes
0 answers
159 views

Large prime divisors of values of a polynomial, in a given residue class

Let $f(X) \in \mathbb{Z}[X]$ be an irreducible polynomial of degree $d \geq 2$. Let $q \in \mathbb{N}$ be an integer, and let $q \mathbb{Z} + r$ be a residue class that contains infinitely many primes ...
Jakub Konieczny's user avatar
2 votes
0 answers
67 views

Density of integral values of a rational function

Let $\mathbf{x} = (x_1, \cdots, x_n)$, and consider a rational function $F : \mathbb{R}^n \rightarrow \mathbb{R}$ be given by $$\displaystyle F(\mathbf{x}) = \sum_{i = 1}^m \frac{Q_i(x_1, \cdots, x_{...
Stanley Yao Xiao's user avatar
2 votes
0 answers
121 views

How to choose a prime p s.t. n-th cyclotomic polynomial splits into as much as possible irreducible polynomials while p is almost constant size?

The reason I ask this question is that cyclotomic polynomial is critical to the construction of lattice-based cryptography. In most of the existing lattice-based cryptographic schemes, $n$ is usually ...
user67451's user avatar
1 vote
0 answers
323 views

On fifth powers forming a Sidon set

We call a set of natural numbers $\mathcal S$ to be a Sidon Set if $a+b=c+d$ for $a,b,c,d\in \mathcal S$ implies $\{a,b\}=\{c,d\}$. In other words, all pairwise sums are distinct. Erdős conjectured ...
Sayan Dutta's user avatar
1 vote
0 answers
88 views

Distribution of number of integer solutions in box to bivariate polynomials?

Take a bivariate polynomial of degree $d_x+d_y>\max(d_x,d_y)>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree). What is the ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
244 views

Möbius function and polynomials

Let $\mu$ be the Möbius function. It is well known that $\sum_{n|k} \mu(n) = 0$ for $k>1$. What could be said about the polynomials $R_k = \sum_{n|k} \mu(n) x^n$ for $x \in [0,1]$? There does not ...
A413's user avatar
  • 433
1 vote
0 answers
118 views

How many residue classes mod $p$ does the image of a polynomial with integer coefficients occupy? (Status of a question of Chowla)

In his 1952 AMS Bulletin article "The Riemann zeta and allied functions" Chowla asks the following: Given a polynomial $f$ with integer coefficients, how many residue classes mod $p$ does its image ...
Mark Lewko's user avatar
1 vote
0 answers
275 views

Method of Coppersmith optimal for multivariate?

It is shown that Coppersmith method yields optimal integer root extraction for univariate polynomials in https://arxiv.org/abs/1605.08065 and a follow up work attempts this for bivariate polynomials ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
202 views

Prime generating polynomials

Continuation to this previous question. According to Lemke-Oliver, an irreducible polynomial $G$ of degree $g$ with positive leading coefficient and $\Gamma_G\neq0$ (with $\Gamma_G$ a certain factor ...
Delmastro's user avatar
  • 195
0 votes
0 answers
115 views

Maximum number of integer solutions with some size constraints to bivariate polynomials?

Take a bivariate polynomial of total degree $d$ satisfying $d=d_x=d_y>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree). Given a ...
Turbo's user avatar
  • 13.9k
0 votes
0 answers
152 views

On the $\mathsf{LCM}$ of a set of integers defined by moduli of powers

For integers $a,b,t$ define $$\mathcal R_t(a,b)=\{q\in\mathbb Z\cap[1,\min(a^t,b^t)]: a^t\equiv b^t\bmod q\}$$ and $\mathsf{LCM}(\mathcal R_t(a,b))$ to be $\mathsf{LCM}$ of all entries in $\mathcal ...
VS.'s user avatar
  • 1,826