No abstract uploaded!

An axiomatic formulation is presented for point processes which may be interpreted as ordered sequences of points randomly located on the real line. Such concepts as forward recurrence times and number of points in intervals are defined and related in set-theoretic Note that for α∈$A$,$G$^{α}may not cover$G$_{α}as a convex subgroup and so we cannot use Theorem 1.1 to prove this result. Moreover, all that we know about the$G$^{α}/G_{α}is that each is an extension of a trivially ordered subgroup by a subgroup of$R$. It$B$is a plenary subset of$A$, then there exists a$v$-isomorphism μ of$G$into$V(B, G$^{β}/G_{β}), but whether or not μ is an$o$-isomorphism is not known.

No abstract uploaded!

Let ϕ be a faithful normal semi-finite weight on a von Neumann algebra$M$. For each normal semi-finite weight ϕ on$M$, invariant under the modular automorphism group Σ of ϕ, there is a unique self-adjoint positive operator$h$, affiliated with the sub-algebra of fixed-points for Σ, such that ϕ=ϕ($h$·). Conversely, each such$h$determines a Σ-invariant normal semi-finite weight. An easy application of this non-commutative Radon-Nikodym theorem yields the result that$M$is semi-finite if and only if Σ consists of inner automorphisms.

This work proposes a novel metric based algorithm for quadrilateral mesh generating. Each quad-mesh induces a Riemannian metric satisfying special conditions: the metric is a flat metric with cone singularities conformal to the original metric, the total curvature satisfies the Gauss–Bonnet condition, the holonomy group is a subgroup of the rotation group $\{e^{ik\pi/2}\}$, there is cross field obtained by parallel translation which is aligned with the boundaries, and its streamlines are finite geodesics. Inversely, such kind of metric induces a quad-mesh. Based on discrete Ricci flow and conformal structure deformation, one can obtain a metric satisfying all the conditions and obtain the desired quad-mesh. This method is rigorous, simple and automatic. Our experimental results demonstrate the efficiency and efficacy of the algorithm.