At present, two types of attainable bounds on the reliability of a general monotone structure are known. Packing bounds are trivial. Untying bounds were obtained by Polesskii in 1997. Their special case, the classical Esary–Proschan bounds, are known since 1963. In the present paper, we introduce the third type of attainable bounds on the reliability of a general monotone structure. We call them difference-untying bounds. They are generalization and improvement of the Oxley–Welsh bounds on the reliability of a homogeneous monotone structure obtained in 1979. An example demonstrating the high quality of difference-untying bounds is given. As a consequence, we obtain new bounds on the number of members of an arbitrary simplicial complex.
Problems of Information Transmission – Springer Journals
Published: Oct 9, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera