• Tidak ada hasil yang ditemukan

51°03′N 4°08′W / 51.05°N 04.14°W / 51.05; -04.14

vol10_pp46-59. 531KB Jun 04 2011 12:05:51 AM

vol10_pp46-59. 531KB Jun 04 2011 12:05:51 AM

... 1. Introduction. A partial matrix is a rectangular array of numbers in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the ...

14

vol11_pp180-191. 169KB Jun 04 2011 12:05:51 AM

vol11_pp180-191. 169KB Jun 04 2011 12:05:51 AM

... Abstract. The determinantal conjecture of M. Marcus and G. N. de Oliveira is known in many special cases. The case of 3 × 3 matrices was settled byN. Bebiano, J. K. Merikoski and J. da Providˆ encia. The case ...

12

vol11_pp24-40. 197KB Jun 04 2011 12:05:51 AM

vol11_pp24-40. 197KB Jun 04 2011 12:05:51 AM

... each component of which is known classically. While this paper concentrates on the case when GL(n, C) acts on the vector space V and GL(k, C) acts on W , the techniques that we use are applicable for when G ...

17

vol11_pp103-114. 155KB Jun 04 2011 12:05:51 AM

vol11_pp103-114. 155KB Jun 04 2011 12:05:51 AM

... an n × n matrix E is said to be irreducible if the index set {1, 2, ..., n} cannot be split into two proper complementary sets (without common indices) {i 1 , ...= n) such ...

12

vol11_pp168-179. 184KB Jun 04 2011 12:05:51 AM

vol11_pp168-179. 184KB Jun 04 2011 12:05:51 AM

... , n − 1} that has length g − 1 or ..., n − 1} is on a g−cycle that passes through vertex ..., n}, let d(n, v) = q and let d(v, n) = ...arc nw is the first arc on a ...

12

vol11_pp16-23. 132KB Jun 04 2011 12:05:51 AM

vol11_pp16-23. 132KB Jun 04 2011 12:05:51 AM

... by a vector and, respectively, O((m + n)r) and O((m + n log r)r) additional operations in F. The first algorithm, presented in Section 2, is based on minimal polynomial computation using Wiedemann’s ...

8

vol11_pp192-204. 185KB Jun 04 2011 12:05:51 AM

vol11_pp192-204. 185KB Jun 04 2011 12:05:51 AM

... 4. Every X -invariant H -neutral subspace admits an extension to an X-invariant maximal H -nonnegative subspace (as it should by Theorem 1.1): We only verify this for the generic case h 2 + 4b = 0 and b =0. Since ...

13

vol11_pp205-211. 127KB Jun 04 2011 12:05:51 AM

vol11_pp205-211. 127KB Jun 04 2011 12:05:51 AM

... When ch F = 2, by the result of Lemma 2.5, it suffices to prove that φ is a linear transformation. Here we are borrowing (and correcting)the arguments used in the proof of [4, Proposition 2.1]. Note that condition ...

7

vol11_pp212-240. 268KB Jun 04 2011 12:05:51 AM

vol11_pp212-240. 268KB Jun 04 2011 12:05:51 AM

... An n × n complex matrix A is ray-nonsingular if A ◦ X is nonsingular for all (entry-wise) positive matrices X, where A ◦ X denotes the Schur (entry-wise) ...which n does there exist an n × ...

29

vol11_pp241-245. 112KB Jun 04 2011 12:05:51 AM

vol11_pp241-245. 112KB Jun 04 2011 12:05:51 AM

... the eigenvectors according the order ≺ we get that the column rank is n − |F |. From Corollaries 2.2, 2.4, 2.6 and Lemmas 2.7, 2.8, 2.9 we get that we find n − 1 independent eigenvectors. The last ...

5

vol11_pp01-15. 186KB Jun 04 2011 12:05:51 AM

vol11_pp01-15. 186KB Jun 04 2011 12:05:51 AM

... In the case of scalar-valued functions (m = 1), it is a simple matter to rewrite the original form of the Kre˘ın-Langer representation [5] in the form (2.1). In the matrix case, this is less clear, and in Section 2 we ...

15

vol10_pp65-76. 155KB Jun 04 2011 12:05:51 AM

vol10_pp65-76. 155KB Jun 04 2011 12:05:51 AM

... From the analysis in this section, we know that the analytic D-optimal design for simple linear regression on interval [ − 1, 1].A natural question to ask is what the D-optimal design is on a general bounded interval [a, ...

12

vol10_pp60-64. 100KB Jun 04 2011 12:05:51 AM

vol10_pp60-64. 100KB Jun 04 2011 12:05:51 AM

... M N ( C ) which interpolates the data, i.e. F (λ j ) = W j for j = 1, 2, ..., n, with F(λ) ≤ 1 for λ ∈ D ...case N = 1; the extension to N > 1 was noted later — we refer to ...

5

getdocaebd. 156KB Jun 04 2011 12:04:51 AM

getdocaebd. 156KB Jun 04 2011 12:04:51 AM

... Hence, the tail distribution has the expected order. Nevertheless, the question to find an equivalent to P(Z = n) is still open. As observed in [1], in order to have a big population, a particle of the branching ...

12

getdocae4b. 313KB Jun 04 2011 12:04:51 AM

getdocae4b. 313KB Jun 04 2011 12:04:51 AM

... We now give a brief outline of the paper. In Section 2, we present the basic discrete time model and state the empirical measure large deviation result (Theorem 2.9) for this model. Sections 3, 4 and 5 are devoted ...

46

getdocae66. 305KB Jun 04 2011 12:04:51 AM

getdocae66. 305KB Jun 04 2011 12:04:51 AM

... is a symmetric Cauchy process with parameter π. (1) More precisely, (1) has first been shown by Biane and Yor [6] in the special case when X is a Brownian motion. Then (1) has been proven in [9] under the additional ...

12

getdocaf34. 68KB Jun 04 2011 12:04:51 AM

getdocaf34. 68KB Jun 04 2011 12:04:51 AM

... The problem we investigate in this note is the following. What is the smallest integer V such that there exists a class A of vc dimension V whose symmetric convex hull is rich with respect to a “large” collection of ...

3

getdocafb4. 176KB Jun 04 2011 12:04:51 AM

getdocafb4. 176KB Jun 04 2011 12:04:51 AM

... This problem has been considered yet by N. El-Karoui [5] in a general case and J.P.Lepeltier & B.Marchal [9] in a particular case. Using martingale methods, which are a heavy tool, all of them show the ...

20

getdocb04c. 412KB Jun 04 2011 12:04:51 AM

getdocb04c. 412KB Jun 04 2011 12:04:51 AM

... and 4, together with the number of sets ...of n correspond to lower and upper bounds, respectively, whereupon in Tables 2 and 4 the correspon- dence is vice ...and 4 the exact network ...

12

getdocb1e1. 169KB Jun 04 2011 12:04:51 AM

getdocb1e1. 169KB Jun 04 2011 12:04:51 AM

... Consider the infinite cluster of a supercritical bond percolation model. On this random graph, we define a zero-range process, which can be defined as a system of symmetric, simple random walks on which the hopping time ...

14

Show all 10000 documents...

Related subjects