论文信息 - Pairwise colliding permutations and the capacity of infinite graphs

Pairwise colliding permutations and the capacity of infinite graphs

We call two permutations of the first n naturals colliding if they map at least one number to consecutive naturals. We give bounds for the exponential asymptotics of the largest cardinality of any set of pairwise colliding permutations of [n]. We relate this problem to the determination of the Shannon capacity of an infinite graph and initiate the study of analogous problems for infinite graphs with finite chromatic number.

János Körner | Claudia Malvenuto | J. Körner | C. Malvenuto

[1] Gábor Simonyi,et al. A Sperner-Type Theorem and Qualitative Independence , 1992, J. Comb. Theory, Ser. A.

[2] Kenneth Rose,et al. Graph capacities and zero-error transmission over compound channels , 2005, IEEE Transactions on Information Theory.

[3] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[4] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[5] Luisa Gargano,et al. Capacities: From Information Theory to Extremal Set Theory , 1994, J. Comb. Theory, Ser. A.

[6] Claudia Malvenuto,et al. Stable sets of maximal size in Kneser-type graphs , 2004, Eur. J. Comb..

[7] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[8] I. Csiszár,et al. On the capacity of the arbitrarily varying channel for maximum probability of error , 1981 .

[9] Cheng Yeaw Ku,et al. An Erd˝s-Ko-Rado theorem for partial permutations , 2006, Discret. Math..

[10] Luisa Gargano,et al. Sperner capacities , 1993, Graphs Comb..

[11] Aaron D. Wyner,et al. The Zero Error Capacity of a Noisy Channel , 1993 .

[12] Gérard D. Cohen,et al. Zero-error capacities and very different sequences , 1990 .