ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let cn,kc_{n,k} denote the outlying constant, equivalently the greatest common divisor of the coefficients of DDn,kDD_{n,k}, and let νp\nu_p be the pp-adic valuation. The conjecture concerns its prime divisors and valuations.

Double-discriminant constant conjecture. The following hold:

  1. For k>0k>0, cn,kc_{n,k} has the same prime divisors as 2gcd⁡(k,n)2\gcd(k,n), while
cn,0=24⌊(n−1)/2⌋.c_{n,0}=2^{4\left\lfloor (n-1)/2\right\rfloor}.
  1. ν2(cn,k)≥4⌊n−12⌋\nu_2(c_{n,k})\geq 4\left\lfloor\frac{n-1}{2}\right\rfloor, with equality when k=0k=0.
  2. For all nn, kk, and pp, νp(cn,k)\nu_p(c_{n,k}) is a multiple of 2p2p.

These patterns are inferred from computations and compressed-polynomial experiments; for n>6n>6, the tabulated constants are explicitly described as uncertain upper bounds. Thus the proposed complete description remains open.

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.