REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

Size: px
Start display at page:

Download "REGULAR MULTILINEAR OPERATORS ON C(K) SPACES"

Transcription

1 REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of C(K) spaces, wth values n an arbtrary Banach space. Ths class has been consdered recently by several authors (see, f.., [3], [8], [9]) n connectons wth problems of factorzaton of polynomals and holomorphc mappngs. We also obtan several characterzatons of the compact dspersed spaces K n terms of polynomals and multlnear forms defned on C(K) Mathematcs Subject Classfcaton: 46E15, 46B Introducton and Notatons Let K be a compact Hausdorff space. C(K) wll be the space of scalar valued contnuous functons on K, Σ wll denote the σ-algebra of the Borel sets of K and B(Σ) wll stand for the space of Σ-measurable functons on K whch are the unform lmt of elements of Σ-smple functons. As t s well nown, the Resz representaton theorem gves a representaton of the operators on C(K) as ntegrals wth respect to Radon measures, and ths has been very frutfully used n the study of the propertes of C(K) spaces. In a seres of papers (see specally [6], [7]), Dobraov developed a theory of polymeasures, functons defned on a product of σ-algebras whch are separately measures, that can be used to obtan a Resz-type representaton theorem for multlnear operators defned on a product of C(K) spaces. Before gong any further, we shall clear out our notaton: If X s a Banach space, X wll denote ts topologcal dual and B X ts closed unt ball. L (E 1..., E ; Y ) wll be the Banach space of all the contnuous -lnear mappngs from E 1 E nto Y, and P( X; Y ) the space of contnuous -homogeneous polynomals from X to Y,.e., the class of mappngs P : X Y of the form P (x) = T (x,..., x), for some T L (X,... X; Y ). When Y = K, we wll omt t. We shall use the conventon. [].. to mean that the -th coordnate s not nvolved. We shall denote the semvaraton of a measure µ by µ and also the semvaraton of a polymeasure γ by γ (for the general theory of polymeasures see [6], or [14]). It seems convenent to recall here that a polymeasure s called regular f t s separately regular and t s called countably addtve f t s separately countably addtve. We wll denote the set of the bounded semvaraton polymeasures defned n Σ 1 Σ wth values n X as bpm(σ 1,..., Σ ; X). rcapm(σ 1,..., Σ ; X) stands for the subset of the regular countably addtve polymeasures and bsvω rcapm(σ 1,..., Σ ; X ) for the subset of bpm(σ 1,..., Σ ; X ) composed of those polymeasures that verfy that for each x X, x γ rcapm(σ 1,..., Σ ; K). Both authors were partally supported by DGICYT grant PB

2 2 FERNANDO BOMBAL AND IGNACIO VILLANUEVA As customary we wll call rca(σ; X) the set of regular countably addtve measures from Σ nto X. Wth these notatons at hand we can state for further references the followng theorem from [4], whch extends and completes prevous results of Pelczyns ([11]) and Dobraov ([7]): Theorem 1.1. ([4]) Let K 1,..., K be compact Hausdorff spaces, let X be a Banach space and let T L (C(K 1 ),..., C(K ); X). Then there s a unque T L (B(Σ 1 ),..., B(Σ ), X ) whch extends T and s ω ω separately contnuous (the ω - topology that we consder n B(Σ ) s the one nduced by the ω -topology of C(K ) ). Besdes, we have 1. T = T. 2. For every (g 1,. [].., g ) B(Σ 1 ). [].. B(Σ ) there s a unque X -valued bounded ω -Radon measure γ g1 on K,...,g [] (.e., a X -valued fntely addtve bounded vector measure on the Borel subsets of K, such that for every x X, x γ g1 s a Radon measure on K,...,g [] ), verfyng g dγ g1, = T (g...,g [] 1,..., g 1, g, g +1,..., g ), g B(Σ ). 3. T s and ω ω sequentally contnuous (.e., f (g n) n N B(Σ ), for = 1,..., and g n ω g, then lm n T (g1 n,..., g n) = T (g 1,..., g ) n the σ(x, X ) topology. Besdes, f we defne γ : B(Σ 1 ) B(Σ ) X as γ(a 1,..., A ) := T (χ A1,... χ A ), then γ s a polymeasure of bounded semvaraton that verfes (a) T = γ. (b) T (f 1,..., f ) = (f 1,..., f )dγ (f C(K )) (c) For every x X, x γ s a regular (scalar) polymeasure and the map x x γ s contnuous for correspondng wea- topologes n X and (C(K 1 ) ˆ ˆ C(K )). Conversely, f γ : Σ 1 Σ X s a polymeasure whch verfes (c), then t has fnte semvaraton and formula (b) defnes a -lnear contnuous operator from C(K 1 ) C(K ) nto X for whch (a) holds. Therefore the correspondence T γ s an sometrc somorphsm between L (C(K 1 ),..., C(K ); X) and the polymeasures n bsv-ω - rcapm(σ 1 Σ ; X ) that verfy condton c). Our am now s to explot both representaton theores, measures and polymeasures, to study the multlnear operators on C(K) spaces. In ths paper we present some results n ths drecton. 2. The Man Results The followng defnton can be found n [6] or n [14] Defnton 2.1. A polymeasure γ : Σ 1 Σ X s sad to be unform n the ı th varable f t s countably addtve and the measures { } γ(a 1,..., A 1,, A +1,... A ) ca(σ ; X) : (A 1,. [].., A ) Σ 1 [] Σ are unformly countably addtve. A polymeasure s sad to be unform f t s unform n every varable.

