A Note on Ternary Sequences of Strings of 0 and 1
| dc.creator | Mehta, A. R. | |
| dc.creator | Vijayakumar, G. R. | |
| dc.date | 2008-03-28 | |
| dc.date | 2008-04-05 | |
| dc.date.accessioned | 2026-07-07T09:30:13Z | |
| dc.date.available | 2026-07-07T09:30:13Z | |
| dc.description | B. D. Acharya has conjectured that if $\bigl(A_i: i=1, 2, ..., 2^{|X|}-1\bigr)$ is a permutation of all nonempty subsets of a set $X$ with at least two elements such that for each even positive integer $j<2^{|X|}-1$, $A_{j-1}\triangle A_j\triangle A_{j+1}=\emptyset$, then $|X|=2$. In this article, we show that if the cardinality of a set $X$ is more than four, then a permutation as described above indeed exists. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/0803.4079 | |
| dc.identifier | http://arxiv.org/abs/0803.4079 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158060 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B99; 08A99 | |
| dc.title | A Note on Ternary Sequences of Strings of 0 and 1 | |
| dc.type | text |