A cross-intersection theorem for vector spaces based on semidefinite programming

DOI10.1112/blms/bdt101zbMath1285.05181arXiv1304.5466OpenAlexW3099904847MaRDI QIDQ5409116

Hajime Tanaka, Sho Suda

Publication date: 14 April 2014

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Lovász's theta functionoptimal feasible solutions to a semidefinite programming problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Combinatorial optimization (90C27) Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

A semidefinite programming approach to a cross-intersection problem with measures ⋮ The proportion of non-degenerate complementary subspaces in classical spaces ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ The maximum measure of non-trivial 3-wise intersecting families ⋮ The maximum product of weights of cross-intersecting families ⋮ An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Invitation to intersection problems for finite sets ⋮ A cross‐intersection theorem for subsets of a set ⋮ \(r\)-cross \(t\)-intersecting families for vector spaces

Cites Work

• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• The subconstituent algebra of an association scheme. I
• The exact bound in the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Independent sets in association schemes
• The Erdős-Ko-Rado theorem for vector spaces
• Coherent algebras
• Shadows and intersections in vector spaces
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: A cross-intersection theorem for vector spaces based on semidefinite programming