ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ζ=lim sup⁡k→∞log⁡klog⁡(1/βk)\zeta=\limsup_{k\to\infty}\frac{\log k}{\log(1/\beta_k)}, where βk\beta_k is the equal-sums exponent for logarithmic random sets. For an integer nn, let Δ(n)\Delta(n) denote the maximum number of divisors of nn having a common value of the relevant size parameter; for a permutation σ∈Sn\sigma\in S_n, let Δ(σ)\Delta(\sigma) be the maximum number of products of subsets of its cycles having the same length; and for a polynomial f∈Fq[t]f\in\mathbb F_q[t], let Δ(f)\Delta(f) be the maximum number of divisors of ff having the same degree. Sharpness conjecture. The lower bounds for these quantities are sharp: Δ(n)=(log⁡log⁡n)ζ+o(1)\Delta(n)=(\log\log n)^{\zeta+o(1)} for almost all nn, Δ(σ)=(log⁡σ)ζ+o(1)\Delta(\sigma)=(\log\sigma)^{\zeta+o(1)} for (1+o(1))n!(1+o(1))n! of the permutations σ∈Sn\sigma\in S_n, and Δ(f)=(log⁡n)ζ+o(1)\Delta(f)=(\log n)^{\zeta+o(1)} for almost all degree-nn polynomials over Fq\mathbb F_q. Here o(1)o(1) denotes a function of nn tending to 00 as n→∞n\to\infty. These conjectured asymptotics would identify the optimal exponent in the divisor-concentration results, conditional on the corresponding asymptotics for βk\beta_k; the paper proves only the displayed lower bounds.

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.