Baranyai–Katona wreath conjecture
Statement
Let be positive integers. Write for the integers modulo , and let be the set of -element subsets of . A wreath is a set of the form obtained from a permutation of by taking the cyclically indexed blocks of consecutive values, as defined in the paper.
The wreath conjecture. For any positive integers , there is a decomposition of into disjoint wreaths.
This conjecture generalizes Baranyai's factorization theorem for complete uniform hypergraphs. It was posed by Baranyai and reformulated in terms of wreaths by Katona; the source does not state a 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.