A labeling of a graph is a function from the vertices of the graph to some finite set. In 1996, Albertson and Collins defined distinguishing labelings of undirected graphs. Their definition easily extends to directed graphs. Let G be a directed graph associated to the k-block presentation of a Bernoulli scheme X . We determine the automorphism group of G, and thus the distinguishing labelings o...

We address the problem of completely characterizing multiparticle states including loss of information to unobserved degrees of freedom. In systems where nonclassical interference plays a role, such as linear-optics quantum gates, such information can degrade interference in two ways, by decoherence and by distinguishing the particles. Distinguishing information, often the limiting factor for q...

The aim of the study was to determine whether phenolic compounds in some varieties of buckwheat, winter and spring barley and peas can be used as factors which distinguish selected cultivars and varieties of plant material. It was observed that the content of total phenolics might be useful as a cultivar-distinguishing factor for all the plant materials analyzed, but it was a distinguishing fac...

The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by the difference from experimental or theoreti...

AIM To evaluate usefulness of single photon emission computed tomography (SPECT) with three-dimensional stereotactic surface projection (3D-SSP) in distinguishing between Alzheimer's disease (AD) and depression. METHODS We studied 43 patients who presented with both depressive symptoms and memory disturbance. Each subject was evaluated using the following: (1) the Minimal Mental State Examina...

The distinguishing number of a group A acting faithfully on a set X, denoted D(A,X), is the least number of colors needed to color the elements of X so that no nonidentity element of A preserves the coloring. Given a map M (an embedding of a graph in a closed surface) with vertex set V and without loops or multiples edges, let D(M) = D(Aut(M), V ), where Aut(M) is the automorphism group of M ; ...