ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≤nk\leq n be positive integers. Write Zn\mathbb{Z}_{n} for the integers modulo nn, and let Zn(k)\mathbb{Z}_{n}^{(k)} be the set of kk-element subsets of Zn\mathbb{Z}_{n}. A wreath is a set of the form Fπ\mathcal{F}_{\pi} obtained from a permutation π\pi of Zn\mathbb{Z}_{n} by taking the cyclically indexed blocks of kk consecutive values, as defined in the paper.

The wreath conjecture. For any positive integers k≤nk\leq n, there is a decomposition of Zn(k)\mathbb{Z}_{n}^{(k)} 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 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.