Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers

DOI10.1017/S0963548302005242MaRDI QIDQ4796016zbMATH OpenOpenAlexFDO

Authors Samuel Kutin

Publication date 21 June 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548302005242

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10)

Recommendations

• Set systems with restricted intersections modulo prime powers
• All rationals occur as exponents
• On representation of r-th powers by subset sums
• Sum-avoiding subsets
• On the maximum size of (p,Q)-free families
• A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials
• Lower bounds for Turán's problem
• Forbidding just one intersection
• On subset sums of \(r\)-sets
• The complete nontrivial-intersection theorem for systems of finite sets

Cited in

(11)

• Set systems with no union of cardinality 0 modulo \(m\)
• Constructive upper bounds for intersecting set systems
• New complementary sets of length 2ᵐ and size 4
• Constructing Ramsey graphs from Boolean function representations
• scientific article; zbMATH DE number 1088263 (Why is no real title available?)
• Ontology optimization tactics via distance calculating
• Constructing set systems with prescribed intersection sizes
• Set systems with restricted intersections modulo prime powers
• Improved polynomial secret-sharing schemes
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• Invitation to intersection problems for finite sets

This page was built for publication: Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796016)