Inequalities for two systems of subspaces with prescribed intersections
G\'abor Heged\"us

TL;DR
This paper introduces bounds on the size of specific systems of subspaces within a linear space, focusing on weak ISP and (u,v)-systems with prescribed intersections.
Contribution
It defines weak ISP and (u,v)-systems of subspaces and establishes upper bounds for their sizes, advancing understanding of subspace intersection properties.
Findings
Upper bounds for weak ISP-systems
Upper bounds for weak (u,v)-systems
Framework for analyzing subspace intersection inequalities
Abstract
Let denote a linear space over a fixed field . We define the notions of weak -system and weak -system of subspaces of . We give upper bounds for the size of weak -systems and weak -systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
