Subspace variations of the weighted skew Bollob\'as theorem

Abstract

Let V be a finite-dimensional real vector space. A collection P = \(Ai,Bi)\i=1m of pairs of subspaces of V is called a skew Bollob\'as system if (Ai Bi)=0 for each i∈ [m] and (Ai Bj)>0 for all 1≤ i<j ≤ m. Assume that V = V(1) ·s V(r) and P= \(Ai,Bi)\i=1m is a skew Bollob\'as system of subspaces of V satisfying Ai = k=1r (Ai V(k)) and Bi = k=1r (Bi V(k)) for each i∈ [m]. Denote ai,k = (Ai V(k)) and bi,k = (Bi V(k)). Suppose that a1,k ·s am,k and b1,k ·s bm,k for each k∈ [r]. Using the exterior algebraic method developed by Lov\'asz and Scott--Wilmer, we prove that Σi=1m 1Πk=1r ai,k+bi,kai,k 1 . This generalizes the results of Alon (JCTA, 1985) and Scott--Wilmer (JLMS, 2021) to multipart weighted setting. Secondly, we solve a conjecture of Heged\"us (AJC, 2015) concerning projective subspaces, showing that any skew Bollob\'as system of projective subspaces in an n-dimensional projective space contains at most 2n+1 - 2 pairs. Thirdly, we prove that if P= \(Ai,Bi)\i=1m is a skew Bollob\'as system of subspaces of V with ai= (Ai) and bi= (Bi), then Σi=1m 1(ai+ bi+1)ai+biai 1. This gives an extension to the subspace setting of the results of Heged\"us--Frankl (EUJC, 2024) and Yue (DM, 2026). Finally, we extend the above inequality to systems of d-tuples of subspaces, giving a unified bound that implies the corresponding results for d-tuples of subsets.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…