On Lockett pairs and Lockett conjecture for π-soluble Fitting classes
|
|
|
- Doreen Greene
- 10 years ago
- Views:
Transcription
1 On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou , P.R. Chna E-mal: Nanyng Yang School of Mathematcs and Scence, Unversty of Scence and Technology of Chna, Hefe , P. R. Chna E-mal: N.T.Vorob ev Department of Mathematcs, Masherov Vtebsk State Unversty, Vtebsk , Belarus E-mal: Abstract In ths paper, we construct a new and wde famly of Lockett pars n the class of all fnte π- soluble groups and gve a new characterstc of the valdty of Lockett conjecture. As applcaton, some known results are followed. 1 Introducton In the theory of fnte soluble groups, many well known results related to research of structures of Fttng classes and canoncal subgroups are closed connected wth the operators and defned by Lockett [13] (see also [8, chapter X]). In fact, every nonempty Fttng class F has the assocated Fttng classes F and F, where F s the smallest Fttng class contanng F such that the F -radcal of the drect product G H of any two groups G and H s equal to the drect product of the F -radcal of G and the F -radcal of H; F s the ntersecton of all Fttng classes X such that X =F (see [13] or [8, Chapter X]). If F = F, then the Fttng class s called a Lockett class. The nterest for the research of F and F s determned manly by the followng crcumstances. Frstly, the famly of Fttng classes satsfyng F = F s vast. In fact, by [8, Theorem X.1.25], every Fttng class closed about homomorphc mages or closed about fnte subdrect products, and every Fscher class (see [8, IX.3.3]) are all Lockett classes. Secondly, Lockett [13] formulated the conjecture that for every Fttng class F, there exsts a normal Fttng class X such that F = F X. Later, n ths case, we say that F satsfes Lockett conjecture n S, where S s the class of all soluble groups. AMS Mathematcs Subject Classfcaton (2000): 20D10 Keywords: Fttng class; π-soluble group; Lockett class; Lockett par; Lockett conjecture. 1
2 About the Lockett conjecture, Bryce and Cossey [6] proved that Lockett conjecture holds for all soluble S-closed local Fttng classes and that every soluble Fttng class F satsfes Lockett conjecture f and only f F = F S, where S s the smallest normal Fttng class. In the paper [6], Bryce and Cossey also gave the concept of Lockett par (F, H) (see [6, 5.1]). They call an ordered par (F, H) of two Fttng classes F and H a Lockett par (or n brevty, an L-par) f F H = (F H). It s easy to see that f F s a Lockett class, F H and (F, H) s a Lockett par, then F satsfes Lockett conjecture n H. In partcular, f F s a Lockett class, F S, H = S and (F, H) s a Lockett par, then F satsfes Lockett conjecture n S. We say that F s an L H -class f F satsfes Lockett conjecture n H. If F satsfes Lockett conjecture n S, then F s called an L-class. Recall that a Fttng class F s sad to be S-closed f every subgroup of G F s n F. Bryce and Cossey [6] n the unverse S proved the exstence of Lockett pars. They showed that f F and H are S-closed Fttng classes, then (F, H) s a Lockett par. In connecton wth ths, the followng problem arses. Problem 1.1. Whch Fttng classes F and H satsfy that (F, H) s a Lockett par? In partcular, whch Fttng classes F satsfes Lockett conjecture n H? Note that, up to now, the problem was resolved only n the followng specal cases: 1) F {XN, XS π }, where X s some nonempty soluble Fttng class, H s FS π -njector and L p (F)-njector closed for all prmes p (see Bedleman and Hauck [1]); 2) F = S π and H S π (see Brson [4]); 3) F s an arbtrary soluble local Fttng class, and H s ψ-njector closed, where ψ s a local functon of F (see Vorob ev [15]); 4) F = S, and H = E s the class of all fnte groups (see Berger [3]); 5) H s a Fscher class(.e., H s a Fttng class whch s closed under takng subgroups of the form P N where P s a Sylow subgroup and N s a normal subgroup) or s closed under takng F- subgroups, whose ntersecton wth F-radcal of G s a normal subgroup of G, F satsfes the property that XE p F XE p E p for some Fttng class X and all p Char(X) (see Gallego [9]); 6) F s ω-local wth char(f) ω and H = E s the class of all fnte groups (see [12]). In ths paper, we wll construct a new famly of Lockett pars n the class S π of all fnte π-soluble groups. In order to acheve the purpose, n secton 3, we wll gve the concept of π-hr-closed Fttng class for some Fttng class X, whch, n fact, s a generalzed S-closed Fttng class. Base on ths, n secton 4, we obtan a famly of Lockett pars and also gve a new characterstc of the valdty of Lockett conjecture. As applcaton, some known results n [1], [3], [4], [9], [12] and [15] are obtaned as corollares of our results. Throughout ths paper, all groups are fnte. All unexplaned notaton and termnology are standard. The reader s referred to [8] and [10] f necessary. 2
3 2 Prelmnares Recall that a class F of groups s called a Fttng class provded the followng two condtons are satsfed: () f G F and N G, then N F. () f N 1, N 2 G and N 1, N 2 F, then N 1 N 2 F. From the condton () n the defnton, we see that, for every non-empty Fttng class F, every group G has a largest normal F-subgroup whch s called the F-radcal of G and denote by G F. The product FH of two Fttng classes F and H s the class (G : G/G F H). It s well known that the product of any two Fttng classes s also a Fttng class and the multplcaton of Fttng classes satsfes assocatve law (see [8, IX.1.12]). Recall that a class H of groups s sad to be a saturated homomorph f the followng condtons hold: 1) H s closed about homomorphc mages, that s, f G H and N G, then G/N H; 2) If G/Φ(G) H, then G H. A nonempty Fttng class H s sad to be a Fscher class f H H whenever K G H and H/K s a nlpotent subgroup of G/K (see [8, IX.3.3]). Obvously, any S-closed Fttng class s a Fscher class. We here cte some propertes of the operators and, whch are used n later proof. Lemma 2.1([13] and [8, X]). Let F and H be two non-empty Fttng classes. Then: a) If F H, then F H and F H ; b) (F ) = F = (F ) F F = (F ) = (F ) ; c) F F A, where A s the class of all abelan groups; d) If {F I} s a set of Fttng classes, then ( I F ) = I F. e) If H s a saturated homomorph, then (FH) = F H. f) If F s a homomorph (n partcular, a formaton) or a Fscher class, then F s a Lockett class. Suppose that G s a group, X s a class of groups and P s the set of all prmes. Then we let σ(g) = {p P : p G }, σ(x) = {σ(g) : G X} and Char(X) = {p P : Z p X}. Lemma 2.2 [8, X.1.20]. Char(F ) = Char(F) and σ(f ) = σ(f) for every Fttng class F. Let ω P. We denote by E ω the class of all fnte ω-groups, N denotes the class of all fnte nlpotent groups, S denotes the class of all fnte soluble groups. For a class F of groups, put F ω = F E ω. Followng [14], a map f : ω {ω } {Fttng class} s sad to be a ω-local Hatley functon (or n brevty, a ω-local H-functon). Then LR ω (f) denotes the Fttng class ( p π2 E p ) ( p π1 f(p)n p E p ) E ω f(ω ), where π 1 = Supp(f) ω, π 2 = ω\π 1. Here, Supp(f) := {a ω {ω} : f(a) } s called the support of the ω-local H-functon f. A Fttng class F s sad to be a ω-local f there exsts an ω-local H-functon f such that F = LR ω (f). If ω = P, then the ω-local Fttng class F s sad to be local. 3
4 Lemma 2.3[17, Theorem]. If F s an ω-local Fttng class and a Lockett class as well, then F = LR ω (F ) and F (a) s a Lockett class for all a ω {ω }. Moreover, F (p)n p = F (p) F F (p)e p, for all p ω. For constructng Lockett pars, we need the concept of the normal subgroup N(G) of G and ts propertes whch gven by Gallego [9]. We use H sn G to denote that H s a subnormal subgroup of G. A subnormal embeddng of a subnormal subgroup S of G s a monomorphsm α : S G such that Sα sn G. Let Snemb(S G) denote the set of all subnormal embeddng of S n G. Then let N(G) = x 1 x α : x S sn G and α Snemb(S G). Lemma 2.4 [9, Proposton (3.1)(3.2)]. Let G be a group and F a Fttng class. Then () N(G) s a characterstc subgroup of G. () N(G) G F for all G F. Lemma 2.5 [9, Proposton (4.1)]. Suppose that F, H and X are Fttng classes. Then the followng statements are equvalent: (a) F H X. (b) N(G) G H G X, for all G F. Lemma 2.6. (1) (Čunhn [7]) Every π-soluble group G has a Hall π-subgroup and any two Hall π-subgroups of G are conjugate n G. (2) [11] If F s a Fttng class, then K π (F) = (G S π : Hall π (G) F) s a Fttng class. We use Hall π (G) to denote the set of all Hall π-subgroups of a π-soluble group G. In ths connecton, we have the followng generalzed result of [9, Proposton 4.3]. Lemma 2.7. Let G be a group, H Hall π (G), H N and F a Fttng class. Then H N(G) N(HG F ). Proof. Let H 0 = x 1 x α : x S sn G, α Snemb(S G) and x, x α H. We frst prove that H N(G) = H 0. By the defnton of N(G), every generator of N(G) has the form g 1 g α, where g S sn G and α Snemb(S G). Let g = xy, where x, y g S such that x s a π-element and y s a π -element. Snce H Hall π (G), there exst elements a and b of G such that x a H and (x α ) b H. It s clear that g 1 g α O π (G)G = x 1 x α O π (G)G = (x a ) 1 (x α ) b O π (G)G. Note that S a sn G, (S α ) b sn G and there exsts an somorphsm from S a onto (S α ) b such that the mage of x α s (x α ) b. Therefore (x a ) 1 (x α ) b H 0 and so g 1 g α H 0 O π (G)G. Snce N(G) s generated by such elements g 1 g α, we have N(G) H 0 O π (G)G and hence H N(G) H 0 (H O π (G)G ). Snce O π (G)G /G s a π -group, H O π (G)G = H G. By [2, 21.3(2)], H G H 0. Hence H N(G) H 0. On the other hand, obvously, H 0 H N(G). Therefore H N(G) = H 0. Ths shows that H N(G) s generated by the elements x 1 x α, where x S sn G, α Snemb(S G) and x, x α H. Note that the subgroup x S F = x (S G F ) = S x G F s subnormal n 4
5 HG F. Analogously, ( x S F ) α = x α SF α H N(G) N(HG F ). s subnormal n HG F. Therefore x 1 x α N(HG F ) and 3 HR-classes In order to construct a new famly of Lockett pars, n ths secton, we wll defne the followng generalzed S-closed Fttng classes. Defnton 3.1. Suppose that π P and X s a Fttng class. (a) A subgroup T of G s called a π-hr-subgroup f T = HG X for some Hall π-subgroup H of G. (b) A Fttng class F s called π-hr-closed f every π-hr-subgroup of G belongs to F whenever G F. If F s σ-hr-closed for any σ P, then F s called an HR-class. (c) If X = (1), we wrte π-h-class nstead π-hr-class, and wrte H-class nstead HRclass. The followng examples show that the famly of the Fttng classes defned n Defnton 3.1 s wde. Examples 3.2. (1) Suppose that F s a S-closed Fttng class. Then, obvously, F s an π-hg X - class, for any nonempty Fttng class X. (2) Recall that for a Fttng class F and a group G F, f H F for every H Hall π (G), then F s sad to be π-hall closed [4]. Obvously, a Fttng class F s a π-h-class f and only f t s π-hall closed. (3) Let π = P and S be the smallest normal Fttng class. By the result n [6], S s an H-class. (4) For any set π P and any Fttng class H, the Fttng class K π (H) = (G S π : Hall π (G) H) was defned n [11] (see Lemma 2.6(2)). Obvously, K π (H) s π-h-closed f and only f H K π (H). Moreover, by the proof of [5, Proposton 4.4], we can see that for any τ π, the Fttng class K τ (H)Z s π-h-closed for any π-h-closed Fttng class Z. 4 On problem of the constructon of L-pars and L-classes In ths secton, we construct a famly of Lockett pars and gve a new characterstc of the valdty of Lockett conjecture. Defnton 4.1. Let F and H be two Fttng classes. () We say that F and H satsfy Property (α σ ) f σ π and there exsts a Fttng class X such that XS σ F XS σ S π σ, H K σ (N) and H s a σ-hr-class. () Let Char(F) be the characterstc of F and Char(F) = I σ, where σ and σ σ j = for all, j I( j). We say that F and H satsfy Property (α) f F and H satsfy Property (α σ ) for all I. Lemma 4.2. Let F and H be Fttng classes. If F and H satsfes Property (α σ ), then F H (F H) S π σ. 5
6 Proof. Let (F H) S π σ = M. In order to prove F H M, by Lemma 2.5, we only need to prove that N(G) G F G M for every G H. Suppose that G H and H Hall σ (G). Then HG X /G X Hall σ (G/G X ) and so HG X /G X S σ. Hence, from [8, IX, 1.11], we have H XS σ F. Snce H s a σ-hr-class by hypothess, HG X H. Hence, HG X F H. Besdes, snce H s a Hall σ-subgroup, by Lemma 2.7, we have H N(G) N(HG X ). Hence, H N(G) G F N(HG X ) G F. We clam that N(HG X ) G F (HG X G F ) (F H). In fact, snce HG X F H, by Lemma 2.4 N(HG X ) (HG X ) (F H) and so N(HG X ) G F (HG X ) (F H) G F. But, because HG X G F HG X, by [8, IX.1.1((a)], we have (HG X G F ) (F H) = (HG X ) (F H) (HG X G F ) = (HG X ) (F H) G F. Hence N(HG X ) G F (HG X ) (F H) G F = (HG X G F ) (F H). Now we prove HG X G F G. In fact, snce G F XS σ S π σ, G F /G XSσ S π σ. Then, by theorem [8, IX.1.12], (G F /G X )/(G XSσ /G X ) = (G F /G X )/(G/G X ) Sσ S π σ and so G XSσ /G X Hall σ (G F /G X ). On the other hand, snce H Hall σ (G), (H G F )G X /G X Hall σ (G F /G X ). Hence G XSσ = (H G F )G X = HG X G F and HG X G F G. Ths mples that (HG X G F ) (F H) G (F H). Therefore, H N(G) G F G (F H) N(G) G F. But by Lemma 2.4(), N(G) G. Hence G (F H) (N(G) G F ) = (N(G) G F ) (F H) by [8, IX, 1.1 (a)]. It follows that H (N(G) G F ) (N(G) G F ) (F H). Snce H 1 := H (N(G) G F ) s a Hall σ-subgroup of N(G) G F, (N(G) G F ) : H 1 s a σ -number. But snce H 1 (N(G) G F ) (F H), (N(G) G F )/(N(G) G F ) (F H) S π σ. Hence N(G) G F (F H) S π σ = M. Consequently N(G) G F G M. Ths completes that proof. The followng theorem descrbes a new and wde famly of Lockett pars. In partcular, the theorem gve some new Fttng classes whch satsfy Lockett conjecture. Theorem 4.3. Let F and H be two Fttng classes. If F and H satsfy Property (α), then (F, H) s an L-par. In partcularly, f F H, then F s an L H -class, that s, F satsfes Lockett conjecture n H. Proof. By Lemma 4.2, we only need to prove that f F H (F H)S π σ for every I, then F H = (F H). Frstly, by Lemma 2.1, we have (F H) F H. Conversely, assume that t s not true and let G be a group n F H \ (F H) of mnmal order. Then G has a unque maxmal normal subgroup M = G (F H). Snce G F H, G F H by Lemma 2.1(a)(b). Then by usng Lemma 2.1(b)(c), we obtan that G (F H) A, where A s the class of all abelan groups. Hence, G/M has a unque maxmal normal subgroup of order p and so G/M Z p. Snce G F H, p Char(F H) by [8, Lemma IX.1.7]. It follows from Lemma 2.2 that there exsts σ 0 Char(F H) for 0 I such that p σ 0 Char((F H) ). Therefore G/M S σ0. On the other hand, snce σ, F and H satsfy condtons of Lemma 4.2, F H (F H) S π σ. 0 Snce G F H and M = G (F H), we have G/M S π σ. Ths mples that G = M (F H). 0 Ths contradcton shows that (F, H) s an L-par. 6
7 Now assume that F H. In order to prove that F s an L-class (that s, F satsfes Lockett conjecture), clearly, we only need to prove that F s a Lockett class (that s, F = F). By the hypothess, F satsfes Property (α). Hence XS σ F XS σ S π σ for all I. Then by Lemma 2.1(a), we see that F (XS σ S π σ ). But by [15, Corollary], XS σ S π σ s local and so t s a Lockett class by [15, Lemma 5]. Therefore, (XS σ S π σ ) = XS σ S π σ and thereby F FS π σ for all I. By Lemma 2.2, Char(F) = Char(F ). Now analogous proof from F H (F H) S π σ to F H (F H), we obtan that F = F. Ths completes the proof. 5 Applcatons By usng Theorem 4.3, we mmedately obtan the followng known results about descrpton of L-par and L-class. Corollary 5.1(Bryce, Cossey [6]). If F and H are soluble S-closed Fttng classes, then (F, H) s an L-par. In partcularly, (F, S) s an L-par, that s, every S-closed Fttng class s an L-class. Proof. By [17, Theorem], F and H are local Fttng classes. Put σ = {p} n Theorem 4.3, for all p Char(F) and I. Snce H s S-closed, H s an HR-class for any Fttng class X. Besdes, by Lemma 2.3, for ω = P and every p Char(F), we have F (p)n p F F (p)n p S p. Thus, by Theorem 4.3, (F, H) s an L-par. Besdes, by Lemma 2.1(f), F = F. If H = S, then F s an L-class, that s, F satsfes Lockett conjecture. Corollary 5.2[see 12, Theorem B]. If F = LR ω (F ) s ω-local Fttng class wth Char(F) ω, then (F, S π ) s an L-par and F s an L-class. Proof. By Lemma 2.3, F (p)n p F F (p)n p S π p for all p Char(F). Hence, f put σ = {p} for all p Char(F) and I and let H = S π, the F and H satsfy the hypothess of Theorem 4.3. Thus, by Theorem 4.3, (F, S π ) s an L-par and so, clearly, F s an L-class snce F H. Put ω = π, then by Corollary 5.2, we have Corollary 5.3. If F s a local Fttng class, then (F, S π ) s an L-par. Put ω = π = P, then by Corollary 5.2, we obtan Corollary 5.4[15]. Lockett conjecture holds for every soluble local Fttng class F, that s, f F S, then par (F, S) s an L-par. Corollary 5.5[1]. Let F {XN, XS π S π }, where X s some nonempty soluble Fttng class. Then F satsfes Lockett conjecture. Proof. By [15, Corollary], XN and XS π S π are all local Fttng classes. Hence by Corollary 5.3, the statement holds. Corollary 5.6. Let σ π and F, H be Fttng classes such that F = S σ H. Then (F, H) s an L-par and S σ s an L H -class. Proof. Obvously, F s local. By Lemma 2.3, for ω = P, F satsfes the related condtons of Theorem 4.3 for F f put σ = {p} for all p Char(F) and I. Besdes, by [15, Lemma 5], F s a Lockett class, that s, F = F. Now we prove that (F, H) s an L-par, that s, F H = (F H). 7
8 If σ = φ, then F = (1) and so t s trval. If σ = {p}, then by [8, X.1.23], (N p ) = N p and so N p H = (N p H) = (N p ). Put σ 2. Snce S σ H, then H s a p-h-class and H K p (N) for every p Char(F) = σ. Thus by Theorem 4.3, (S σ, H) s an L-par. For π = P we have Corollary 5.7[4]. Let F, H be soluble Fttng classes and σ P. If F = S σ H, then (F, H) s an L-par and F s an L H -class. References [1] Bedleman J. C. and Hauck P., Über Fttngklassen and de Lockett-Vermutung, Math Z., 167, 1979, [2] Belonogov V.A., Problems on Theory of Groups, Moscow, Nauka, [3] Berger T.R., Normal Fttng pars and Lockett s conjecture, Math Z., 163, 1978, [4] Brson O.Y., Hall operaters for Fttng class, Arch. Math.(Basel), 33, 979/1980, 1-9. [5] Brson O.Y., Hall-closure and products of Fttng classes, J. Austral Math. Soc.(Seres A) 32, 1982, [6] Bryce R.A. and Cossey J., A problem n the theory of normal Fttng classes, Math. Z., 141, 1975, [7] Čunhn S. A., On π-separable groups, Doklady Akad, Nauk SSSR (N. S.), 59, 1948, [8] Doerk K. and Hawkes T.O., Fnte Soluble Groups, Walter de Gruyter, Berln, New York, [9] Gallego M.P., Fttng pars from drect lmtes and the Lockett conjecture, Comm. n Algebra, 24(6), 1996, [10] Guo W., The Theory of Classes of Groups, Scence Press-Kluwer Academc Publshers, Bejng- New York-Dordrecht-Boston-London, [11] Guo W., L B., On Shemetkov Problem for Fttng classes, Contrbutons to Algebra and Geometry, 48(1), 2007, [12] Guo W., Shum K. P. and Vorob ev N.T., Problems related to the Lockett conjecture on Fttng classes of fnte groups, Indag. Mathem., N.S., 19(3), 2008, [13] Lockett P., The Fttng class F, Math Z., 137, 1974, [14] Shemetkov L.A. and Skba A.N., Multply ω-local formatons and Fttng classes of fnte groups, Sberan Advances n Mathematcs, 10(2), 1999,
9 [15] Vorob ev N.T., On radcal classes of fnte groups wth the Lockett condton, Math. Zametk, 43, 1988, ; translated n Math. Notes, 43, 1988, [16] Vorob ev N.T., Localty of solvable subgroup-closed Fttng classes, Math. Zametk, 51, 1992, 3-8; translaton n Math, Notes 51, 1992, [17] Vorob ev N.T., On largest ntegrated Hartley s functon, Proc. Gomel Unversty, Problems n Algebra, 1(15), 2002,
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
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.
REGULAR MULTILINEAR OPERATORS ON C(K) SPACES
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
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
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
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
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
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
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
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, ()
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
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
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
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
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
Support Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada [email protected] Abstract Ths s a note to explan support vector machnes.
Cluster algebras were introduced by Fomin and Zelevinsky (1)
Greedy bases n rank quantum cluster algebras Kyungyong Lee a,ll b, Dylan Rupel c,, and Andre Zelensky c, a Department of Mathematcs, Wayne State Unersty, Detrot, MI 480; b Department of Mathematcs and
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
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.
ON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS
ON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. We characterze all cyclotomc polynomals of even egree wth coeffcents restrcte to the set {+1, 1}. In ths
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
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
Finite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
+ + + - - 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
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
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
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
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
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
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
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
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
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
A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
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
Duality for nonsmooth mathematical programming problems with equilibrium constraints
uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 DOI 10.1186/s13660-016-0969-4 R E S E A R C H Open Access Dualty for nonsmooth mathematcal programmng problems wth equlbrum constrants Sy-Mng
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
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 [email protected] Abstract.
Efficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
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
The OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
A Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
Using Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
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
7.5. Present Value of an Annuity. Investigate
7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on
Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
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
The Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn [email protected]
LINES ON BRIESKORN-PHAM SURFACES
LIN ON BRIKORN-PHAM URFAC GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Abstact By usng toc modfcatons and a esult of Gonzalez-pnbeg and Lejeune- Jalabet, we answe the followng questons completely
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,
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..
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
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS
Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May 2013 AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Len Harn 1 and Changlu Ln 2 1 Department of Computer Scence
Economic Models for Cloud Service Markets
Economc Models for Cloud Servce Markets Ranjan Pal and Pan Hu 2 Unversty of Southern Calforna, USA, [email protected] 2 Deutsch Telekom Laboratores, Berln, Germany, [email protected] Abstract. Cloud computng
The Stock Market Game and the Kelly-Nash Equilibrium
The Stock Market Game and the Kelly-Nash Equlbrum Carlos Alós-Ferrer, Ana B. Ana Department of Economcs, Unversty of Venna. Hohenstaufengasse 9, A-1010 Venna, Austra. July 2003 Abstract We formulate the
Trivial lump sum R5.0
Optons form Once you have flled n ths form, please return t wth your orgnal brth certfcate to: Premer PO Box 2067 Croydon CR90 9ND. Fll n ths form usng BLOCK CAPITALS and black nk. Mark all answers wth
Cautiousness and Measuring An Investor s Tendency to Buy Options
Cautousness and Measurng An Investor s Tendency to Buy Optons James Huang October 18, 2005 Abstract As s well known, Arrow-Pratt measure of rsk averson explans a ratonal nvestor s behavor n stock markets
Brigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems
Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
Do Hidden Variables. Improve Quantum Mechanics?
Radboud Unverstet Njmegen Do Hdden Varables Improve Quantum Mechancs? Bachelor Thess Author: Denns Hendrkx Begeleder: Prof. dr. Klaas Landsman Abstract Snce the dawn of quantum mechancs physcst have contemplated
A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
Complete Fairness in Secure Two-Party Computation
Complete Farness n Secure Two-Party Computaton S. Dov Gordon Carmt Hazay Jonathan Katz Yehuda Lndell Abstract In the settng of secure two-party computaton, two mutually dstrustng partes wsh to compute
1. Math 210 Finite Mathematics
1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210
Allocating Collaborative Profit in Less-than-Truckload Carrier Alliance
J. Servce Scence & Management, 2010, 3: 143-149 do:10.4236/jssm.2010.31018 Publshed Onlne March 2010 (http://www.scrp.org/journal/jssm) 143 Allocatng Collaboratve Proft n Less-than-Truckload Carrer Allance
Sngle Snk Buy at Bulk Problem and the Access Network
A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network
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
In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is
Payout annutes: Start wth P dollars, e.g., P = 100, 000. Over a 30 year perod you receve equal payments of A dollars at the end of each month. The amount of money left n the account, the balance, earns
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.
The program for the Bachelor degrees shall extend over three years of full-time study or the parttime equivalent.
Bachel of Commerce Bachel of Commerce (Accountng) Bachel of Commerce (Cpate Fnance) Bachel of Commerce (Internatonal Busness) Bachel of Commerce (Management) Bachel of Commerce (Marketng) These Program
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
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.
Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
A Statistical Model for Detecting Abnormality in Static-Priority Scheduling Networks with Differentiated Services
A Statstcal odel for Detectng Abnoralty n Statc-Prorty Schedulng Networks wth Dfferentated Servces ng L 1 and We Zhao 1 School of Inforaton Scence & Technology, East Chna Noral Unversty, Shangha 0006,
An Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
Groups with the same orders and large character degrees as PGL(2, 9) 1. Introduction and preliminary results
Quasigroups and Related Systems 21 (2013), 239 243 Groups with the same orders and large character degrees as PGL(2, 9) Behrooz Khosravi Abstract. An interesting class of problems in character theory arises
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
From Selective to Full Security: Semi-Generic Transformations in the Standard Model
An extended abstract of ths work appears n the proceedngs of PKC 2012 From Selectve to Full Securty: Sem-Generc Transformatons n the Standard Model Mchel Abdalla 1 Daro Fore 2 Vadm Lyubashevsky 1 1 Département
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
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
