Geodesic
Strongly cancellative and recovering sets on lattices
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We use information theory to study recovering sets ${\mathbf{R}}_L$ and strongly cancellative sets ${\mathbf{C}}_L$ on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in the papers of Simonyi, Frankl, and Füredi. We mainly focus on the lattices $B_n$ and $D_{l}^{k}$. Specifically, we find upper bounds and constructions for the sets ${\mathbf{R}}_{B_n}$, ${\mathbf{C}}_{B_n}$, and ${\mathbf{C}}_{D_{l}^{k}}$.
DOI : 10.37236/562
Classification : 06B05, 05D05, 94A15
Mots-clés : information theory, recovering sets, strongly cancellative sets, recovering pairs 
@article{10_37236_562,
     author = {Hoda Bidkhori and ShinnYih Huang},
     title = {Strongly cancellative and recovering sets on lattices},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/562},
     zbl = {1230.06003},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/562/}
}
TY  - JOUR
AU  - Hoda Bidkhori
AU  - ShinnYih Huang
TI  - Strongly cancellative and recovering sets on lattices
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/562/
DO  - 10.37236/562
ID  - 10_37236_562
ER  - 
%0 Journal Article
%A Hoda Bidkhori
%A ShinnYih Huang
%T Strongly cancellative and recovering sets on lattices
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/562/
%R 10.37236/562
%F 10_37236_562
Hoda Bidkhori; ShinnYih Huang. Strongly cancellative and recovering sets on lattices. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/562

Cité par Sources :