Bijective mapping preserving intersecting antichains for k-valued cubes

2011/11/30 by Roman Glebov, Glebov, Roman
Decision Sciences · Mathematics · #06A07 #06E30 #Combinatorics (math.CO) #FOS: Mathematics #Functional Equations Stability Results #Fuzzy and Soft Set Theory #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.1111.7036

openalex publication_date 2011/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Generalizing a result of Miyakawa, Nozaki, Pogosyan and Rosenberg, we prove that there is a one-to-one correspondence between the set of intersecting antichains in a subset of the lower half of the k-valued n-cube and the set of intersecting antichains in the k-valued (n-1)-cube.

Related

• A fractal perspective on optimal antichains and intersecting subsets of the unit n-cube
• On k-antichains in the unit n-cube
• Forbidding intersection patterns between layers of the cube
• Intervals of Antichains and Their Decompositions
• Antichain Codes