A measurement has been proposed by B. d'Espagnat that would distinguish ensembles described by the same density matrix. This proposal is made precise and shown why it does not work in cases analogous to the EPR experiment .

A measurement has been proposed by B. d'Espagnat that would distinguish from one another some ensembles that are differently prepared but correspond to the same density matrix. Here, the idea is modified so that it becomes applicable to much more general situations. The method is illustrated in simple examples. Some matter of concern might then be that information could be transmitted by method...

An inguinal hernia was clinically diagnosed as direct or indirect by paired surgeons of 134 occasions. When compared with the findings at operation the hernia was correctly diagnosed in 60 of 78 observations when it was indirect and in 33 of 56 when it was direct. The level of accuracy does not warrant continuing the practice of attempting to distinguish one type of inguinal hernia from another.

The activity of many proteins, including metabolic enzymes, molecular machines, and ion channels, is often regulated by conformational changes that are induced or stabilized by ligand binding. In cases of multimeric proteins, such allosteric regulation has often been described by the concerted Monod-Wyman-Changeux and sequential Koshland-Némethy-Filmer classic models of cooperativity. Despite t...

The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling of the vertices of G which is not preserved by any nontrivial automorphism. For a graph G let G be the rth power of G with respect to the Cartesian product. It is proved that D(G) = 2 for any connected graph G with at least 3 vertices and for any r ≥ 3. This confirms and strengthens a conjecture o...

1 The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling 2 of the vertices of G which is not preserved by any nontrivial automorphism. For a graph G let Gr 3 be the r th power of G with respect to the Cartesian product. It is proved that D(Gr ) = 2 for any 4 connected graph G with at least 3 vertices and for any r ≥ 3. This confirms and strengthens a ...