3 REGULAR MULTILINEAR OPERATORS ON C(K) SPACES 3 It s easy to chec that gven a natural number r, 1 < r < and r ndexes 1 j(1) < j(2) <... < j(r), and gven fxed h j(p) B(Σ j(p) ), p = 1... r, we can construct the multlnear operator T hj(1),...h j(r) : C(K q ) X 1 q q (j(1)...j(r)) defned as T hj(1),...h j(r) (h q(1),..., h q( r) ) := T (h 1,..., h ) whose assocated polymeasure we wll call γ hj(1),...h j(r). Gven a bounded polymeasure γ : Σ 1 Σ X and a fxed number, 1, we can construct n a natural way the measure φ : Σ bpm(σ 1, [], Σ ; X) defned as φ (A ) := γ A. The fact that φ s bounded, ndeed φ = γ, and the followng lemma are easy to chec. Lemma 2.2. Wth the above notaton, a countably addtve polymeasure γ s unform n the ı th varable f and only f φ s countably addtve. The same s true f n ths statement countably addtve s replaced by regular. Let E 1,..., E, X be Banach spaces. Each T L (E 1,..., E ; X) generates n a natural way lnear operators T : E L 1 (E 1,. [].., E ; X), = 1,..., defned as T (x )(x 1,. [].., x ) := T (x 1,..., x ) for each x j E j, j = 1,...,. We wll state now a defnton: Defnton 2.3. A -lnear mappng T L (E 1,..., E ; X) s sad to be regular f every mappng T above defned s wealy compact. When X s the scalar feld, the above defnton was gven n [3]. In general, gven an operator deal U, we can defne the U-regular -lnear mappngs as those such that the correspondng T belong to U for every 1. When U s the deal of compact operators, such mappngs have been consdered n [8], and for a general closed njectve operator deal U n [9]. In every case a non-lnear verson of the factorzaton theorem of Daves, Fgel, Johnson and Pelczynsy (see [5, pgs. 250, 259]) through operators n U s obtaned for such multlnear mappngs. These results are then appled to get some factorzaton theorems for holomorphc mappngs. We are ready now to prove the followng characterzaton of the unform polymeasures. Theorem 2.4. Let K 1,..., K be compact Hausdorff spaces, let X be a Banach space and let T L (C(K 1 ),..., C(K ); X). Let γ : Σ 1 Σ X be the polymeasure assocated to t accordng to theorem 1.1. Then γ s unform f and only f T s regular. Besdes, n that case the measures φ defned before lemma 2.2 are the measures canoncally assocated to the operators T. Proof. Let us frst assume that γ s unform (n partcular ths means that γ s regular countably addtve and therefore X-valued, see [7]). Accordng to lemma 2.2 ths means that for each = 1,...,, φ rca(σ ; rcapm(σ 1,. [].. Σ ; X)). Snce rcapm(σ 1,. [].. Σ ; X) L 1 (C(K 1 ),. [].., C(K ); X) (cfr. theorem 1.1) we

