Sharpness of the divisor concentration bounds
Statement
Let , where is the equal-sums exponent for logarithmic random sets. For an integer , let denote the maximum number of divisors of having a common value of the relevant size parameter; for a permutation , let be the maximum number of products of subsets of its cycles having the same length; and for a polynomial , let be the maximum number of divisors of having the same degree. Sharpness conjecture. The lower bounds for these quantities are sharp: for almost all , for of the permutations , and for almost all degree- polynomials over . Here denotes a function of tending to as . These conjectured asymptotics would identify the optimal exponent in the divisor-concentration results, conditional on the corresponding asymptotics for ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.