ICTS:31782

Kneser's theorem for codes and $\ell$-divisible set families

APA

(2025). Kneser's theorem for codes and $\ell$-divisible set families. SciVideos. https://youtube.com/live/mk3ehwOcNO4

MLA

Kneser's theorem for codes and $\ell$-divisible set families. SciVideos, May. 04, 2025, https://youtube.com/live/mk3ehwOcNO4

BibTex

          @misc{ scivideos_ICTS:31782,
            doi = {},
            url = {https://youtube.com/live/mk3ehwOcNO4},
            author = {},
            keywords = {},
            language = {en},
            title = {Kneser{\textquoteright}s theorem for codes and  $\ell$-divisible set families},
            publisher = {},
            year = {2025},
            month = {may},
            note = {ICTS:31782 see, \url{https://scivideos.org/icts-tifr/31782}}
          }
          
Gilles Zémor
Talk numberICTS:31782
Source RepositoryICTS-TIFR

Abstract

A k-wise m-divisible set family is a collection F of subsets of {1,...,n} such that any intersection of k sets in F has cardinality divisible by m. If k=m=2, it is well-known that |F|