Bijective mapping preserving intersecting antichains for k-valued cubes

TL;DR

This paper establishes a bijective correspondence between intersecting antichains in certain subsets of k-valued n-cubes and those in (n-1)-cubes, generalizing previous results in combinatorics.

Contribution

It introduces a new bijective mapping that preserves intersecting antichains across different dimensions of k-valued cubes, extending prior work.

Findings

Proves the existence of a bijection between specific antichains in k-valued n-cubes and (n-1)-cubes.

Generalizes a known combinatorial result to k-valued cubes.

Provides a new tool for analyzing intersecting antichains in higher-dimensional cubes.

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.