4 4 FERNANDO BOMBAL AND IGNACIO VILLANUEVA get that φ rca(σ ; L 1 (C(K 1 ),. [].., C(K ); X)). Then we can consder the operator H φ L(C(K ); L 1 (C(K 1 ),. [].., C(K ); X)) assocated to φ by the Resz representaton theorem (vector valued case; see, f.. [5, Theorem VI.2.1]). Snce φ s countably addtve we now that H φ s wealy compact ([5, Theorem VI.2.5]). We consder now Hφ, the btranspose of H φ. Snce H φ s wealy compact we get that Hφ s L 1 (C(K 1 ),. [].., C(K ); X)-valued. It s easy to see that for every A Σ, and for every (f 1,. [].., f ) C(K 1 ). [].. C(K ), Hφ (A )(f 1,. [].., f ) = < φ (χ A ), (f 1,. [].., f ) >= (f 1,. [].., f )dγ A Therefore, = T (f 1,... f 1, χ A, f +1,... f ). Hφ (g )(f 1,. [].., f ) = T (f 1,... f 1, g, f +1,... f ), for every Σ -smple functon g and for every (f 1,. [].., f ) C(K 1 ). [].. C(K ). From contnuty, we get the same relaton for every g B(Σ ). In partcular, when we choose f C(K ) we get Hφ (f )(f 1,. [].., f ) = T (f 1,... f 1, f, f +1,... f ) = T (f 1,... f 1, f, f +1,... f ) = T (f )(f 1,. [].., f ). Obvously ths means that T = H φ and, therefore, that T s wealy compact. Let us now assume that T s regular. Then, for every = 1..., T L(C(K ); L 1 (C(K 1 ),. [].., C(K ); X) s wealy compact and so the measure µ assocated to t by the Resz representaton theorem s countably addtve and L 1 (C(K 1 ),. [].., C(K ); X)-valued ([5, Theorem VI.2.5]). We wll chec now that for every = 1..., µ = φ. Then, the proof wll be fnshed just by loong at lemma 2.2. Let T be the btranspose of T. For each A Σ let (f α) α I be a net n C(K ) such that f α ω χ A. T s nown to be ω -ω contnuous; beng T wealy compact we get that T s L 1 (C(K 1 ),. [].., C(K ); X)-valued. Both of these facts together mply that (T (f α)) α I converges wealy to T (χ A ). For fxed (f 1,. [].., f ) C(K 1 ). [].. C(K ) and x X, the lnear form θ : L 1 (C(K 1 ),. [].., C(K ); X) K defned as θ(s) := S(f 1,. [].., f ), x s clearly contnuous and therefore Besdes, θ(t θ(t (f α )) θ(t (χ A )) = T (χ A )(f 1,. [].., f ), x. (f α )) = T (f α )(f 1,. [].., f ), x = T (f 1,... f 1, f α, f +1,... f ), x. Snce T s separately ω -ω contnuous we get that ths last expresson converges to T (f 1,... f 1, χ A, f +1,..., f ), x. So we have obtaned that for every x X, T (f 1,... f 1, χ A, f +1,..., f ), x = T (χ A )(f 1,. [].., f ), x. Therefore for every A Σ and for every (f 1,. [].., f ) C(K 1 ) [] C(K ), T (f 1,... f 1, χ A, f +1,..., f ) = T (χ A )(f 1,. [].., f ) = µ (A )(f 1,. [].., f ).

5 REGULAR MULTILINEAR OPERATORS ON C(K) SPACES 5 But clearly T (f 1,... f 1, χ A, f +1,..., f ) = (f 1,. [].., f )dγ A = φ (A )(f 1,. [].., f ). From here t follows that µ = φ and the proof s over. Snce every operator from C(K 1 ) to C(K 2 ) s wealy compact (cfr. [5, Theorem VI-2-15], f..), we get mmedately the followng result (see [6]): Corollary 2.5. Every regular countably addtve scalar bmeasure γ : Σ 1 Σ 2 K s unform. From the above theorem we can derve the followng propostons, useful to decde whether a polymeasure s or s not unform. Prevously we wll need a lemma. Lemma 2.6. Let T : C(K 1 ) C(K ) X be a regular - lnear operator. Let (f n) n N C(K ) be a wealy null sequence and let ((g1 n ) n N,. [].., (g n) n N) B(Σ 1 ). [].. B(Σ ) be bounded sequences. Then, wth the notaton of theorem 1.1, T (g1 n,... g 1 n, f n, gn +1,..., gn ) converges n norm to zero. Proof. If T s regular, then the above defned operator T s wealy compact and therefore completely contnuous, by the Dunford-Petts property of C(K ). Ths means that T (f n ) 0. We observe now that, due to the unqueness of the extenson (1.1), for every (g 1,. [].., g ) B(Σ 1 ). [].. B(Σ ) and for every f C(K ), we have T (f )(g 1,. [].., g ) = T (g 1,... g 1, f, g +1,..., g ). By the equalty of the norms of the operator and ts extenson, we can wrte T (f n ) 0. Ths can also be wrtten as whch means that and fnshes the proof. sup T (f n)(g 1,. [].., g ) 0, g j B B(Σj ) sup T (g 1,... g 1, f n, g +1,..., g ) 0 g j B B(Σj ) Proposton 2.7. A regular countably addtve polymeasure γ : Σ 1 Σ X s unform n the ı th varable f and only f the measures {γ g1 : (g,...,g [] 1,. [].., g ) B(Σ 1 ) [] B(Σ ), g j 1} are unformly countably addtve. Proof. One of the mplcatons s clear. For the other, let us suppose that γ s unform n the ı th varable. Were the measures {γ g1 ; (g,...,g [] 1,. [].., g ) B(Σ 1 ) [] B(Σ )} not unformly countably addtve, then there would exst ɛ > 0, a sequence (A n ) n N Σ of dsjont open sets and sequences ((g1 n ) n N,. [].., (g n) n N) B(Σ 1 ). [].. B(Σ ) wth gj n [] 1 for each n N and for each j = 1..., such that γ g1, (A n...,g [] ) > ɛ. Then for each n N there would exst f n C(K ) wth suppf n A n and f n 1 such that f ndγ > ɛ, and ths n contradcton wth lemma 2.6, snce the sequence f n converges wealy to 0. g 1,...,g []

6 6 FERNANDO BOMBAL AND IGNACIO VILLANUEVA Proposton 2.8. A regular countably addtve polymeasure γ : Σ 1 Σ X s unform n the ı th varable f and only f the measures {γ f1 ; (f,...,f [] 1,. [].., f ) C(K 1 ) [] C(K ), f j 1} are unformly countably addtve. Proof. In one drecton the result follows from the prevous proposton. For the other, we wll suppose wthout loss of generalty that =. Let us suppose that the measures {γ f1,...,f 1 ; (f 1,..., f 1 ) C(K 1 ) C(K 1 ), f j 1} are unformly countably addtve. If γ s not unform n the th varable then there exst a sequence A n Σ of dsjont open sets and sequences (A n j ) n N Σ j for j = such that γ(a n 1,..., A n, ) > ɛ. Snce γ s regular, γ(, An 2,... A n ) s regular for each n N and therefore there exsts a functon f1 n C(K 1 ) wth f1 n 1 such that f1 n dγ A n 2,...,A n > ɛ. Now γ f1 n,,χ A n,...,χ s also regular and therefore there exsts a functon f2 n C(K 2 ) wth f2 n 1 such that 3 A n f2 n dγ f n 1,χ A n,...,χ 3 A n > ɛ. Contnung n the same way we obtan 1 sequences of norm one functons fj n C(K j), j = such that γ f n 1,...,f 1 n (An ) > ɛ whch contradcts the hypothess. 3. Polymeasures on compact dspersed spaces Recall that a compact Hausdorff space s sad to be dspersed f t does not contan any non empty perfect set. In [12] a deep nsght s gven nto the structure of dspersed spaces, provng among other results that K s dspersed f and only f C(K) contans no copy of l 1, f and only f C(K) contans no copy of L 1. Also, n ths case C(K) can be dentfed wth l 1 (Γ) for some Γ. Some (f not all) of the followng results are probably nown, but we have not been able to fnd an explct reference. Theorem 3.1. For a compact Hausdorff space K, the followng statements are equvalent: a) K s dspersed. b o ) For every 1, the space L (C(K)) s Schur. b 1 ) For some 2, the space L (C(K)) s Schur. b 2 ) For some 2, the space P( C(K)) s Schur. b 3 ) For every 2, the space P( C(K)) s Schur. c o ) For every 1, the space L (C(K)) s wealy sequentally complete. c 1 ), c 2 ), c 3 ): Same statements as b 1 ), b 2 ), b 3 ), replacng Schur by wealy sequentally complete. d o ) For every 1, L (C(K)) contans no copy of l. d 1 ), d 2 ), d 3 ): Same statements as b 1 ), b 2 ), b 3 ), replacng Schur by the non contanment of l. e) For every 1, L (C(K)) contans no copy of c o. e 1 ), e 2 ), e 3 ): Same statements as d 1 ), d 2 ), d 3 ), replacng l by c o. Proof. Snce L (C(K)) s a dual space for every 1, every (d) statement s equvalent to the correspondng (e) statement. Also clearly b ) c ) d ), for every, b o ) b 1 ) b 2 ) and b o ) b 3 ) b 2 ). Therefore, t rests to prove a) b o ) and e 2 ) a).

