On the optimal structure of recovering set pairs in lattices: the sandglass conjecture

Ahlswede R, Simonyi G (1994)
Discrete Mathematics 128(1-3): 389-394.

Download
OA
Journal Article | Published | English
Author
;
Abstract
We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requirements in a lattice that can be derived as the product of k finite length chains. The conjecture is proved for k=2.
Publishing Year
ISSN
PUB-ID

Cite this

Ahlswede R, Simonyi G. On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics. 1994;128(1-3):389-394.
Ahlswede, R., & Simonyi, G. (1994). On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics, 128(1-3), 389-394.
Ahlswede, R., and Simonyi, G. (1994). On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics 128, 389-394.
Ahlswede, R., & Simonyi, G., 1994. On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics, 128(1-3), p 389-394.
R. Ahlswede and G. Simonyi, “On the optimal structure of recovering set pairs in lattices: the sandglass conjecture”, Discrete Mathematics, vol. 128, 1994, pp. 389-394.
Ahlswede, R., Simonyi, G.: On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics. 128, 389-394 (1994).
Ahlswede, Rudolf, and Simonyi, Gabor. “On the optimal structure of recovering set pairs in lattices: the sandglass conjecture”. Discrete Mathematics 128.1-3 (1994): 389-394.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar