ProbXiv
sign in
Problem archiveProblem record

Statement

An ℓ\ell-Oddtown is a family of subsets of an nn-element set whose set sizes are not divisible by ℓ\ell while all pairwise intersection sizes are. Berlekamp and Graver showed the maximum size is nn for prime ℓ\ell, Babai and Frankl extended this to prime powers and asked whether nn still holds for other moduli, a question open even for ℓ=6\ell = 6. Bukh, Chao and Zheng answer it negatively with an explicit superlinear construction, complemented by new upper bounds.

Record

Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Boris Bukh, Ting-Wei Chao and Zeyu Zheng, using GPT-5.6 Sol

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The lower-bound construction in Section 2 was first proposed by GPT-5.6 Sol in response to prompts from the authors; the upper-bound results were obtained without AI assistance. (The disclosure was added in the paper's second version.)

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.