7 REGULAR MULTILINEAR OPERATORS ON C(K) SPACES 7 a) b o ): We shall prove t by nducton on. For = 1, t s clear snce C(K) l 1 (Γ). Suppose now that ( ) L (C(K)) = C(K) := X π (cfr. [5, Corollary VIII.2.2]) s Schur. Then L +1 (C(K)) = L(C(K); X ) = ( C(K) ˆ π X ). Snce C(K) contans no copy of l 1 and has the Dunford-Petts property, by the nducton hypothess t follows that all members of the last space are compact operators. Hence, snce C(K) has the approxmaton property, L +1 (C(K)) = C(K) ˆ ɛ X ([5, Theorem VIII.3.6]), whch s a Schur space, snce ths property s stable by tang njectve tensor products (cfr. f.. [13]). e 2 ) a): If K s not dspersed, C(K) L 1 l 2. Consequently l 2 ˆ ɛ l 2 C(K) ˆ ɛ C(K) ( C(K) ˆ π C(K) ) (topologcal nclusons), and t s well nown that f (e n ) s the canoncal bass of l 2, then (e n e n ) s equvalent to the canoncal bass of c o (cfr., f.., [10]). Ths means that P( 2 C(K)) contans a copy of c o. Snce P( 2 C(K)) s a (complemented) subspace of P( C(K)), for every 2, t follows that the latter space contans a copy of c o, too. As we menton n corollary 2.5, every scalar regular bmeasure on a compact Hausdorff space s always unform. Ths s not true for arbtrary polymeasures, as the followng example from [2] shows: The 3-lnear map T : C([0, 1]) C([0, 1]) C([0, 1]) C defned by T (f, g, h) := f( ) gr dx hr dx, =1 where r s the standard th Rademacher functon, s not regular. See [2] for detals. In the next theorem we show that the unformty of all the -polymeasures for some (every) 3, characterzes the compact dspersed spaces. We shall denote by K(X; Y ) and W(X; Y ) the compact and wealy compact operators between X and Y, respectvely. Theorem 3.2. For a compact Hausdorff space K the followng statements are equvalent a) K s dspersed. f) For every (some) 2, L ( C(K); L (C(K)) ) = K ( C(K); L (C(K)) ). g) For every (some) 2, L ( C(K); L (C(K)) ) = W ( C(K); L (C(K)) ). h) For every (some) 3, any scalar regular -polymeasure on the product of the Borel σ-algebra of K, s unform. Proof. a) f) was ncluded n the proof of a) b o ) n theorem 3.1, and clearly f) g). The equvalence of (g) and (h) follows from theorem 2.4. Fnally, let us prove that (g) mples (a): Let 3. If K s not dspersed, C(K) s nfnte dmensonal and thus contans a copy of c o ([5, Corollary VI.2.16]). On the other hand, by theorem 3.1, L 1 (C(K)) contans a copy of l. By the njectvty of ths 0 0

