Vector sum-intersection theorems
From MaRDI portal
Publication:6172276
Abstract: We introduce the following generalization of set intersection via characteristic vectors: for a family of vectors is said to be emph{-sum -intersecting} if for any distinct there exist at least coordinates, where the entries of and sum up to at least , i.e. . The original set intersection corresponds to the case . We address analogs of several variants of classical results in this setting: the ErdH{o}s--Ko--Rado theorem and the theorem of Bollob'as on intersecting set pairs.
Recommendations
- Intersection theorems for vector spaces
- scientific article; zbMATH DE number 4214176
- A vector-sum theorem in two-dimensional space
- Some intersection theorems
- scientific article; zbMATH DE number 3985382
- An intersection theorem and related problems
- scientific article; zbMATH DE number 5510826
- Intersection theorems under dimension constraints
- scientific article; zbMATH DE number 1409180
- An intersection theorem for topological vector spaces and applications
Cites work
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 736306 (Why is no real title available?)
- scientific article; zbMATH DE number 878901 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- A generalization of a combinatorial theorem of macaulay
- Erdős-Ko-Rado from Kruskal-Katona
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Inequalities for two set systems with prescribed intersections
- Intersection problems in the q-ary cube
- Intersection theorems for systems of finite sets
- On families of weakly cross-intersecting set-pairs
- On generalized graphs
- On intersecting families of finite sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
- The Erdős-Ko-Rado theorem for integer sequences
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
Cited in
(2)
This page was built for publication: Vector sum-intersection theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172276)