An asymptotic complete intersection theorem for chain products (Q1304427)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asymptotic complete intersection theorem for chain products |
scientific article; zbMATH DE number 1339807
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic complete intersection theorem for chain products |
scientific article; zbMATH DE number 1339807 |
Statements
An asymptotic complete intersection theorem for chain products (English)
0 references
11 May 2000
0 references
One of the most studied structures in extreme set theory is the poset of chain products (or generalized Boolean algebra, or sequence space, mentioning just some of its numerous names). The objects are \(n\)-sequences, while the coordinates can be choosen from \(0,1,\ldots,k\), and the total sum of the coordinates is constant. Finally two sequences are \(t\)-intersecting if and only if their supports (sets of non-zero coordinates) have at least \(t\) coordinates in common. (It is also known as dynamical \(t\) intersection.) This paper gives an asymptotic complete \(t\)-intersection theorem in this structure in the soul of the seminal Ahlswede-Khachatrian theorem.
0 references
chain product
0 references
generalized Boolean lattice
0 references
Erdős-Ko-Rado theorem
0 references
0.7892580032348633
0 references
0.7881247997283936
0 references
0.7795383930206299
0 references
0.7720367908477783
0 references
0.7481849789619446
0 references