8 8 FERNANDO BOMBAL AND IGNACIO VILLANUEVA space, the ncluson map from c o nto l can be extended to the whole space C(K), provdng n ths way a non wealy compact operator n L ( C(K); L 1 (C(K)) ). The equvalence of (a), (f) and (g) has been also obtaned n [1], although wth a dfferent and, n our opnon, more nvolved proof. References [1] Alamnos, J., Cho, Y. S., Km, S. G. and Pay, R., Norm attanng blnear forms on spaces of contnuous functons. Preprnt. [2] Aron, R., Cho, S. Y. and Llavona, J. L. G., Estmates by polynomals, Bull. Austral. Math. Soc. 52 (1995), [3] Aron, R. and Galndo, P., Wealy compact multlnear mappngs, Proc. of the Ednburgh Math. Soc., 40 (1997) [4] Bombal, F. and Vllanueva, I., Multlnear operators n spaces of contnuous functons, to appear. [5] Destel, J. and Uhl, J. J., Vector Measures, Mathematcal Surveys, No. 15. Amercan Math. Soc., Provdence, R.I., [6] Dobraov, I., On ntegraton n Banach spaces, VIII (polymeasures), Czech. Math. J. 37 (112) (1987), [7] Dobraov, I., Representaton of multlnear operators on C 0 (T ), Czech. Math. J. 39 (114) (1989), [8] Gonzlez, M. and Gutrrez, J.,Factorzaton of wealy contnuous holomorphc mappngs, Studa Math., 118 (2) (1996), [9] González, M. and Gutérrez, J., Injectve factorzaton of holomorphc mappngs, To appear. [10] Holub, J.R., Tensor product bases and tensor dagonals, Trans. A.M.S. 151 (1970), [11] Pelczyns, A., A theorem of Dunford- Petts type for polynomal operators, Bull. Acad. Polon. Sc. Ser. Sc. Math. Astr. Phys., 11 (1963), [12] Pelczynsy, A. and Semaden, Z., Spaces of contnuous functons (III). Spaces C(Ω) for Ω wthout perfect subsets, Studa Math. XVIII (1959), [13] Ruess, W. and Werner, D., Structural propertes of operator spaces, Acta Unv. Carol. 28 (1987), [14] Vllanueva, I., Polmeddas y representacón de operadores multlneales de C(Ω 1, X 1 ) C(Ω d, X d ). Tesna de Lcencatura, Dpto. de Análss Matemátco, Fac. de Matemátcas, Unversdad Complutense de Madrd, 1997.

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

We are now ready to answer the question: What are the possible cardinalities for finite fields? Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Embedding lattices in the Kleene degrees

Embedding lattices in the Kleene degrees F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

The descriptive complexity of the family of Banach spaces with the π-property

