Báo cáo toán học: "Borel maps on sets of von Neumann algebras " pdf

... Pierobon, S Merlin, On the limiting performance of broadcast algorithms over unidimensional ad- ho c radio networks, in Proc. of IEEE Intl. Conf. on Wireless Personal Multimedia Communications (WMPC), Abano ... is meaningful only if the i-th node decides to retransmit, it is of interest to study the statistical distribution of D i conditioned on S i . For this reason...

Ngày tải lên: 20/06/2014, 20:20

... ad- dress configuration time ( ¯ T conf ), by simply consider- ing the two possible configuration situations: (i) there is on average multi-hop connectivity between the un- configured vehicle and the ... evaluated the config- uration time ¯ T conf under different traffic conditions and for different deployment configuration parame- ters. The traffic conditions are defined by the vehicu- lar density...

Ngày tải lên: 20/06/2014, 20:20

... note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law Qunying Wu 1,2 1 College of Science, Guilin University of ... sequence of independent and identically distributed random variables in the domain of attraction of a normal distribution. A...

Ngày tải lên: 20/06/2014, 21:20

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... alt =""

Ngày tải lên: 05/08/2014, 15:20

... class="bi x0 y0 w1 h 2" alt =""

Ngày tải lên: 05/08/2014, 15:20

... proved some results on mid-point sets of two linear sets in the light of the Lebesgue density. In the present paper the authors restrict their investigations into mid-point sets of sets of natural ... authors study some properties of the mid-point sets of sets of natural numbers using upper (lower) asymptotic density of sets of natural numbers....

Ngày tải lên: 06/08/2014, 05:20

... 1–8. 4. W. Li, On the property of solutions of M-matrix equations, Systems Science and Math. S cience 10 (1997) 129–132. The Bounds on Comp onents of the Solution for Consistent Linear Systems ... a nonsingular M-matrix. Hence the result follows immediately from Theorem 3.1 of [3]. Vietnam Journal of Mathematics 33:1 (2005) 91–95 The Bounds on Componen...

Ngày tải lên: 06/08/2014, 05:20

... need only show that no prefix of m n is an overlap. First note that no prefix of m n is a square of length 12 or greater; otherwise the prefix of m n of length 6 reappears internally, i.e. m n contains ... m j , a contradiction since m j is overlap-free. Since aab is a prefix of m i ,f(aab)=aaf(b)isaprefixofm j . However, another prefix of m j is aabaab. Thus one of f (b)andbaab i...

Ngày tải lên: 07/08/2014, 06:20

... is (k, )-sum-free for k,  ∈ N, k>,ifthere are no solutions to the equation x 1 + ···+ x k = y 1 + ···+ y  in A. Denote by SF n k, the number of (k, )-sum-free subsets of [1,n]. Since the ... ρ). The main result of this note says that if (k − )/ is small in terms of ρ, then the number of (k, )-sum-free subsets of [1,n]isequalto(ϕ(ρ)+ϕ r...

Ngày tải lên: 07/08/2014, 06:20

... 51–72. [6] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of group, Stanford Technical Report No. 481, July 1995, 36 pages. [7] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of abelian ... most c r n 2 log n where the constant c r depends only on the order r of G . 1. Introduction One method often used in computational group theory for generating...

Ngày tải lên: 07/08/2014, 06:22

... a construction for sets of integers with distinct subset sums Tom Bohman Department of Mathematics, 2-339 Massachusetts Institute of Technology 77 Massachusetts Ave. Cambridge, MA 02139 bohman@math.mit.edu Submitted: ... can make an approximation of L ≈ .22001865 with an error of less than 1.5 ·10 −7 . Inequality (10) can certainly be used to obtain more precise ap...

Ngày tải lên: 07/08/2014, 06:22

... Background Consider a Markov chain (P, Ω,π)whereP denotes the transition matrix, Ω denotes the state space, and π denotes the unique stationary distribution. Recall that the variation distance between ... modified dynamics imply bounds on the mixing time of the original Glauber dynamics. (See the remark at the end of Section 3 for a discussion regarding the case...

Ngày tải lên: 07/08/2014, 06:22

... theorem. Theorem 1 The size of a minimum connected dominating set of a random n-vertex cubic graph is asymptotically almost surely less than 0.5854n. Proof After the first element of C has been chosen, ... least to within an additive constant, of the main result of [10]. They also showed that the size of a connected dominating set of an n-vertex cubic graph of gir...

Ngày tải lên: 07/08/2014, 06:23

... Classification: 0 5A1 5 Abstract For a certain graph obtained by adding extra vertices and edges to the triangular lattice graph, Propp conjectured that the number of perfect matchin gs of such a graph ... consider the set of all perfect matchings of G n . Define a relation R on this set as follows: two perfect matchings have the relation R if and only if they have...

Ngày tải lên: 07/08/2014, 21:21