✦ LIBER ✦

On reconstructive sets of vertices in the Boolean cube

✍ Scribed by Vasil’eva, A. Yu.

Book ID: 118726216
Publisher: Pleiades Publishing
Year: 2012
Tongue: English
Weight: 496 KB
Volume: 6
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478912030155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the weak isometries of the Boolean cu

On the weak isometries of the Boolean cube

✍ V. Yu. Krasin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 400 KB

On Codes Identifying Sets of Vertices in

On Codes Identifying Sets of Vertices in Hamming Spaces

✍ Iiro Honkala; Tero Laihonen; Sanna Ranto 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 98 KB

The successive splitting of vertices of

The successive splitting of vertices of an n-dimensional unit cube into chains and decoding problems of monotonic boolean functions

✍ G.P. Tonoyan 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 783 KB

On the width of ordered sets and Boolean

On the width of ordered sets and Boolean algebras

✍ E. C. Milner; M. Pouzet 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 683 KB

On orientation-preserving automorphisms

On orientation-preserving automorphisms of Hamiltonian cycles in theN-dimensional Boolean cube

✍ A. L. Perezhogin 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 486 KB

On defining sets of vertices of the hype

On defining sets of vertices of the hypercube by linear inequalities

✍ R.G. Jeroslow 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 708 KB

This paper skws that for any su Dset S of vertices of the m-dimensional hypercube, L!!d(S) G P-1 \* ~%e.-e ind(SS is the rtMxnwm number of tinear inequz!ities needed to define S. I:'urthermare, for any k in the range 1 c k r? 2n-1, there is an S with ind(S) = k, with the defining inequalities taken