The descriptive complexity of the family of Banach spaces with the π-property Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014

More information

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

More information

COLLOQUIUM MATHEMATICUM

COLLOQUIUM MATHEMATICUM COLLOQUIUM MATHEMATICUM VOL. 74 997 NO. TRANSFERENCE THEORY ON HARDY AND SOBOLEV SPACES BY MARIA J. CARRO AND JAVIER SORIA (BARCELONA) We show that the transference method of Cofman and Wess can be extended

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2) MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

More information

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem. Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

More information

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole CHAPTER 7 VECTOR BUNDLES We next begn addressng the queston: how do we assemble the tangent spaces at varous ponts of a manfold nto a coherent whole? In order to gude the decson, consder the case of U

More information

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu

More information

Generalizing the degree sequence problem

Generalizing the degree sequence problem Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded

More information

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance JOURNAL OF RESEARCH of the Natonal Bureau of Standards - B. Mathem atca l Scence s Vol. 74B, No.3, July-September 1970 The Dstrbuton of Egenvalues of Covarance Matrces of Resduals n Analyss of Varance

More information

Stability, observer design and control of networks using Lyapunov methods

Stability, observer design and control of networks using Lyapunov methods Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Uniform topologies on types

Uniform topologies on types Theoretcal Economcs 5 (00), 445 478 555-756/000445 Unform topologes on types Y-Chun Chen Department of Economcs, Natonal Unversty of Sngapore Alfredo D Tllo IGIER and Department of Economcs, Unverstà Lug

More information

Equlbra Exst and Trade S effcent proportionally

Equlbra Exst and Trade S effcent proportionally On Compettve Nonlnear Prcng Andrea Attar Thomas Marott Franços Salané February 27, 2013 Abstract A buyer of a dvsble good faces several dentcal sellers. The buyer s preferences are her prvate nformaton,

More information

THE HIT PROBLEM FOR THE DICKSON ALGEBRA

THE HIT PROBLEM FOR THE DICKSON ALGEBRA TRNSCTIONS OF THE MERICN MTHEMTICL SOCIETY Volume 353 Number 12 Pages 5029 5040 S 0002-9947(01)02705-2 rtcle electroncally publshed on May 22 2001 THE HIT PROBLEM FOR THE DICKSON LGEBR NGUY ÊN H. V. HUNG

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

On Leonid Gurvits s proof for permanents

On Leonid Gurvits s proof for permanents On Leond Gurvts s proof for permanents Monque Laurent and Alexander Schrver Abstract We gve a concse exposton of the elegant proof gven recently by Leond Gurvts for several lower bounds on permanents.

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

F-Rational Rings and the Integral Closures of Ideals

F-Rational Rings and the Integral Closures of Ideals Mchgan Math. J. 49 (2001) F-Ratonal Rngs and the Integral Closures of Ideals Ian M. Aberbach & Crag Huneke 1. Introducton The hstory of the Brançon Skoda theorem and ts ensung avatars n commutatve algebra

More information

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt. Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

More information

Area distortion of quasiconformal mappings

Area distortion of quasiconformal mappings Area dstorton of quasconformal mappngs K. Astala 1 Introducton A homeomorphsm f : Ω Ω between planar domans Ω and Ω s called K-quasconformal f t s contaned n the Sobolev class W2,loc 1 (Ω) and ts drectonal

More information

How To Prove That A Multplcty Map Is A Natural Map

How To Prove That A Multplcty Map Is A Natural Map ULTIPLE VALUED FUNCTIONS AND INTEGRAL CURRENTS CAILLO DE LELLIS AND EANUELE SPADARO Abstract. We prove several results on Almgren s multple valued functons and ther lnks to ntegral currents. In partcular,

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

Global stability of Cohen-Grossberg neural network with both time-varying and continuous distributed delays

Global stability of Cohen-Grossberg neural network with both time-varying and continuous distributed delays Global stablty of Cohen-Grossberg neural network wth both tme-varyng and contnuous dstrbuted delays José J. Olvera Departamento de Matemátca e Aplcações and CMAT, Escola de Cêncas, Unversdade do Mnho,

More information

Pricing Overage and Underage Penalties for Inventory with Continuous Replenishment and Compound Renewal Demand via Martingale Methods

Pricing Overage and Underage Penalties for Inventory with Continuous Replenishment and Compound Renewal Demand via Martingale Methods Prcng Overage and Underage Penaltes for Inventory wth Contnuous Replenshment and Compound Renewal emand va Martngale Methods RAF -Jun-3 - comments welcome, do not cte or dstrbute wthout permsson Junmn

More information

On the Solution of Indefinite Systems Arising in Nonlinear Optimization

