ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD and KK be parameters of the set XKD\mathbf{X}^D_K, and let nn be such that K=n+1K=n+1. A subset size is a cardinality attained by a subset of XKD\mathbf{X}^D_K.

Monotonicity conjecture. For given values of DD and K=n+1K=n+1, the minimum number of subsets of different sizes in XKD\mathbf{X}^D_K is at least equal to the number of subsets of different sizes when K=nK=n.

The conjecture concerns how the possible subset-size counts change under one further subdivision of the ZZ-curve; the supplied text gives observational motivation but no proof or resolution.

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.