Báo cáo toán học: "SEuler characteristic of the truncated order complex of generalized noncrossing partitions" pot

... rank of the group W (the number of simple reflections generating W ), h is the Coxeter number (the order of a Coxeter element), and the integers d 1 , d 2 , . . . , d n are the degrees of W (the ... journal of combinatorics 16 (2009), #R143 2 Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong ∗ and C....

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

... terms of the Cantor property for the E-L measure of nonconvexity. As an application of this characterization, we show that the convexity requirements can be dropped from the hypotheses of a number ... diametral point of B. The following is a version of Kirk’s seminal theorem (cf. [4, Theorem 4.1]) which does not require the convexity of the domain. This Provisional...

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

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

... )=  R 2 n χ V (ξ)dλ 2n (ξ)=2n  +∞ 0 dr  ∂B n r χ V (η)dσ r (η)=0 in which χ V denotes the characteristic function of V . The lemma is proved.  Now we are able to prove Theorem 4.1. Proof of Theorem 4.1. From the hypothesis there exists u ∈ PSH(B n × ... E N . The same arguments as in the above proof complete the proof of Theorem 3.2.  4. Holomorphic Graphs of Forell...

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

... the product of the probabilities of each of the events as an upper bound. In our approach, a key step to further improving the upper bound obtained in [2] is the exact computation of the probability ... involving the conjunction of the events using the occupancy problem for random placements of balls into bins. We make use of the sharp estimates obtained by K...

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

... u l−s to u i along the outer cycle is a shortest path between u 0 and u i , as desired.  In what follows, we give the proof of the main theorem. Proof of Theorem 2: By Proposition 4, there exists ... we prove the following theorem. Theorem 2 For any integer k  2 and n > 6k 2 , GP (n, k) is no t di stance-balanced. Theorem 2 gives a positive answer to Conjecture 1. 2 The Pro...

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

... equal if and only if they have the same spectrum [5]. Theorem 2 is a strengthening of this result. The proof of the previous two theorems rely on a theorem of Bass’ in [1]. In the case that G is ... conclude that the number of vertices of G is n. It is well known that the regularity of G, q + 1, is equal to the largest element of the spectrum of G. The number...

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

... of the graph at any stage of the algorithm by their current degree so that for 1 ≤ i ≤ 3, V i denotes the set of vertices of degree i. Define τ(e) to be the ratio of the increase in the size of ... 1 over the selection of a vertex of degree 2, we have γ = 1. The rest o f the proof of Theorem 1 is then followed. The solution to the LP is shown in Figure 2...

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

... capture from the environment may contain errors. Then we describe the potential consequence of such errors on the performance of class of algorithms previously classified. Due to their lack of flexibility, ... pulls. In the OSA framework, the SU is modeled as the gambler while the frequency bands represent the levers. The gambler faces at each trial a trade-off between...

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

... the condition nP(|X 1 | > η n ) ≤ c(log n) ε 0 , 0 < ε 0 < 1 in theorem 1.1 of [12]. Remark 1.4. If EX 2 < ∞, then X is in the domain of attraction of the normal law. Therefore, the ... unknown. The purpose of this article is to study and establish the ASCLT for self-normalized partial sums of random variables in the domain of attraction of the normal...

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