On the Solution of Indefinite Systems Arising in Nonlinear Optimization On the Soluton of Indefnte Systems Arsng n Nonlnear Optmzaton Slva Bonettn, Valera Ruggero and Federca Tnt Dpartmento d Matematca, Unverstà d Ferrara Abstract We consder the applcaton of the precondtoned

More information

Natural hp-bem for the electric field integral equation with singular solutions

Natural hp-bem for the electric field integral equation with singular solutions Natural hp-bem for the electrc feld ntegral equaton wth sngular solutons Alexe Bespalov Norbert Heuer Abstract We apply the hp-verson of the boundary element method (BEM) for the numercal soluton of the

More information

Nordea G10 Alpha Carry Index

Nordea G10 Alpha Carry Index Nordea G10 Alpha Carry Index Index Rules v1.1 Verson as of 10/10/2013 1 (6) Page 1 Index Descrpton The G10 Alpha Carry Index, the Index, follows the development of a rule based strategy whch nvests and

More information

Fisher Markets and Convex Programs

Fisher Markets and Convex Programs Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and

More information

Addendum to: Importing Skill-Biased Technology

Addendum to: Importing Skill-Biased Technology Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Section 2 Introduction to Statistical Mechanics

Section 2 Introduction to Statistical Mechanics Secton 2 Introducton to Statstcal Mechancs 2.1 Introducng entropy 2.1.1 Boltzmann s formula A very mportant thermodynamc concept s that of entropy S. Entropy s a functon of state, lke the nternal energy.

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM BARRIOT Jean-Perre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jean-perre.barrot@cnes.fr 1/Introducton The

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004 OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected

More information

SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

More information

The Noether Theorems: from Noether to Ševera

The Noether Theorems: from Noether to Ševera 14th Internatonal Summer School n Global Analyss and Mathematcal Physcs Satellte Meetng of the XVI Internatonal Congress on Mathematcal Physcs *** Lectures of Yvette Kosmann-Schwarzbach Centre de Mathématques

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

Dynamic Online-Advertising Auctions as Stochastic Scheduling

Dynamic Online-Advertising Auctions as Stochastic Scheduling Dynamc Onlne-Advertsng Auctons as Stochastc Schedulng Isha Menache and Asuman Ozdaglar Massachusetts Insttute of Technology {sha,asuman}@mt.edu R. Srkant Unversty of Illnos at Urbana-Champagn rsrkant@llnos.edu

More information

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that

More information

On the Interaction between Load Balancing and Speed Scaling

On the Interaction between Load Balancing and Speed Scaling On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted

More information

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance Applcaton of Quas Monte Carlo methods and Global Senstvty Analyss n fnance Serge Kucherenko, Nlay Shah Imperal College London, UK skucherenko@mperalacuk Daro Czraky Barclays Captal DaroCzraky@barclayscaptalcom

More information

Solving Factored MDPs with Continuous and Discrete Variables

Solving Factored MDPs with Continuous and Discrete Variables Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

The Games of Cournot Sports

The Games of Cournot Sports Appled Mathematcal Scences, Vol. 7, 013, no. 4, 01-09 Managers Compensaton and Colluse Behaour under Cournot Olgopoly Marco A. Marn Department of Computer, Control and Management Engneerng Unerstà d Roma

More information

Matrix Multiplication I

Matrix Multiplication I Matrx Multplcaton I Yuval Flmus February 2, 2012 These notes are based on a lecture gven at the Toronto Student Semnar on February 2, 2012. The materal s taen mostly from the boo Algebrac Complexty Theory

More information

How To Solve A Problem In A Powerline (Powerline) With A Powerbook (Powerbook)

How To Solve A Problem In A Powerline (Powerline) With A Powerbook (Powerbook) MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

Upper Bounds on the Cross-Sectional Volumes of Cubes and Other Problems

