ON SEPARATING SETS OF WORDS IV
|
|
- Darcy Payne
- 5 years ago
- Views:
Transcription
1 ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle s an mmedate contnuaton of [1], [2] and [3]. References lke I.3.3 (II.3.3, III.3.3, resp.) lead to the correspondng secton and result of [1] ([2], [3], resp.) and all defntons and prelmnares are taken from the same source. 2. Complementary sequences Troughout ths note, let Z A + be a strongly separatng set of words and let ψ : Z A be a mappng wth ψ(z) z for every z Z. Notce that then the correspondng replacement relaton ρ (= ρ Z,ψ ) s rreflexve. Two sequences p 0, p 1,..., p m and q 0, q 1,..., q m, m 1, of words wll be called ((Z, ψ) or ρ-) complementary f, for every 0 < m, ether (p, p +1 ) ρ and q = q +1 or p = p +1 and (q, q +1 ) ρ. Notce that due to the rreflexvty of ρ, just one of the two cases holds. Lemma 2.1. Let p 0, p 1,..., p m and q 0, q 1,..., q m be complementary sequences. Then: () Both the sequences are λ-sequences. () (p 0, p m ) ξ and (q 0, q m ) ξ. () If (p 0, p m ) / τ ((q 0, q m ) / τ, resp.), then p 0 = p 1 = = p m (q 0 = q 1 = = q m, resp.), q 0, q 1,..., q m (p 0, p 1,..., p m, resp.) s a ρ-sequence and (q 0, q m ) τ ((p 0, p m ) τ, resp.). (v) Ether (p 0, p m ) τ or (q 0, q m ) τ. Proof. Easy. Let w 0, w 1,..., w m be a ρ-sequence and let z Z. Furthermore, let = (p, z, q ) Tr(w ) (so that w = p zq ) for all = 0, 1,..., m. We wll say that the ρ-sequence s (z, 0,..., m )-fluent f the sequences p 0, p 1,..., p m and q 0, q 1,..., q m are complementary. The work s a part of the research project MSM fnanced by MŠMT and the second author was supported by the Grant Agency of Czech Republc, No. 201/09/
2 ON SEPARATING SETS OF WORDS IV 2 Lemma 2.2. Let (w 0, w 1 ) ρ and = (p 0, z, q 0 ) Tr(w 0 ). w 0 = p 0 zq 0 and at least one of the followng two cases holds: Then (1) w 0 w 1, (w 0, w 1 ) ρ z and w 1 = p 0 ψ(z)q 0 ; (2) w 1 = p 1 zq 1 and the sequences p 0, p 1 and q 0, q 1 are complementary (and hence the sequence w 0, w 1 s (z,, β)-fluent, β = (p 1, z, q 1 )). Proof. Assume that (1) s not true. Then there s γ = (r, z 1, s) Tr(w 0 ) such that γ and w 1 = rψ(z 1 )s. We have p 0 zq 0 = w 0 = rz 1 s, where p 0 r and q 0 s. Consequently, p 0 r and q 0 s. Frst, assume that p 0 < r. Then r = p 0 r 1, r 1 ε, zq 0 = r 1 z 1 s, q 0 > s, q 0 = s 1 s, s 1 ε and zs 1 = r 1 z 1. From ths, r 1 = zt and s 1 = tz 1 and we get w 0 = p 0 zq 0 = p 0 r 1 z 1 s = p 0 ztz 1 s, q 0 = tz 1 s, r = p 0 zt, w 1 = rψ(z 1 )s = p 0 ztψ(z 1 )s = p 1 zq 1, where p 0 = p 1, q 1 = tψ(z 1 )s and (q 0, q 1 ) ρ. Next assume that r < p 0. Then p 0 = rr 1, r 1 ε, r 1 zq 0 = z 1 s, r 1 z 1, r 1 = z 1 t, s = tzq 0, p 0 = rz 1 t. Now, w 0 = rz 1 tzq 0, w 1 = rψ(z 1 )s = rψ(z 1 )tzq 0 = p 1 zq 1, where q 0 = q 1, p 1 = rψ(z 1 )t and (p 0, p 1 ) ρ. The lemma follows easly from I.6.4 as well. Lemma 2.3. Let w 0, w 1,..., w m be a ρ-sequence and let 0 = (p 0, z, q 0 ) Tr(w 0 ) (so that w 0 = p 0 zq 0 ). Then at least one of the followng two cases holds: (1) w 0 0 w1, (w 0, w 1 ) ρ z and w 1 = p 0 ψ(z)q 0 ; (2) There are 1 n m and = (p, z, q ) Tr(w ) (so that w = p zq ), 0 n, such that the sequence w 0, w 1,..., w n s (z, 0, 1,..., n )-fluent and ether n = m or n < m and w n+1 = p n ψ(z)q n (so that (w n, w n+1 ) ρ z and w n n wn+1 ). Proof. Assume that (1) s not true and proceed by nducton on m. If m = 1 then 2.2 apples. If m 2, we consder the sequence w 1, w 2,..., w m. Remark 2.4. Consder the stuaton from 2.3 (2) and assume that n < m. Put v 0 = p 0 zq 0 = w 0, v 1 = p 0 ψ(z)q 0, v 2 = p 1 ψ(z)q 1,..., v n = p n 1 ψ(z)q n 1 and v n+1 = p n ψ(z)q n = w n+1. Clearly, w 0 = v 0, v 1,..., v n, v n+1 = w n+1 s a ρ-sequence, v 0 = w 0 0 v1, w 1 1 v2,..., w n n vn+1 = w n+1 and w 0 = v 0, v 1,..., v n, v n+1 = w n+1, w n+2,..., w m s a ρ-sequence. In partcular, (p 0 ψ(z)q 0, w m ) = (v 1, w m ) τ. 3. Auxlary results (a) Lemma 3.1. Let z 1, z 2 Z and r A. Then z 1 rψ(z 2 ) = ψ(z 1 )rz 2 ff at least (and then just) one of the followng two cases holds: (1) There are s, t A + such that sr = rt (see I.3.5) and z 1 = ψ(z 1 )s, z 2 = tψ(z 2 );
3 ON SEPARATING SETS OF WORDS IV 3 (2) There are s, t A + such that sr = rt and ψ(z 1 ) = z 1 s, ψ(z 2 ) = tz 2. Proof. Easy. Corollary 3.2. The followng two condtons are equvalent: () z 1 rψ(z 2 ) ψ(z 1 )rz 2 for all z 1, z 2 Z and r A. () sr rt for every r A whenever s, t A + and z 1, z 2 Z are such that ether z 1 = ψ(z 1 )s and z 2 = tψ(z 2 ) or ψ(z 1 ) = z 1 s and ψ(z 2 ) = tz 2 (the latter case does not take place when ψ s strctly length decreasng). Lemma 3.3. Let (w 0, w 1 ) ρ and = (p 0, z, q 0 ) Tr(w 0 ) (see 2.2). If the equvalent condtons of 3.2 are satsfed, then just one of the cases 2.2 (1), (2) holds. Proof. If both 2.2 (1), (2) are true, then p 0 ψ(z)q 0 = w 1 = p 1 zq 1 and ether p 0 = p 1 and (q 0, q 1 ) ρ or (p 0, p 1 ) ρ and q 0 = q 1. Assume the frst case, the other one beng smlar. Then ψ(z)q 0 = zq 1, q 0 = rz 1 s, q 1 = rψ(z 1 )s and ψ(z)rz 1 = zrψ(z 1 ). The rest s clear from 3.2. Remark 3.4. Assume that the equvalent condtons of 3.2 are satsfed and let (w 0, w 1 ) ρ. Then t follows from 3.3 that w 0 0 w1 for a unquely determned nstance Tr(w 0 ). Remark 3.5. Assume that the equvalent condtons of 3.2 are satsfed and consder the stuaton from 2.3. Then just one of the cases 2.3 (1), (2) holds. Furthermore, f 2.3 (2) s true, then the number n and the nstances 0, 1,..., n are determned unquely. 4. Auxlary results (b) In ths secton, let z 1, z 2 Z, z 1 z 2, r 1, r 2, s 1, s 2 A, t 1 = r 1 z 1 s 1 and t 2 = r 2 z 2 s 2. Lemma 4.1. t 1 t 2 n each of the followng sx cases: (1) r 1 = r 2 ; (2) s 1 = s 2 ; (3) r 1, s 1 are reduced; (4) r 2, s 2 are reduced; (5) r 1, r 2 are reduced; (6) s 1, s 2 are reduced. Proof. Easy to see (use I.6.4). Lemma 4.2. Assume that the mappng ψ s length decreasng. Then (t 1, t 2 ) / τ n each of the followng three cases: (1) r 1 + s 1 r 2 + s 2, z 1 z 2 and at least one of these nequaltes s sharp (equvalently, t 1 < t 2 );
4 ON SEPARATING SETS OF WORDS IV 4 (2) r 1, s 1 are reduced, r 1 + s 1 r 2 + s 2, ψ(z 1 ) z 2 and at least one of these nequaltes s sharp; (3) r 1, s 1 are reduced and ψ(z 1 ) < z 1. Proof. Easy (f r 1, s 1 are reduced and (t 1, t 2 ) τ, then (r 1 ψ(z 1 )s 1, t 2 ) ξ). Corollary 4.3. Assume that the mappng ψ s strctly length decreasng and the words r 1, r 2, s 1, s 2 are reduced. Then (t 1, t 2 ) / ξ and (t 2, t 1 ) / ξ. 5. Auxlary results (c) In ths secton, let z Z, r, s A and t = r z s, = 1, 2, be such that (t 1, t 2 ) / ξ and (t 2, t 1 ) / ξ (see the precedng secton). Put (P (t 1, t 2 ) =) P = {w A (w, t 1 ) ξ, (w, t 2 ) ξ} and denote by (Q(t 1, t 2 ) =) Q the set of w P such that w = w whenever w P and (w, w ) ξ. Lemma 5.1. () If w P, then (w, t 1 ) τ, (w, t 2 ) τ and t 1 w t 2. () If w P, then w Q f and only f (w, w ) / ρ for every w P. Proof. Easy. Remark 5.2. Assume that P. By III.6.4 (), there exsts at least one word t A wth (t 1, t) ξ and (t 2, t) ξ. Then (t 1, t) τ and (t 2, t) τ. Furthermore, f r, s are reduced, then (r 1 ψ(z 1 )s 1, t) ξ and (r 2 ψ(z 2 )s 2, t) ξ. Lemma 5.3. Assume that the relaton ρ s regular (e.g., f ψ s strctly length decreasng see III.7.7). Then for every w P there exsts at least one w Q wth (w, w ) ξ. Proof. Put R = {v P (w, v) ξ} and M = {dst(v, t 1 )+dst(v, t 2 ) v R}. Then M s a non-empty set of postve ntegers and f w R s such that dst(w, t 1 ) + dst(w, t 2 ) s the smallest number n M, then w Q. Notce that f ψ s strctly length decreasng and w R s such that w s the smallest number n R, then w Q. Now, take w Q and let w () 0, w () 1,..., w m (), m 1, = 1, 2, be ρ-sequences such that w () 0 = w and w m () = t. Lemma 5.4. If (w ( 1) j, w ( 2) k ) ξ for { 1, 2 } = {1, 2} and some 0 j m 1, 0 k m 2, then w ( 1) j = w. Proof. We have (w ( 1) j, t 1 ) ξ and (w ( 2) k, t 2 ) ξ. Snce 1 2, t follows that w ( 1) j P. But w Q and (w, w ( 1) j ) ξ. Consequently, w ( 1) j = w.
5 Lemma 5.5. w (1) 1 w (2) 1. ON SEPARATING SETS OF WORDS IV 5 Proof. If w (1) 1 = v = w (2) 1, then v P, (w, v) ρ and v = w, snce w Q. Thus (w, w) ρ, a contradcton wth the rreflexvty of ρ. Lemma 5.6. Assume that ether τ s rreflexve (see III.3.3) or that the sum m 1 + m 2 s mnmal (for the word w). Then: () (w ( 1) j, w ( 2) k ) / ξ for all { 1, 2 } = {1, 2}, 0 j m 1, 0 k m 2. () All the words w = w (1) 0 = w (2) 0, w () j, j = 1, 2,..., m, = 1, 2, are par-wse dfferent. Proof. Easy (use 5.4). Lemma 5.7. tr(w) 2 (. e., w s not meagre). Proof. Clearly, w s not reduced. On the other hand, f tr(w) = 1, then w = pzq, where z Z and p, q are reduced. Consequently, w () 1 = pψ(z)q, w (1) 1 = w (2) 1, a contradcton wth 5.5. Lemma 5.8. alph(w) alph(t 1 ) alph(t 2 ). Proof. Let, on the contrary, w = pzq, where z Z and z / alph(t 1 ) alph(t 2 ). Usng 2.3 and 2.4, we get ρ-sequences v () 0, v () 1,..., v m (), = 1, 2, such that v () 0 = w, v () 1 = pψ(z)q and v m () = t. Then v () 1 = v, where (v, t ) ξ, v P and v = w a contradcton wth the rreflexvty of ρ. Lemma 5.9. Assume that z 1 z 2 and z 1 / alph(r 2 ) alph(s 2 ) (. e., z 1 / alph(t 2 )). If w = p 0 z 1 q 0, then the sequence w = w (1) 0, w (1) 1,..., w (1) t 1 s (z 1, 0,..., m1 )-fluent, where 0 = (p 0, z 1, q 0 ), 1 = (p 1, z 1, q 1 ), m1 = (p m1, z 1, q m1 ), p m1 = r 1, q m1 = s 1 (then (p 0, r 1 ) ξ and (q 0, s 1 ) ξ). Proof. Proceedng by contradcton, assume that our result s not true. Accordng to 2.3 and 2.4, there s a ρ-sequence w = v (2) 0, p 0 ψ(z 1 )q 0 = v (2) 1, v (2) 2..., v m (2) 2 = t 2. Thus v (1) 1 = v = v (2) 1, (v, t 1 ) ξ, (v, t 2 ) ξ, v P and v = w, (w, w) ρ, a contradcton wth the rreflexvty of ρ. Lemma Assume that z 1 z 2 and z 1 / alph(r 1 ) alph(r 2 ) alph(s 2 ). Then w y 0 z 1 y 1 z 1 y 2 for all y 0, y 1, y 2 A. Proof. Let, on the contrary, w = y 0 z 1 y 1 z 1 y 2. Then (y 0 z 1 y 1, r 1 ) ξ and (y 2, s 1 ) ξ by 5.9 and 2.1 (). Snce z 1 / alph(r 1 ), we have (y 0 ψ(z 1 )y 1, r 1 ) ξ by 2.4, and therefore (y 0 ψ(z 1 )y 1 z 1 y 2, t 1 ) ξ. On the other hand, z 1 / alph(t 2 ), and so (y 0 ψ(z 1 )y 1 z 1 y 2, t 2 ) ξ as well. Thus y 0 ψ(z 1 )y 1 z 1 y 2 P, a contradcton wth w Q and ψ(z 1 ) z 1. m 1 =
6 ON SEPARATING SETS OF WORDS IV 6 Proposton Assume that z 1 z 2 and r, s are reduced, = 1, 2. Then there exst reduced words x 0, x 1, x 2 A such that just one of the followng two cases takes place: (1) w = x 0 z 1 x 1 z 2 x 2, x 0 = r 1, (x 1 z 2 x 2, s 1 ) τ, (x 0 z 1 x 1, r 2 ) τ and x 2 = s 2 (then w = r 1 z 1 x 1 z 2 s 2, (x 1 ψ(z 2 )s 2, s 1 ) ξ, (r 1 ψ(z 1 )x 1, r 2 ) ξ and r 1, s 2 are reduced); (2) w = x 0 z 2 x 1 z 1 x 2, x 0 = r 2, (x 1 z 1 x 2, s 2 ) τ, (x 0 z 2 x 1, r 1 ) τ and x 2 = s 1 (then w = r 2 z 2 x 1 z 1 s 1, (x 1 ψ(z 1 )s 1, s 2 ) ξ, (r 2 ψ(z 2 )x 1, r 1 ) ξ and r 2, s 1 are reduced). Proof. Combnng 5.7, 5.8 and 5.10 (and the dual), we see that tr(w) = 2 and alph(w) = {z 1, z 2 }. Accordng to I.6.4, ether w = x 0 z 1 x 1 z 2 x 2 or w = x 0 z 2 x 1 z 1 x 2, where x 0, x 1 and x 2 are reduced. Assume the former equalty, the latter beng dual. Now, t follows from 5.9 that (x 0, r 1 ) ξ. Snce x 0 s reduced, we get x 0 = r 1. Furthermore, (x 1 z 2 x 2, s 1 ) ξ and, snce z 2 / alph(s 1 ), we have (x 1 z 2 x 2, s 1 ) τ. The rest s smlar. Remark Consder the stuaton from 5.11 (and ts proof) and assume that (1) s true (the other case beng dual). Put u 1 = x 1 ψ(z 2 )s 2 and u 2 = r 1 ψ(z 1 )x 1. We have (u 1, s 1 ) ξ and (u 2, r 2 ) ξ. () If u 1 s reduced, then u 1 = s 1, t 1 = r 1 z 1 x 1 ψ(z 2 )s 2, (w, t 1 ) ρ and (t 1, u 3 ) ρ, where u 3 = r 1 ψ(z 1 )x 1 ψ(z 2 )s 2. () If u 2 s reduced, then u 2 = r 2, t 2 = r 1 ψ(z 1 )x 1 z 2 s 2, (w, t 2 ) ρ and (t 2, u 3 ) ρ, where u 3 = r 1 ψ(z 1 )x 1 ψ(z 2 )s 2. () If the equvalent condtons of II.7.3 are satsfed, then all the words u 1, u 2, s 1, r 2 are meagre. Now, f s 1 s not reduced, then s 1 = y 0 z 3 y 1, z 3 Z, z 1 z 3 z 2, y 0, y 1 are reduced and t 1 = r 1 z 1 y 0 z 3 y 1. If r 2 s not reduced, then r 2 = y 2 z 4 y 3, z 4 Z, z 1 z 4 z 2, y 2, y 3 are reduced and t 2 = y 2 z 4 y 3 z 2 s 2. Remark Assume that P and choose w P such that m 1+m 2 s mnmal, where m 1 and m 2 s the length of a ρ-sequence from w to t 1 and t 2, resp. It s easy to see that 5.5, 5.7, 5.8 and 5.9 reman true. 6. The ultmate consequence Theorem 6.1. Assume that the mappng ψ s strctly length decreasng. Let z 1, z 2 Z and r 1, r 2, s 1, s 2 A be such that z 1 z 2, the words r 1, r 2, s 1, s 2 are reduced and P (t 1, t 2 ), where t 1 = r 1 z 1 s 1 and t 2 = r 2 z 2 s 2. Then Q(t 1, t 2 ) and, f w Q(t 1, t 2 ), then just one of the followng two cases takes place: (1) w = r 1 z 1 xz 2 s 2, (r 1 z 1 x, r 2 ) τ, (xz 2 s 2, s 1 ) τ and x s reduced; (2) w = r 2 z 2 yz 1 s 1, (r 2 z 2 y, r 1 ) τ, (yz 1 s 1, s 2 ) τ and y s reduced. Proof. By 5.3, Q(t 1, t 2 ). The rest follows from 5.11.
7 ON SEPARATING SETS OF WORDS IV 7 References [1] V. Flaška, T. Kepka and J. Kortelanen, On separatng sets of words I, Acta Unv. Carolnae Math. Phys., 49/1(2008), [2] V. Flaška, T. Kepka and J. Kortelanen, On separatng sets of words II, Acta Unv. Carolnae Math. Phys., 50/1(2009), [3] V. Flaška, T. Kepka and J. Kortelanen, On separatng sets of words III, preprnt. Department of Algebra, MFF UK, Sokolovská 83, Praha 8 Department of Informaton Processng Scence, Unversty of Oulu, P. O. BOX 3000 FIN-90014, Oulu E-mal address: flaska@matfyz.cz E-mal address: kepka@karln.mff.cun.cz E-mal address: juha.kortelanen@oulu.f
The Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationRoot Structure of a Special Generalized Kac- Moody Algebra
Mathematcal Computaton September 04, Volume, Issue, PP8-88 Root Structu of a Specal Generalzed Kac- Moody Algebra Xnfang Song, #, Xaox Wang Bass Department, Bejng Informaton Technology College, Bejng,
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationA FIXED POINT THEOREM FOR THE PSEUDO-CIRCLE
A FIXED POINT THEOREM FOR THE PSEUDO-CIRCLE J. P. BOROŃSKI Abstract. Let f : C C be a self-map of the pseudo-crcle C. Suppose that C s embedded nto an annulus A, so that t separates the two components
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationMATH Homework #2
MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationarxiv: v4 [math.ac] 20 Sep 2013
arxv:1207.2850v4 [math.ac] 20 Sep 2013 A SURVEY OF SOME RESULTS FOR MIXED MULTIPLICITIES Le Van Dnh and Nguyen Ten Manh Truong Th Hong Thanh Department of Mathematcs, Hano Natonal Unversty of Educaton
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationProjective change between two Special (α, β)- Finsler Metrics
Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationn-strongly Ding Projective, Injective and Flat Modules
Internatonal Mathematcal Forum, Vol. 7, 2012, no. 42, 2093-2098 n-strongly Dng Projectve, Injectve and Flat Modules Janmn Xng College o Mathematc and Physcs Qngdao Unversty o Scence and Technology Qngdao
More informationInfinitely Split Nash Equilibrium Problems in Repeated Games
Infntely Splt ash Equlbrum Problems n Repeated Games Jnlu L Department of Mathematcs Shawnee State Unversty Portsmouth, Oho 4566 USA Abstract In ths paper, we ntroduce the concept of nfntely splt ash equlbrum
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More information2 MADALINA ROXANA BUNECI subset G (2) G G (called the set of composable pars), and two maps: h (x y)! xy : G (2)! G (product map) x! x ;1 [: G! G] (nv
An applcaton of Mackey's selecton lemma Madalna Roxana Bunec Abstract. Let G be a locally compact second countable groupod. Let F be a subset of G (0) meetng each orbt exactly once. Let us denote by df
More informationDIFFERENTIAL SCHEMES
DIFFERENTIAL SCHEMES RAYMOND T. HOOBLER Dedcated to the memory o Jerry Kovacc 1. schemes All rngs contan Q and are commutatve. We x a d erental rng A throughout ths secton. 1.1. The topologcal space. Let
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationDONALD M. DAVIS. 1. Main result
v 1 -PERIODIC 2-EXPONENTS OF SU(2 e ) AND SU(2 e + 1) DONALD M. DAVIS Abstract. We determne precsely the largest v 1 -perodc homotopy groups of SU(2 e ) and SU(2 e +1). Ths gves new results about the largest
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationOn the average number of divisors of the sum of digits of squares
Notes on Number heory and Dscrete Mathematcs Prnt ISSN 30 532, Onlne ISSN 2367 8275 Vol. 24, 208, No. 2, 40 46 DOI: 0.7546/nntdm.208.24.2.40-46 On the average number of dvsors of the sum of dgts of squares
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationاولت ارص من نوع -c. الخلاصة رنا بهجت اسماعیل مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009
مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009 الت ارص من نوع -C- - جامعة بغداد رنا بهجت اسماعیل قسم الریاضیات - كلیة التربیة- ابن الهیثم الخلاصة قمنا في هذا البحث بتعریف نوع جدید من الت ارص
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationAli Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen
Journal of athematcs and Statstcs 7 (): 4448, 0 ISSN 5493644 00 Scence Publcatons odules n σ[] wth Chan Condtons on Small Submodules Al Omer Alattass Department of athematcs, Faculty of Scence, Hadramout
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationVoting Games with Positive Weights and. Dummy Players: Facts and Theory
Appled Mathematcal Scences, Vol 10, 2016, no 53, 2637-2646 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/ams201667209 Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationENUMERATING LEFT DISTRIBUTIVE GROUPOIDS. Jaroslav Ježek
ENUMERATING LEFT DISTRIBUTIVE GROUPOIDS Jaroslav Ježek Abstract. Groupods satsfyng the equaton x(yz) = (xy)(xz) are called left dstrbutve, or LD-groupods. We gve an algorthm for ther enumeraton and prove
More informationON THE JACOBIAN CONJECTURE
v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationSymmetry, Integrability and Geometry: Methods and Applications
Symmetry, Integrablty and Geometry: Methods and Applcatons Zero Acton on Perfect Crystals for U q G 1) 2 Kalash C. MISRA, Mahathr MOHAMAD and Masato OKADO Department of Mathematcs, North Carolna State
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationY. Guo. A. Liu, T. Liu, Q. Ma UDC
UDC 517. 9 OSCILLATION OF A CLASS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS WITH CONTINUOUS VARIABLES* ОСЦИЛЯЦIЯ КЛАСУ НЕЛIНIЙНИХ ЧАСТКОВО РIЗНИЦЕВИХ РIВНЯНЬ З НЕПЕРЕРВНИМИ ЗМIННИМИ Y. Guo Graduate School
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationOptimal Pursuit Time in Differential Game for an Infinite System of Differential Equations
Malaysan Journal of Mathematcal Scences 1(S) August: 267 277 (216) Specal Issue: The 7 th Internatonal Conference on Research and Educaton n Mathematcs (ICREM7) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationLecture 7: Gluing prevarieties; products
Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More information