51°05′N 4°08′W / 51.08°N 04.14°W / 51.08; -04.14
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 n → w is the first arc on a ...
12
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_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_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_pp212-240. 268KB Jun 04 2011 12:05:51 AM
... Main Theorem There is an n × n full ray-nonsingular matrix if and only if n ≤ 4. The proof of the main theorem is quite detailed. In section 2, we recall some known results and outline our ...
29
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
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_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
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
vol11_pp192-204. 185KB Jun 04 2011 12:05:51 AM
... Section 4 that the extension problem has a positive solution if we start with an invariant H -definite subspace and if additional hypotheses are ...e n be the canonical unit vectors of C n : e j has ...
13
vol10_pp60-64. 100KB Jun 04 2011 12:05:51 AM
... studied quite thoroughly by J. Agler and N. J. Young; see for instance [1], [2], and the references quoted therein. They related this problem with questions of complex analysis in two variables, dilation theory, ...
5
vol10_pp46-59. 531KB Jun 04 2011 12:05:51 AM
... matrix completion problems. Of particular interest is Lemma 3.5 in [3]: Any partial positive P -matrix, the graph of whose specified entries is an n-cycle can be completed to a positive P -matrix. (For this result ...
14
vol11_pp180-191. 169KB Jun 04 2011 12:05:51 AM
... Actually the conjecture was originally stated slightly differently. We have replaced an addition by a subtraction. The conjecture is known in many special cases. It was established for n = 3 in N. Bebiano, ...
12
getdocae66. 305KB Jun 04 2011 12:04:51 AM
... measure n of the excursions away from 0 of the L´evy process (corresponding to the local time that has just been specified by (8)), is supported by the set of excursions that first stay negative then jump across ...
12
getdocaf34. 68KB Jun 04 2011 12:04:51 AM
... The problem discussed here is motivated by recent results in Statistical Learning Theory, where several efficient classification algorithms (e.g. “boosting” [9, 5] and “bagging” [2, 3]) form convex combinations of ...
3
getdocaebd. 156KB Jun 04 2011 12:04:51 AM
... The paper is organised as follows. Section 2 gives some elementary results for one-dimensional random walks on an interval. Section 3 gives estimates on the first and second moments of the killed branching random walk, ...
12
getdocae4b. 313KB Jun 04 2011 12:04:51 AM
... where J is the part of the rate function that accounts for the possibility that mass might wander off to infinity. Clearly, the expression on the right side of (1.2) provides a sharper lower bound than the expression on ...
46
vol11_pp132-161. 594KB Jun 04 2011 12:05:51 AM
... All 4! permutations of a, b, c and d are accounted for. When a, b, c and d are all distinct integers then we have three sets of eight elements where all elements in the same set have the same value (up to signs). ...
30
vol10_pp81-101. 226KB Jun 04 2011 12:05:51 AM
... uB is greater than or equal to the square of the maximal cycle mean of the matrix T . We remark that unlike in the diagonal equivalence case, it is possible that in the case of diagonal similarity the ratio between any ...
21