ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(x)f(x) be a polynomial of degree nn. For a prime pp in Spl(f)Spl(f), number the roots of f(x)f(x) modulo pp as

0≤r1≤⋯≤rn<p.0\le r_1\le\dots\le r_n<p.

For a subset S⊆{1,2,…,n}S\subseteq\{1,2,\dots,n\}, write Pr(f,S)Pr(f,S) for the limiting frequency table of the quantities ⌈∑i∈Sri/p⌉\left\lceil\sum_{i\in S}r_i/p\right\rceil over splitting primes, when this limit exists. The new density conjecture. Suppose that f(x)f(x) is not equal to g(h(x))g(h(x)) for any quadratic polynomial h(x)h(x). Then, for every jj with 1≤j≤n1\le j\le n, one has

Pr(f,{j,n+1−j})=[1/2,1/2].Pr(f,\{j,n+1-j\})=[1/2,1/2].

Here [1,1]/2[1,1]/2 denotes [1/2,1/2][1/2,1/2]. The statement is presented as a conjecture based on numerical experiments; it predicts an equal limiting frequency for the two possible values of the sum of each symmetric pair of normalized roots, subject to the stated non-composition hypothesis.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.