✦ LIBER ✦

The combinatorics of binary arrays

✍ Scribed by Man Keung Siu

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 714 KB
Volume: 62
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(97)84208-5

No coin nor oath required. For personal study only.

✦ Synopsis

This paper gives an account of the combinatorics of binary arrays, mainly concerning their randomness properties. In many cases the problem reduces to the investigation on difference sets.

📜 SIMILAR VOLUMES

Combinatorics of the separaion by binary

Combinatorics of the separaion by binary matrices

✍ V Koubek; J Rajlich 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 317 KB

On the Combinatorics of Rooted Binary Ph

On the Combinatorics of Rooted Binary Phylogenetic Trees

✍ YunS. Song 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 253 KB

Optimizing the aperiodic merit factor of

Optimizing the aperiodic merit factor of binary arrays

✍ Leopold Bömer; Markus Antweiler 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 801 KB

Characterisation of some sparse binary s

Characterisation of some sparse binary sequential arrays

✍ Cheryl E. Praeger; Anne Penfold Street 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 209 KB

The combinatorics of splittability

✍ Boaz Tsaban 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 366 KB

The combinatorics of timetabling

✍ D. de Werra 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 714 KB

Various formulations of timetabling problems are given in terms of coloring problems in graphs. We consider a collection of simple class-teacher timetabling problems and review complexity issues for these formulations. This tutorial presentation (which is not claimed to be an exhaustive review nor a