On the Mod-6 Town Rules

Sundar Vishwanathan

On the Mod-6 Town Rules

Combinatorics 2024-02-05 v2 Discrete Mathematics

Authors: Sundar Vishwanathan

Abstract

This note presents an upper bound of $1.252 n$ on the size of a set system that satisfies the mod-6 town rules. Under these rules the sizes of the sets are not congruent to $0\bmod 6$ while the sizes of all pairwise intersections are congruent to $0\bmod 6$ .

Cite

@article{arxiv.2401.17112,
  title  = {On the Mod-6 Town Rules},
  author = {Sundar Vishwanathan},
  journal= {arXiv preprint arXiv:2401.17112},
  year   = {2024}
}

Comments

Bug. Lemma 1 is incorrect. The lemma needs the sets to be closed under subtraction which they are not

Related papers

View all related →