We discuss quantum non-locality and contextuality using the notion of transition sets [1, 2]. This approach provides a way to obtain a direct logical contradiction with locality/non-contextuality in the EPRB gedanken experiment as well as a clear graphical illustration of what violations of Bell inequalities quantify. In particular, we show graphically how these violations are related to measur...

We introduce a class of independence relations, which include free, boolean and monotone independence, in operator-valued probability. show that this relations have matricial extension property so we can easily study their associated convolutions via Voiculescu's fully function theory. Based the property, many results be generalized to multi-variable cases. Besides additive convolutions, will f...

We investigate properties of strings which are expressible by canonical types string constraints. Specifically, we consider a landscape 20 logical theories, whose syntax is built around combinations four common elements constraints: language membership (e.g. for regular languages), concatenation, equality between terms, and string-lengths. For variable x formula f from given theory, the set val...

Infinite random sequences of letters can be viewed as stochastic chains or as strings produced by a source, in the sense of information theory. The relationship between Variable Length Markov Chains (VLMC) and probabilistic dynamical sources is studied. We establish a probabilistic frame for context trees and VLMC and we prove that any VLMC is a dynamical source for which we explicitly build th...

it is well known that the chemical behavior of a compound is dependent upon the structure of itsmolecules. quantitative structure – activity relationship (qsar) studies and quantitative structure –property relationship (qspr) studies are active areas of chemical research that focus on the nature ofthis dependency. topological indices are the numerical value associated with chemical constitution...

Let G = (V, E) be a simple graph with vertex set V (G) = {v1, v2, . . . , vn} and edge set E(G). In this paper, first some sharp upper and lower bounds on the largest and least eigenvalues of graphs are given when vertices are removed. Some conjectures in [M. Aouchiche. Comparaison Automatisée d’Invariants en Théorie des Graphes. Ph.D. Thesis, École Polytechnique de Montréal, February 2006.] an...