Frankl-Rödl-type theorems for codes and permutations

DOI10.1090/tran/7015zbMath1350.05170arXiv1402.6294OpenAlexW2964212244MaRDI QIDQ2833012

Eoin Long, Peter Keevash

Publication date: 16 November 2016

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.6294

zbMATH Keywords

forbidden intersectionscodes with forbidden distancesprobabilistic method of dependent random choice

Mathematics Subject Classification ID

Extremal set theory (05D05) Bounds on codes (94B65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (12)

Turán numbers of sunflowers ⋮ Bisecting and \(D\)-secting families for set systems ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ On a Frankl-Wilson theorem ⋮ Forbidden intersections for codes ⋮ System of unbiased representatives for a collection of bicolorings ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Unavoidable hypergraphs ⋮ Fractional \(L\)-intersecting families ⋮ On the partition of an odd number into three primes in a prescribed proportion ⋮ Invitation to intersection problems for finite sets ⋮ Forbidding intersection patterns between layers of the cube

Cites Work

• Unnamed Item
• Unnamed Item
• On sunflowers and matrix multiplication
• On hypergraphs without two edges intersecting in a given number of vertices
• Compressions and isoperimetric inequalities
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Intersection theorems with geometric consequences
• On the maximum number of permutations with given maximal or minimal distance
• The diametric theorem in Hamming spaces---optimal anticodes
• On an isoperimetric problem for Hamming graphs
• A new proof of several inequalities on codes and sets
• Bounds on pairs of families with restricted intersections
• Forbidding just one intersection, for permutations
• Specified intersections
• Dependent random choice
• A Partition Property of Simplices in Euclidean Space
• Forbidden Intersections
• The three primes theorem with almost equal summands
• Intersection theorems for systems of finite sets
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Frankl-Rödl-type theorems for codes and permutations