Cross-intersecting integer sequences
Abstract
We call (a1, …, an) an r-partial sequence if exactly r of its entries are positive integers and the rest are all zero. For c = (c1, …, cn) with 1 ≤ c1 ≤ … ≤ cn, let S c(r) be the set of r-partial sequences (a1, …, an) with 0 ≤ ai ≤ ci for each i in \1, …, n\, and let S c(r)(1) be the set of members of S c(r) which have a1 = 1. We say that (a1, …, an) meets (b1, …, bm) if ai = bi ≠ 0 for some i. Two sets A and B of sequences are said to be cross-intersecting if each sequence in A meets each sequence in B. Let d = (d1, …, dm) with 1 ≤ d1 ≤ … ≤ dm. Let A ⊂eq S c(r) and B ⊂eq S d(s) such that A and B are cross-intersecting. We show that |A||B| ≤ |S c(r)(1)||S d(s)(1)| if either c1 ≥ 3 and d1 ≥ 3 or c = d and r = s = n. We also determine the cases of equality. We obtain this by proving a general cross-intersection theorem for weighted sets. The bound generalises to one for k ≥ 2 cross-intersecting sets.
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.