Building on recent work of Robertson and Steger, we associate a C∗–algebra to a combinatorial object which may be thought of as a higher rank graph. This C∗–algebra is shown to be isomorphic to that of the associated path groupoid. Various results in this paper give sufficient conditions on the higher rank graph for the associated C∗–algebra to be: simple, purely infinite and AF. Results concer...

We show, using the no–disentanglement theorem, that to teleport (exactly) any set of non–commuting states (i.e., a set containing at least two non–commuting states), it is necessary to have an entangled channel. We further show that to teleport any set of commuting states it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any ...

Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...

OBJECTIVES Given the link between active commuting and physical activity, this study examined factors associated with active commuting among a nationally representative sample of Canadian youth. METHODS Using data from the 2010-11 Youth Smoking Survey, this study examined different forms of commuting (active, inactive, mixed) and factors associated with either mixed or active commuting among ...

let $r$ be an associative ring with identity and $z^*(r)$ be its set of non-zero zero divisors.  the zero-divisor graph of $r$, denoted by $gamma(r)$, is the graph whose vertices are the non-zero  zero-divisors of  $r$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$.  in this paper, we bring some results about undirected zero-divisor graph of a monoid ring ov...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

This research uses an ordered-response model to evaluate the factors that impact bicycle frequency use for an individual’s commute to and from work. The data used for this paper were gathered during an original survey effort conducted over the Internet in 2002. The paper presents empirical results and discusses the policy implications of these results for urban planning. In addition, the paper ...