Upper Bounds on the Cross-Sectional Volumes of Cubes and Other Problems Upper Bounds on the Cross-Sectonal Volumes of Cubes and Other Problems Ben Pooley March 01 1 Contents 1 Prelmnares 1 11 Introducton 1 1 Basc Concepts and Notaton Cross-Sectonal Volumes of Cubes (Hyperplane

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

Abstract. 260 Business Intelligence Journal July IDENTIFICATION OF DEMAND THROUGH STATISTICAL DISTRIBUTION MODELING FOR IMPROVED DEMAND FORECASTING

Abstract. 260 Business Intelligence Journal July IDENTIFICATION OF DEMAND THROUGH STATISTICAL DISTRIBUTION MODELING FOR IMPROVED DEMAND FORECASTING 260 Busness Intellgence Journal July IDENTIFICATION OF DEMAND THROUGH STATISTICAL DISTRIBUTION MODELING FOR IMPROVED DEMAND FORECASTING Murphy Choy Mchelle L.F. Cheong School of Informaton Systems, Sngapore

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression. Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

An Overview of Financial Mathematics

An Overview of Financial Mathematics An Overvew of Fnancal Mathematcs Wllam Benedct McCartney July 2012 Abstract Ths document s meant to be a quck ntroducton to nterest theory. It s wrtten specfcally for actuaral students preparng to take

More information

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

More information

General Auction Mechanism for Search Advertising

General Auction Mechanism for Search Advertising General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

More information

Interest Rate Fundamentals

Interest Rate Fundamentals Lecture Part II Interest Rate Fundamentals Topcs n Quanttatve Fnance: Inflaton Dervatves Instructor: Iraj Kan Fundamentals of Interest Rates In part II of ths lecture we wll consder fundamental concepts

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

LECTURE 1: MOTIVATION

LECTURE 1: MOTIVATION LECTURE 1: MOTIVATION STEVEN SAM AND PETER TINGLEY 1. Towards quantum groups Let us begn by dscussng what quantum groups are, and why we mght want to study them. We wll start wth the related classcal objects.

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate

More information

Combinatorial Agency of Threshold Functions

Combinatorial Agency of Threshold Functions Combnatoral Agency of Threshold Functons Shal Jan Computer Scence Department Yale Unversty New Haven, CT 06520 shal.jan@yale.edu Davd C. Parkes School of Engneerng and Appled Scences Harvard Unversty Cambrdge,

More information

arxiv:1311.2444v1 [cs.dc] 11 Nov 2013

arxiv:1311.2444v1 [cs.dc] 11 Nov 2013 FLEXIBLE PARALLEL ALGORITHMS FOR BIG DATA OPTIMIZATION Francsco Facchne 1, Smone Sagratella 1, Gesualdo Scutar 2 1 Dpt. of Computer, Control, and Management Eng., Unversty of Rome La Sapenza", Roma, Italy.

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Optimal Consumption and Investment with Transaction Costs and Multiple Risky Assets

Optimal Consumption and Investment with Transaction Costs and Multiple Risky Assets THE JOURNAL OF FINANCE VOL. LIX, NO. 1 FEBRUARY 2004 Optmal Consumpton and Investment wth Transacton Costs and Multple Rsky Assets HONG LIU ABSTRACT We consder the optmal ntertemporal consumpton and nvestment

More information

On the Interaction between Load Balancing and Speed Scaling

On the Interaction between Load Balancing and Speed Scaling On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An

More information

Nonbinary quantum error-correcting codes from algebraic curves

Nonbinary quantum error-correcting codes from algebraic curves Dscrete Mathematcs 308 (2008) 3115 3124 www.elsever.com/locate/dsc Nonbnary quantum error-correctng codes from algebrac curves Jon-Lark Km a, Judy Walker b a Department of Mathematcs, Unversty of Lousvlle,

More information

The University of Texas at Austin. Austin, Texas 78712. December 1987. Abstract. programs in which operations of dierent processes mayoverlap.

The University of Texas at Austin. Austin, Texas 78712. December 1987. Abstract. programs in which operations of dierent processes mayoverlap. Atomc Semantcs of Nonatomc Programs James H. Anderson Mohamed G. Gouda Department of Computer Scences The Unversty of Texas at Austn Austn, Texas 78712 December 1987 Abstract We argue that t s possble,

More information

4 Cosmological Perturbation Theory

4 Cosmological Perturbation Theory 4 Cosmologcal Perturbaton Theory So far, we have treated the unverse as perfectly homogeneous. To understand the formaton and evoluton of large-scale structures, we have to ntroduce nhomogenetes. As long

More information

Mean Molecular Weight

Mean Molecular Weight Mean Molecular Weght The thermodynamc relatons between P, ρ, and T, as well as the calculaton of stellar opacty requres knowledge of the system s mean molecular weght defned as the mass per unt mole of

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Hedging Interest-Rate Risk with Duration

Hedging Interest-Rate Risk with Duration FIXED-INCOME SECURITIES Chapter 5 Hedgng Interest-Rate Rsk wth Duraton Outlne Prcng and Hedgng Prcng certan cash-flows Interest rate rsk Hedgng prncples Duraton-Based Hedgng Technques Defnton of duraton

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

On Nicely Smooth Banach Spaces

On Nicely Smooth Banach Spaces E extracta mathematicae Vol. 16, Núm. 1, 27 45 (2001) On Nicely Smooth Banach Spaces Pradipta Bandyopadhyay, Sudeshna Basu Stat-Math Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035,

More information

Bandwdth Packng E. G. Coman, Jr. and A. L. Stolyar Bell Labs, Lucent Technologes Murray Hll, NJ 07974 fegc,stolyarg@research.bell-labs.com Abstract We model a server that allocates varyng amounts of bandwdth

More information