The Landau problem for nonvanishing functions with real coecients
|
|
- Delilah Thompson
- 5 years ago
- Views:
Transcription
1 Journal of Computational Applied Mathematics 139 (2002) The Lau problem for nonvanishing functions with real coecients Philippos Koulorizos, Nikolas Samaris Department of Mathematics, University of Patras, University Campus, GR Patras, Greece Received 25 November 2000 Abstract For the class of holomorphic functions f(z) =f 0 + f 1z + f 2z 2 + in the unit disk z 1 with 0 f(z) 1 f n R, n =0; 1; 2;::: we prove that max(f 0 + f f 4) = max f 0 + f f 4 =1:46109 ::: min(f 0 + f f 4)= 0: :::. c 2002 Elsevier Science B.V. All rights reserved. MSC: 30C50 Keywords: Real coecient nonvanishing function; The Lau problem Let H(D) be the class of holomorphic functions in the unit disk D = {z: z 1}. We consider the following classes of functions: B = {f H(D): f(z)=f 0 + f 1 z + f 2 z 2 + ; f(z) 1; z D}; B 0 = {f B: f(z) 0}; W = {f B: f(0)=0}; P = {p H(D): p(z)=1+p 1 z + p 2 z 2 + ; Rp(z) 0; z D}; P R = {p P: p n R; n=1; 2;:::}: Corresponding author. address: samaris@math.upatras.gr (N. Samaris) /02/$ - see front matter c 2002 Elsevier Science B.V. All rights reserved. PII: S (01)
2 130 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) With no loss of generality we may assume that for f B 0 we have the form f =e tp with t 0 p P. In [1] Lau proved that sup n =1+ f B n ( ) 1 3 ::: (2k 1) 2 :=G n ; n N; 2 4 ::: 2k k=1 with this result being sharp while G n (1=) log n, n. In [2] Lewowski Szynal consider the Lau problem for the class B 0 they prove that max f B 0 f 0 + f 1 6 2e 1=2 1:21 ::: max f B 0 f 0 + f 1 + f 2 1:33 :::; while in both cases the extremal functions are of the form f =e tp, with t 0 p P R. They also conjecture that for any f B 0 there exists a constant L 1 n N such that max f B0 f 0 + f 1 + f f n 6 L. In [3] Ganczar et al., consider the Lau problem for the class B 0 (R) which consists of the functions f B 0 with real Taylor coecients they prove that S3 =1:40315 ::: where S n = max f 0 + f f n ; (n =2; 3;:::): f B 0(R) In this paper, we calculate S 4, S 4 s 4 where S n = max (f 0 + f f n ); f B 0(R) s n = min (f 0 + f f n ); (n =2; 3;:::): f B 0(R) In the present paper, we face a problem involving the estimation of quantities which depend on the Taylor coecients of functions belonging to the class P R. Our rst idea is to use the Caratheodory Toeplitz conditions as they are the strongest relations between the Taylor coecients of the class P R. A second idea is to express these relations in such a way that each Taylor coecient can be converted separately to a polynomial of several variables. Combining these two ideas, we transform the initial problem into nding the max (or min) of a polynomial of several variables, dened in a closed interval [0; 1] k, k 6 4. A serious problem in this paper is the size of the polynomials which are involved in the elementary calculations. Using the computer algebra system Mathematica 4:0, we obtained all necessary results. We will need the following Lemmas. Lemma 1. Let K n (P R ) be the set of x=(x 1 ;x 2 ;:::;x n ) R n for which there exists a q(z)=1+q 1 z+ q 2 z 2 + P R having q 1 = x 1 ;q 2 = x 2 ;:::;q n = x n. Let also A n be the set of x =(x 1 ;x 2 ;:::;x n ) R n
3 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) such that D k (x 1 ;x 2 ;:::;x k ) 0; k=1; 2;:::;n where: 2 x 1 x 2 ::: x k x 1 2 x 1 ::: x k 1 D k (x 1 ;x 2 ;:::;x k )= x 2 x 1 2 ::: x k 2 : x k x k 1 x k 2 ::: 2 If A n is the closure of A n then A n = K n (P R ). The above Lemma is a part of the Caratheodory Toeplitz Theorem (see [4,5]). Lemma 2. If x =(x 1 ;x 2 ;:::;x n ) R n (n 6 4) the following propositions are equivalent. (i) x K n (P R ) (ii) there exists a (t 1 ;t 2 ;:::;t n ) [0; 1] n such that: x 1 =p 1 (t 1 );x 2 =p 2 (t 1 ;t 2 );:::; x n =p n (t 1 ;t 2 ;:::;t n ) where p 1 (t 1 )= 2+4t 1 ; p 2 (t 1 ;t 2 )=2+16t 1 ( 1+t 1 + t 2 t 1 t 2 ); p 3 (t 1 ;t 2 ;t 3 )= 2+4t 1 ( 3+4t 1 ) 2 32t 1 t 2 (1 5t 1 +4t 2 1) 64t 2 1t 2 2(1 + t 1 ) + 64( 1+t 1 )t 1 (1 t 2 )t 2 t 3 ; p 4 (t 1 ;t 2 ;t 3 ;t 4 )=2(1+32t 1 ( 1+5t 1 ) + 128t 3 1( 2+t 1 )+32t 1 t 2 (1 9t 1 +20t t 3 1) + 128t 2 1t 2 2(1 4t 1 +3t 2 1) + 128t 3 1t 3 2(1 t 1 ) + 128t 1 t 2 t 3 (1 3t 1 +2t 2 1 t 2 ) + 128t 2 1t 2 2t 3 (5 4t 1 2t 2 + t 3 +2t 1 t 2 t 2 t 3 ) + 128t 1 t 2 2t 2 3( 1+t 2 ) + 128t 1 t 2 t 3 t 4 ( 1+t 1 )( 1+t 2 )( 1+t 3 )): Proof. The quantity D k (x 1 ;x 2 ;:::;x k ) can be written as polynomial of second degree in x k form: of the D k 2 (x 1 ;x 2 ;:::;x k 2 )x 2 k + ; (D k = 1 for k 6 0): If k k (x 1 ;x 2 ;:::;x k 1 ) k k (x 1;x 2 ;:::;x k 1 ) are the roots of the above polynomial it is easy to see that the relation x A n is equivalent to min( k ; k ) x k max( k ; k )or x k = k + t k ( k k ); t k (0; 1); k =1; 2;:::;n: (1) For k = 1 we get 1 = 2 1 = 2. Therefore x 1 = p 1 (t 1 ); t 1 (0; 1): (2)
4 132 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) For k = 2 by the equation D 2 (x 1 ;x 2 ) = 0 we obtain 2 = 2+x1 2 2 = 2. Thus combining (1) with (2) we get x 2 = p 2 (t 1 ;t 2 ); (t 1 ;t 2 ) (0; 1) 2 : (3) For k = 3 through equation D 3 (x 1 ;x 2 ;x 3 ) = 0 we obtain 3 = 4 2x 1 (x 1 x 2 ) 2 3 = 4+2x 1 (x 1 + x 2 ) 2 : 2+x 1 2+x 1 Consequently, combining (1) with (2) (3) we obtain after the calculations x 3 = p 3 (t 1 ;t 2 ;t 3 ); (t 1 ;t 2 ;t 3 ) (0; 1) 3 : (4) In the same manner we can see that x 4 = p 4 (t 1 ;t 2 ;t 3 ;t 4 ). Summarizing, we have that the transform (t 1 ;t 2 ;:::;t n ) (p 1 (t 1 );p 2 (t 1 ;t 2 );:::;p n (t 1 ;t 2 ;:::;t n )) is one-to-one from (0; 1) n onto A n. After the above observation the rest of the proof is straightforward. Lemma 3. It holds that S 4 = max{l 4 (t; t 1 ;:::;t 4 ): (t; t 1 ;:::;t 4 ) (0; + ) [0; 1] 4 }; S 4 = max{ L 4 (t; t 1 ;:::;t 4 ) : (t; t 1 ;:::;t 4 ) (0; + ) [0; 1] 4 } s 4 = min{l 4 (t; t 1 ;:::;t 4 ): (t; t 1 ;:::;t 4 ) (0; + ) [0; 1] 4 } where L 4 (t; t 1 ;t 2 ;t 3 ;t 4 )=e t [1 (p 1 (t 1 )+p 2 (t 1 ;t 2 )+p 3 (t 1 ;t 2 ;t 3 )+p 4 (t 1 ;t 2 ;t 3 ;t 4 ))t +( 1 2 (p2 1(t 1 )+p 2 2(t 1 ;t 2 )) + p 1 (t 1 )(p 2 (t 1 ;t 2 )+p 3 (t 1 ;t 2 ;t 3 )))t ( 1 3 p3 1(t 1 )+p 2 1(t 1 )p 2 (t 1 ;t 2 ))t p4 1(t 1 )t 4 ]: Proof. Without loss of generality we suppose that f B 0 (R) if can be written in the form f =e tp with t 0 p P R. Therefore from Lemma 2 it follows that f(z)=e t[1+p1(t1)z+p2(t1;t2)z2 + +p n(t 1;t 2;:::;t n)z n + ] : (5) By Taylor expansion of the previous form of f after elementary calculations we obtain f 0 + f f 3 = L 3 f 0 + f f 4 = L 4. For the next Theorem we will need the following polynomials: 0 (t)= t t t t t t t t t t t 11 ; (6)
5 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) (t) = t t t t t t t t t 9 ; (7) 1(t)=4t( t t t t t t t t 8 ); (8) 2 (t; t 1 )= 11 4t 2 (1 2t 1 ) 2 16t 1 ( 7+8t 1 )+4t(5 30t 1 +32t1); 2 (9) 2(t; t 1 ) = 64( 2+t)( 1+t 1 )t 1 ; (10) 3 (t; t 1 ;t 2 )=1+2t +4t 1 (2 t 2t 2 ); (11) 3(t; t 1 ;t 2 ) = 8(1 t 2 ); (12) 0(t)=3( 17+4t) 2 ( t t t t t 5 ); 1(t)= t t t t 4 ; (14) 1(t)=4t( t 2000t t 3 ); (15) 2(t; t 1 )= 3+4t(1 t) 8tt 1 (7 2t 8t 1 +2tt 1 ); (16) (13) 2(t; t 1 )=64t( 1+t 1 )t 1 ; (17) 3(t; t 1 ;t 2 )=3 2t +4t 1 ( 2+t +2t 2 ) (18) 3(t; t 1 ;t 2 )=8t 2 : Considering the Lau problem for B 0 (R) we nd the following partial results: (19) Theorem 1. For S 4 ;S4 s 4 it holds that: (i) S 4 =1:46109 ::: is the value of the function L 4 (t; t 1 ;t 2 ;t 3 ; 1) for t = t 0 0: :::; while t 0 is the root of the equation 0 (t)=0; t 0 t 1 = 1(t) 1(t) ; t 2 = 2(t; t 1 ) 2(t; t 1 ) (ii) S4 = S 4 t 3 = 3(t; t 1 ;t 2 ) 3(t; t 1 ;t 2 ) ; (iii) s 4 = 0: ::: is the value of the function L 4 (t; t 1 ;t 2 ;t 3 ; 0) for t = t0 1:11167 :::; while is the root of the equation 0 (t)=0; t 1 = 1 (t) 1 (t); t 2 = 2 (t; t 1 ) 2 (t; t 1) t 3 = 3 (t; t 1;t 2 ) 3 (t; t 1;t 2 ) :
6 134 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) Proof. At rst, we remark that: 1. If we set in any function L k (k =1;:::;4), t i =0 or t i =1 (i =1; 2; 3; 4), the value of the function does not depend on the variables t j when j i. 2. The polynomial L 4 is of rst degree in t 4 with corresponding coecient 256e t t( 1 + t 1 )t 1 ( 1+t 2 )t 2 ( 1+t 3 )t 3 which is non-negative. Therefore in order to nd S 4 we set t 4 = 1 for s 4 we set t 4 =0. 3. In order to calculate value S 4 we consider all the restrictions of the function L 4 for t 4 =1, t i =1 t i =0, i =1; 2; 3. We then nd all critical points in the interior of the denition domains of each restriction their corresponding values. The larger of these values coincides with S 4. In a similar way we are working for s Let =( 0 ; 1 ;:::; n ) C n, b =(b 0 ;b 1 ;:::;b k ) C k, P (x)= x + :::; n x n P b (x)= b 0 + b 1 x + + b k x k. The equations P (x) =0 P b (x) = 0 yield two relations of the form A(; b)x + B(; b) =0 C(; b) = 0 where A(; b), B(; b) C(; b) are polynomials in each element of, b, with the following procedure. The rst polynomial P (x) is divided with the second P b (x), proceeding with the division of P b (x) with the remainder of the initial polynomial division. The nal elimination of x is achieved by recursions of the procedure described, which will be used several times through this paper. For t 4 =1: 4 =@t 3 = 0 gives h 1 (t; t 1 ;t 2 )( 1 2t 8t 1 +4tt 1 +8t 1 t 2 +8t 3 8t 2 t 3 )=0; (20) where h 1 (t; t 1 ;t 2 )= e t 64t( 1+t 1 )t 1 ( 1+t 2 )t 2. Since h 1 (t; t 1 ;t 2 ) 0, then t 3 3(t; t 1 ;t 2 ) 3 (t; t 1 ;t 2 )=0: (21) Eliminating t 3 between 4 =@t 2 = 0 we get h 2 (t; t 1 )(11 20t +4t 2 112t tt 1 16t 2 t t tt t 2 t t 1 t 2 64tt 1 t 2 128t1t tt1t 2 2 ) = 0 (22) where h 2 (t; t 1 )=e t 4t( 1+t 1 )t 1. Since h 2 (t; t 1 ) 0, then t 2 2(t; t 1 ) 2 (t; t 1 )=0: (23) Eliminating t 2 4 =@t 1 4 =@t = 0 (23) we have, respectively, h 3 (t; t 1 ) ( 2+t) =0; (24) 2 where h 3 (t; t 1 )=( t 5331t t 3 888t 4 +16t 6 16t 1 ( t 1431t t 3 74t 4 52t 5 +8t 6 )+96t 2 1( t +20t t 3 44t 4 +4t 5 ) 256t 2 t 3 1 ( t +93t 2 27t 3 +2t 4 ) 256t 3 t 4 1(64+50t 14t 2 + t 3 )) h 4 (t; t 1 ) ( 2+t) =0; (25)
7 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) where h 4 (t; t 1 )=t( t + 174t 2 +4t 3 8t 4 12tt 1 ( 32+37t +16t 2 )+t 2 t 2 1( 2 15t +2t 2 ) +8t 3 t 3 1( 64+8t)): Applying the procedure described in Remark 4 to (24) (25) with respect to t 1 we get h 5 (t; t 1 ) ( 8+t) 2 ( 2+t) =0; 2 where (26) h 5 (t; t 1 )= t 17268t t t t 5 364t 6 +16t 7 8tt 1 ( t t t t 4 186t 5 +8t 6 ) +16t 2 t 2 1( t 3560t t 3 95t 4 +4t 5 )) ( 8+t) 2 ( 2+t)[t 1 1(t) 1 (t)]=0: (27) Therefore for t 2 t 8 by (26) (27) we obtain 3( t 3560t t 3 95t 4 +4t 5 ) 2 0 (t)=0: (28) Solving Eq. (28) with Mathematica 4:0 we succeed in nding all its roots which are: 1 = 2 = 1:54984 :::; 3 = 4 =2:63304 :::; 5 = 6 =8:31271 :::; 7 = 8 =5:6272 ::: i 1:36096 :::; 9 = 10 = 5:6272 :::+ i 1:36096 :::; 11 =0: :::; 12 =1:20285 :::; 13 =1:67847 :::; 14 =1:81244 :::; 15 =2:3582 :::; 16 =2:98161 :::; 17 =4:12162 :::; 18 =4:46949 ::: i 0: :::; 19 =4:46949 ::: + i 0: :::; 20 =6:33369 ::: i 1:39775 :::; 21 =6:33369 :::+ i 1:39775 :::. For t =2: the equation h 5 (2;t 1 ) = 0 has the roots r 1 =(4 3)=8 r 2 =(4+ 3)=8. Solving the system of equations h 5 (2;t 1 4 =@t 1 = 0 (21) with respect to t 1, t 2 t 3 we obtain as solutions the points ( (t 1 ;t 2 ;t 3 )= ; ) 3 ; 4( 3+ 3)( ) (0: :::;0: :::;0: :::) ( (t 1 ;t 2 ;t 3 )= 4+ 3 ; ; (3 + 3)( ) ) (0: :::;0: :::;0: :::):
8 136 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) For t =8: in the same manner we obtain the point ( (t 1 ;t 2 ;t 3 )= ; 32 3( )( ) ; ( 42 + ) 615)( ) 4( ) (0: :::;0: :::;0: :::): Using the roots of Eq. (28) the solutions of the systems formed in the cases t = 2 t =8, after the calculations we nd that all the critical points of function L 4 (t; t 1 ;t 2 ;t 3 ; 1) for (t; t 1 ;t 2 ;t 3 ) (0; ) (0; 1) 3, belong to the set A 1 = {(1:54984 :::;0: :::;0: :::;0: :::); (0: :::;0: :::; 0: :::;0: :::); (1:20285 :::;0: :::;0: :::;0: :::); (1:67847 :::;0: :::;0: :::;0: :::); (1:81244 :::;0: :::; 0: :::;0: :::); (2:3582 :::;0: :::;0: :::;0: :::); (2:98161 :::;0: :::;0: :::;0: :::); (4:12162 :::;0: :::; 0: :::;0: :::); (8:31271 :::;0: :::;0: :::;0: :::); (2: :::;0: :::;0: :::;0: :::); (2: :::;0: :::; 0: :::;0: :::); (8: :::;0: :::;0: :::;0: :::)}; max{l 4 (t; t 1 ;t 2 ;t 3 ; 1):(t; t 1 ;t 2 ;t 3 ) A 1 } =1: ::: min{l 4 (t; t 1 ;t 2 ;t 3 ; 1):(t; t 1 ;t 2 ;t 3 ) A 1 } = 0: :::. For t 4 =0: proceeding exactly as in previous case, we derive the set A 2 = {(1:11167 :::;0: :::;0: :::;0: :::); (2:36682 :::;0: :::; 0: :::;0: :::); (2:76576 :::;0:80512 :::;0: :::;0: :::)}; max{l 4 (t; t 1 ;t 2 ;t 3 ; 0): (t; t 1 ;t 2 ;t 3 ) A 2 } = 0:3034 ::: min{l 4 (t; t 1 ;t 2 ;t 3 ; 0):(t; t 1 ;t 2 ;t 3 ) A 2 } = 0: :::. real values for t 1, t 2 t 3. For t 3 =1: we consider the =0: Applying to (29) the procedure of eliminating t 2 t 1, we examine separately as we did previously, some cases of the form q i (t)=0, i =1; 2; 3;:::. Thus we obtain three polynomial equations of the form t 2 2 (t; t 1 ) 2 (t; t 1 )=0; (30) t 1 1 (t) 1 (t) = 0 (31)
9 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) (t)=0: (32) We omit giving explicitly the polynomials q i (t), 1 (t), 2 (t; t 1), 1 (t), 2 (t; t 1), 0 (t) because of their size. Especially the last polynomial 0 (t) can be converted to a product of factors of the form 9( 1+2t) 2 1(t) 2 2(t) 3 (t) 2 4(t); (33) where 1 (t) is of sixth degree, 2 (t) of twelfth degree, 3 (t) of fteenth degree 4 (t) of thirtieth degree with respect to t, respectively. Continuing we nd all one hundred twelve roots of Eq. (32). Using the roots of Eq. (32) the points that satisfy the relations q i (t)=0i =1; 2; 3;:::, after the calculations we nd that all the critical points of function L 4 (t; t 1 ;t 2 ; 1; 1) for (t; t 1 ;t 2 ) (0; ) (0; 1) 2, belong to the set A 3 = {(0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (3: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (2: :::;0: :::;0: :::); (2: :::;0: :::;0: :::); (3:94974 :::;0: :::;0: :::); (1:07394 :::;0: :::;0: :::); (1:07394 :::;0: :::;0: :::); (6:28933 :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (2:55783 :::;0: :::;0: :::); (10:243 :::;0: :::;0: :::); (47:9003 :::;0: :::;0: :::); (47:9003 :::;0: :::;0: :::); (0:3984 :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (1:14692 :::;0: :::;0: :::); (1:49999 :::;0: :::;0: :::); (2:40766 :::;0: :::;0: :::); (2:69004 :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::)}; max{l 4 (t; t 1 ;t 2 ; 1; 1):(t; t 1 ;t 2 ) A 3 } =1: ::: min{l 4 (t; t 1 ;t 2 ; 1; 1): (t; t 1 ;t 2 ) A 3 } = :25246 :::.
10 138 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) For t 3 =0: proceeding exactly as in previous case we derive A 4 = {(0: :::;0: :::;0: :::); (2: :::;0: :::;0: :::); (4: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (4: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (1: :::;0: :::;0: :::); (3: :::;0: :::;0: :::); (3:71729 :::;0: :::;0: :::); (0: :::;0: :::;0: :::); (0: :::;0: :::;0:38198 :::); (8:10891 :::;0: :::;0: :::); (1:67665 :::;0: :::;0: :::); (11:7856 :::;0: :::;0: :::); (49:2188 :::;0: :::;0: :::); (49:2188 :::;0: :::;0: :::); (1:52606 :::;0: :::;0: :::); (1:58586 :::;0: :::;0: :::); (4:27136 :::;0: :::;0: :::)}; max{l 4 (t; t 1 ;t 2 ; 0; 1): (t; t 1 ;t 2 ) A 4 } = 0: ::: min{l 4 (t; t 1 ;t 2 ; 0; 1): (t; t 1 ;t 2 ) A 4 } = 0: :::. For t 2 =1: by the same procedure, through simpler calculations than before we have A 5 = {(0: :::;0: :::); (1:3839 :::;0: :::); (1:66779 :::;0: :::); (2:89925 :::;0: :::); (3:13721 :::;0: :::); (3:81812 :::;0: :::); (3: :::;0: :::)}; max{l 4 (t; t 1 ; 1; 1; 1): (t; t 1 ) A 5 } = 0: ::: min{l 4 (t; t 1 ; 1; 1; 1): (t; t 1 ) A 5 } = 0: :::. For t 2 =0: in the same manner we get A 6 = {(0: :::;0: :::); (0: :::;0:40951 :::); (0: :::;0: :::); (0: :::;0:016 :::); (0: :::;0: :::); (0: :::;0: :::); (1:23589 :::;0: :::); (2:04847 :::;0: :::); (3:65511 :::;0: :::); (5:16722 :::;0: :::); (0: :::;0: :::); (0: :::;0:49065 :::); (1:14202 :::;0: :::); (3:61717 :::;0: :::); (8:07298 :::;0:54914 :::); (0: :::;0: :::); (0: :::;0: :::); (3:30541 :::;0:18893 :::); (7:75877 :::;0: :::)};
11 P. Koulorizos, N. Samaris / Journal of Computational Applied Mathematics 139 (2002) max{l 4 (t; t 1 ; 0; 1; 1): (t; t 1 ) A 6 } = 1:34838 ::: min{l 4 (t; t 1 ; 0; 1; 1): (t; t 1 ) A 6 } = 0: :::. For t 1 =1: the 4 =@t = 0 yields 1 3 e t (27 96t +84t 2 24t 3 +2t 4 )=0; (34) therefore A 7 = {0: :::;1:44592 :::;3:29095 :::;6:8489 :::}, max{l 4 (t; 1; 1; 1; 1): t A 7 } =0: ::: min{l 4 (t; 1; 1; 1; 1): t A 7 } = 0: :::. For t 1 =0: similarly we get 1 3 e t (3 24t +36t 2 16t 3 +2t 4 )=0; (35) with A 8 = {0: :::;0: :::;2:26831 :::;4:69754 :::}, max{l 4 (t; 0; 1; 1; 1): t A 8 } = 1: ::: min{l 4 (t; 0; 1; 1; 1): t A 8 } =0: :::. Comparing the occurring values for the maximum the minimum of L 4 of the relative sets A i (i =1;:::;8), we obtain the result needed. Remark. If we had considered initially the class B 4 = {f B 0: f i R, i =1;:::;4} instead of the class B 0 (R), all our evaluations wouldn t have been modied. References [1] E. Lau, Abschatzung der koezientensummme einer potenzreihe, Arch. Math. Phys. 21 (1913) [2] Z. Lewowski, J. Szynal, The Lau problem for bounded nonvanishing functions, J. Comput. Appl. Math. 105 (1999) [3] A. Ganczar, M. Michalska, J. Szynal, On the Lau problem for bounded nonvanishing functions, Ann. Univ. Mariae Curie Sklodowska Sect. A 52 (2) (1998) [4] C. Caratheodory, Uber den variabilitatsbereich der koezienten von potenzreihen die gegebene Werte nicht annehmen, Math. Ann. 64 (1907) [5] O. Toeplitz, Uber die Fourier sche entwickelung positiver funktionen, Rend. Circ. Mat. Palermo 32 (1911)
Definition A.1. We say a set of functions A C(X) separates points if for every x, y X, there is a function f A so f(x) f(y).
The Stone-Weierstrass theorem Throughout this section, X denotes a compact Hausdorff space, for example a compact metric space. In what follows, we take C(X) to denote the algebra of real-valued continuous
More informationPade approximants and noise: rational functions
Journal of Computational and Applied Mathematics 105 (1999) 285 297 Pade approximants and noise: rational functions Jacek Gilewicz a; a; b;1, Maciej Pindor a Centre de Physique Theorique, Unite Propre
More informationOn some properties of elementary derivations in dimension six
Journal of Pure and Applied Algebra 56 (200) 69 79 www.elsevier.com/locate/jpaa On some properties of elementary derivations in dimension six Joseph Khoury Department of Mathematics, University of Ottawa,
More informationTHE DEGREE OF THE INVERSE OF A POLYNOMIAL AUTOMORPHISM
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLIV 2006 THE DEGREE OF THE INVERSE OF A POLYNOMIAL AUTOMORPHISM by Sabrina Brusadin and Gianluca Gorni Abstract. Let F : C n C n be an invertible
More informationarxiv: v1 [math.cv] 24 Apr 2013
GROWTH ESTIMATES FOR PSEUDO-DISSIPATIVE HOLOMORPHIC MAPS IN BANACH SPACES arxiv:1304.6605v1 [math.cv] 24 Apr 2013 FILIPPO BRACCI, MARK ELIN, AND DAVID SHOIKHET Dedicated to Prof. Simeon Reich for his 65th
More informationThe Krzyż conjecture: an extremal problem for non-vanishing bounded analytic functions
The Krzyż conjecture: an extremal problem for non-vanishing bounded analytic functions Dragan Vukotić Universidad Autónoma de Madrid Joint work with María J. Martín, Eric T. Sawyer, and Ignacio Uriarte-Tuero
More informationOn Gol dberg s constant A 2
On Gol dberg s constant A 2 Prashant Batra 4th June 2006 Abstract Gol dberg considered the class of functions analytic in the unit disc with unequal positive numbers of zeros and ones there. The maximum
More information1. Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials.
Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials A rational function / is a quotient of two polynomials P, Q with 0 By Fundamental Theorem of algebra, =
More informationThe Independence of Peano's Fourth Axiom from. Martin-Lof's Type Theory without Universes. Jan M. Smith. Department of Computer Science
The Independence of Peano's Fourth Axiom from Martin-Lof's Type Theory without Universes Jan M. Smith Department of Computer Science University of Goteborg/Chalmers S-412 96 Goteborg Sweden March 1987
More informationOnthe reconstructionof perfect codes
Discrete Mathematics 256 (2002) 479 485 www.elsevier.com/locate/disc Note Onthe reconstructionof perfect codes Olof Heden Department of Mathematics, KTH, S-00 44, Stockholm, Sweden Received 3 April 200;
More informationCoefficient Inequalities for Classes of Uniformly. Starlike and Convex Functions Defined by Generalized. Ruscheweyh Operator
International Mathematical Forum, Vol. 6, 2011, no. 65, 3227-3234 Coefficient Inequalities for Classes of Uniformly Starlike Convex Functions Defined by Generalized Ruscheweyh Operator Hesam Mahzoon Department
More informationSchwarz lemma involving the boundary fixed point
Xu et al. Fixed Point Theory and Applications (016) 016:84 DOI 10.1186/s13663-016-0574-8 R E S E A R C H Open Access Schwarz lemma involving the boundary fixed point Qinghua Xu 1*,YongfaTang 1,TingYang
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More information1 Holomorphic functions
Robert Oeckl CA NOTES 1 15/09/2009 1 1 Holomorphic functions 11 The complex derivative The basic objects of complex analysis are the holomorphic functions These are functions that posses a complex derivative
More informationComputation of the simplest normal forms with perturbation parameters based on Lie transform and rescaling
Journal of Computational and Applied Mathematics 144 (2002) 359 373 wwwelseviercom/locate/cam Computation of the simplest normal forms with perturbation parameters based on Lie transform and rescaling
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
More informationDivisor matrices and magic sequences
Discrete Mathematics 250 (2002) 125 135 www.elsevier.com/locate/disc Divisor matrices and magic sequences R.H. Jeurissen Mathematical Institute, University of Nijmegen, Toernooiveld, 6525 ED Nijmegen,
More informationCounterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co
Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is
More informationA natural boundary for the dynamical zeta function for commuting group automorphisms
A natural boundary for the dynamical zeta function for commuting group automorphisms MILES, Richard Available from Sheffield Hallam University Research Archive (SHURA)
More informationOld and new order of linear invariant family of harmonic mappings and the bound for Jacobian
doi: 10.478/v1006-011-004-3 A N N A L E S U N I V E R S I T A T I S M A R I A E C U R I E - S K Ł O D O W S K A L U B L I N P O L O N I A VOL. LXV, NO., 011 SECTIO A 191 0 MAGDALENA SOBCZAK-KNEĆ, VIKTOR
More informationRealization of set functions as cut functions of graphs and hypergraphs
Discrete Mathematics 226 (2001) 199 210 www.elsevier.com/locate/disc Realization of set functions as cut functions of graphs and hypergraphs Satoru Fujishige a;, Sachin B. Patkar b a Division of Systems
More informationExhaustive search methods for CNS. polynomials
Exhaustive search methods for CNS polynomials Péter Burcsi and Attila Kovács Department of Computer Algebra, Eötvös Loránd University, H-1117 Budapest, Hungary {peter.burcsi, attila.kovacs}@compalg.inf.elte.hu
More informationON A SINE POLYNOMIAL OF TURÁN
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 48, Number 1, 18 ON A SINE POLYNOMIAL OF TURÁN HORST ALZER AND MAN KAM KWONG ABSTRACT. In 1935, Turán proved that ( n + a j ) S n,a() = sin(j) >, n j n, a N,
More informationComparing the homotopy types of the components of Map(S 4 ;BSU(2))
Journal of Pure and Applied Algebra 161 (2001) 235 243 www.elsevier.com/locate/jpaa Comparing the homotopy types of the components of Map(S 4 ;BSU(2)) Shuichi Tsukuda 1 Department of Mathematical Sciences,
More informationRidge analysis of mixture response surfaces
Statistics & Probability Letters 48 (2000) 3 40 Ridge analysis of mixture response surfaces Norman R. Draper a;, Friedrich Pukelsheim b a Department of Statistics, University of Wisconsin, 20 West Dayton
More informationNote An example of a computable absolutely normal number
Theoretical Computer Science 270 (2002) 947 958 www.elsevier.com/locate/tcs Note An example of a computable absolutely normal number Veronica Becher ; 1, Santiago Figueira Departamento de Computation,
More informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationImplicational classes ofde Morgan Boolean algebras
Discrete Mathematics 232 (2001) 59 66 www.elsevier.com/locate/disc Implicational classes ofde Morgan Boolean algebras Alexej P. Pynko Department of Digital Automata Theory, V.M. Glushkov Institute of Cybernetics,
More informationOn the convergence of interpolatory-type quadrature rules for evaluating Cauchy integrals
Journal of Computational and Applied Mathematics 49 () 38 395 www.elsevier.com/locate/cam On the convergence of interpolatory-type quadrature rules for evaluating Cauchy integrals Philsu Kim a;, Beong
More informationAbsolutely indecomposable symmetric matrices
Journal of Pure and Applied Algebra 174 (2002) 83 93 wwwelseviercom/locate/jpaa Absolutely indecomposable symmetric matrices Hans A Keller a; ;1, A Herminia Ochsenius b;1 a Hochschule Technik+Architektur
More informationC -algebras generated by mappings with an inverse semigroup of monomials
C -algebras generated by mappings with an inverse semigroup of monomials A. Kuznetsova Kazan Federal University 09.09.2016 C -algebra generated by mapping The starting point is a selfmapping ϕ : X X on
More informationA New View of Presentation Theory for C*-algebras
A New View of Presentation Theory for C*-algebras William Benjamin Grilliette University of Nebraska - Lincoln South Eastern Analysis Meeting XXVII Scaled-Free Objects Crutched Sets Proposition (Failure
More informationUniformly convex functions II
ANNALES POLONICI MATHEMATICI LVIII. (199 Uniformly convex functions II by Wancang Ma and David Minda (Cincinnati, Ohio Abstract. Recently, A. W. Goodman introduced the class UCV of normalized uniformly
More informationBOUNDEDNESS, UNIVALENCE AND QUASICONFORMAL EXTENSION OF ROBERTSON FUNCTIONS. Ikkei Hotta and Li-Mei Wang
Indian J. Pure Appl. Math., 42(4): 239-248, August 2011 c Indian National Science Academy BOUNDEDNESS, UNIVALENCE AND QUASICONFORMAL EXTENSION OF ROBERTSON FUNCTIONS Ikkei Hotta and Li-Mei Wang Department
More informationHOLOMORPHIC MAPPINGS INTO SOME DOMAIN IN A COMPLEX NORMED SPACE. Tatsuhiro Honda. 1. Introduction
J. Korean Math. Soc. 41 (2004), No. 1, pp. 145 156 HOLOMORPHIC MAPPINGS INTO SOME DOMAIN IN A COMPLEX NORMED SPACE Tatsuhiro Honda Abstract. Let D 1, D 2 be convex domains in complex normed spaces E 1,
More informationON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS. C φ 2 e = lim sup w 1
ON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS PEKKA NIEMINEN AND EERO SAKSMAN Abstract. We give a negative answer to a conjecture of J. E. Shapiro concerning compactness of the dierence of
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationWEIGHTED SHARING AND UNIQUENESS OF CERTAIN TYPE OF DIFFERENTIAL-DIFFERENCE POLYNOMIALS
Palestine Journal of Mathematics Vol. 7(1)(2018), 121 130 Palestine Polytechnic University-PPU 2018 WEIGHTED SHARING AND UNIQUENESS OF CERTAIN TYPE OF DIFFERENTIAL-DIFFERENCE POLYNOMIALS Pulak Sahoo and
More informationUDC S. Yu. Graf ON THE SCHWARZIAN NORM OF HARMONIC MAPPINGS
0 Probl. Anal. Issues Anal. Vol. 5 3), No., 016, pp. 0 3 DOI: 10.15393/j3.art.016.3511 UDC 517.54 S. Yu. Graf ON THE SCHWARZIAN NORM OF HARMONIC MAPPINGS Abstract. We obtain estimations of the pre-schwarzian
More informationOn Robbins example of a continued fraction expansion for a quartic power series over F 13
Journal of Number Theory 28 (2008) 09 5 www.elsevier.com/locate/jnt On Robbins example of a continued fraction expansion for a quartic power series over F 3 Alain Lasjaunias C.N.R.S.-UMR 5465, Université
More informationAnn. Funct. Anal. 2 (2011), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann. Funct. Anal. (0), no., 33 A nnals of F unctional A nalysis ISSN: 008-875 (electronic) URL: www.emis.de/journals/afa/ SOME GEOMETRIC CONSTANTS OF ABSOLUTE NORMALIZED NORMS ON R HIROYASU MIZUGUCHI AND
More informationSecond Hankel Determinant Problem for a Certain Subclass of Univalent Functions
International Journal of Mathematical Analysis Vol. 9, 05, no. 0, 493-498 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.55 Second Hankel Determinant Problem for a Certain Subclass of Univalent
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationNewton s formula and continued fraction expansion of d
Newton s formula and continued fraction expansion of d ANDREJ DUJELLA Abstract It is known that if the period s(d) of the continued fraction expansion of d satisfies s(d), then all Newton s approximants
More informationThe restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics 149 (2002) 415 422 www.elsevier.com/locate/cam The restarted QR-algorithm for eigenvalue computation of structured matrices Daniela Calvetti a; 1, Sun-Mi
More informationFinite Fields and Their Applications
Finite Fields and Their Applications 18 (2012) 26 34 Contents lists available at ScienceDirect Finite Fields and Their Applications www.elsevier.com/locate/ffa On the continued fraction expansion of the
More informationarxiv: v1 [math.cv] 11 Aug 2017
CONSTRUCTION OF TOEPLITZ MATRICES WHOSE ELEMENTS ARE THE COEFFICIENTS OF UNIVALENT FUNCTIONS ASSOCIATED WITH -DERIVATIVE OPERATOR arxiv:1708.03600v1 [math.cv] 11 Aug 017 NANJUNDAN MAGESH 1, ŞAHSENE ALTINKAYA,,
More informationThe absolute value (modulus) of a number
The absolute value (modulus) of a number Given a real number x, its absolute value or modulus is dened as x if x is positive x = 0 if x = 0 x if x is negative For example, 6 = 6, 10 = ( 10) = 10. The absolute
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
More informationBanach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences
Advances in Dynamical Systems and Applications ISSN 0973-532, Volume 6, Number, pp. 9 09 20 http://campus.mst.edu/adsa Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable
More informationA scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations
Journal of Statistical Planning and Inference 18 (22) 85 97 www.elsevier.com/locate/jspi A scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations J. Fortiana,
More informationarxiv: v2 [math.cv] 24 Nov 2009
On strongly starlike and convex functions of orderαand typeβ IKKEI HOTTA Division of Mathematics, Graduate School of Information Sciences, Tohoku University, 6-3-09 Aramaki-Aza-Aoba, Aoba-ku, Sendai, Miyagi
More information13 Maximum Modulus Principle
3 Maximum Modulus Principle Theorem 3. (maximum modulus principle). If f is non-constant and analytic on an open connected set Ω, then there is no point z 0 Ω such that f(z) f(z 0 ) for all z Ω. Remark
More informationMITSCH S ORDER AND INCLUSION FOR BINARY RELATIONS
MITSCH S ORDER AND INCLUSION FOR BINARY RELATIONS D. G. FITZGERALD Abstract. Mitsch s natural partial order on the semigroup of binary relations has a complex relationship with the compatible partial order
More informationOn the role playedby the Fuck spectrum in the determination of critical groups in elliptic problems where the asymptotic limits may not exist
Nonlinear Analysis 49 (2002) 603 611 www.elsevier.com/locate/na On the role playedby the Fuck spectrum in the determination of critical groups in elliptic problems where the asymptotic limits may not exist
More informationThe average dimension of the hull of cyclic codes
Discrete Applied Mathematics 128 (2003) 275 292 www.elsevier.com/locate/dam The average dimension of the hull of cyclic codes Gintaras Skersys Matematikos ir Informatikos Fakultetas, Vilniaus Universitetas,
More informationEXTREMAL DOMAINS FOR SELF-COMMUTATORS IN THE BERGMAN SPACE
EXTREMAL DOMAINS FOR SELF-COMMUTATORS IN THE BERGMAN SPACE MATTHEW FLEEMAN AND DMITRY KHAVINSON Abstract. In [10], the authors have shown that Putnam's inequality for the norm of self-commutators can be
More informationOn the Second Hankel Determinant for the kth-root Transform of Analytic Functions
Filomat 3: 07 7 5 DOI 098/FIL707A Published by Faculty of Sciences and Mathematics University of Niš Serbia Available at: http://wwwpmfniacrs/filomat On the Second Hankel Determinant for the kth-root Transform
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationON SOME LENGTH PROBLEMS FOR ANALYTIC FUNCTIONS
Nunokawa, M. and Sokół, J. Osaka J. Math. 5 (4), 695 77 ON SOME LENGTH PROBLEMS FOR ANALYTIC FUNCTIONS MAMORU NUNOKAWA and JANUSZ SOKÓŁ (Received December 6, ) Let A be the class of functions Abstract
More informationNote On Parikh slender context-free languages
Theoretical Computer Science 255 (2001) 667 677 www.elsevier.com/locate/tcs Note On Parikh slender context-free languages a; b; ; 1 Juha Honkala a Department of Mathematics, University of Turku, FIN-20014
More informationCOMPOSITION SEMIGROUPS ON BMOA AND H AUSTIN ANDERSON, MIRJANA JOVOVIC, AND WAYNE SMITH
COMPOSITION SEMIGROUPS ON BMOA AND H AUSTIN ANDERSON, MIRJANA JOVOVIC, AND WAYNE SMITH Abstract. We study [ϕ t, X], the maximal space of strong continuity for a semigroup of composition operators induced
More informationOn a conjecture of S.P. Robinson
J. Math. Anal. Appl. 31 (005) 548 554 www.elsevier.com/locate/jmaa On a conjecture of S.P. Robinson Stephan Ruscheweyh a, Luis Salinas b, a Mathematisches Institut, Universität Würzburg, D-97074 Würzburg,
More informationOn a WKB-theoretic approach to. Ablowitz-Segur's connection problem for. the second Painleve equation. Yoshitsugu TAKEI
On a WKB-theoretic approach to Ablowitz-Segur's connection problem for the second Painleve equation Yoshitsugu TAKEI Research Institute for Mathematical Sciences Kyoto University Kyoto, 606-8502, JAPAN
More informationKantorovich s Majorants Principle for Newton s Method
Kantorovich s Majorants Principle for Newton s Method O. P. Ferreira B. F. Svaiter January 17, 2006 Abstract We prove Kantorovich s theorem on Newton s method using a convergence analysis which makes clear,
More informationJournal of Mathematical Analysis and Applications
J. Math. Anal. Appl. 373 2011 102 110 Contents lists available at ScienceDirect Journal of Mathematical Analysis and Applications www.elsevier.com/locate/jmaa Bloch constant and Landau s theorem for planar
More informationDiscrete Halanay-type inequalities and applications
Nonlinear Analysis 55 (2003) 669 678 www.elsevier.com/locate/na Discrete Halanay-type inequalities and applications Eduardo Liz a;, Anatoli Ivanov b, Juan Bosco Ferreiro c a Departamento de Matematica
More informationMath Review. for the Quantitative Reasoning measure of the GRE General Test
Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationA NOTE ON CONSTRUCTIVE METHODS IN BANACH ALGEBRAS
A NOTE ON CONSTRUCTIVE METHODS IN BANACH ALGEBRAS PAUL J. COHEN1 There are several well-known applications of Banach algebras to questions in classical analysis, the most notable being the Wiener Tauberian
More informationThe Nemytskii operator on bounded p-variation in the mean spaces
Vol. XIX, N o 1, Junio (211) Matemáticas: 31 41 Matemáticas: Enseñanza Universitaria c Escuela Regional de Matemáticas Universidad del Valle - Colombia The Nemytskii oerator on bounded -variation in the
More informationOn multivariable Fejér inequalities
On multivariable Fejér inequalities Linda J. Patton Mathematics Department, Cal Poly, San Luis Obispo, CA 93407 Mihai Putinar Mathematics Department, University of California, Santa Barbara, 93106 September
More informationOre extensions of Baer and p.p.-rings
Journal of Pure and Applied Algebra 151 (2000) 215 226 www.elsevier.com/locate/jpaa Ore extensions of Baer and p.p.-rings Chan Yong Hong a;, Nam Kyun Kim b; 1, Tai Keun Kwak c a Department of Mathematics,
More informationA Generalized Ostrowski Type Inequality For A Random Variable Whose Probability Density Function Belongs To L p [a, b]
Applied Mathematics E-Notes, 8008), 46-53 c ISSN 607-50 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Generalized Ostrowski Type Ineuality For A Random Variable Whose Probability
More information17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8
Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................
More informationTheorem 1. Suppose that is a Fuchsian group of the second kind. Then S( ) n J 6= and J( ) n T 6= : Corollary. When is of the second kind, the Bers con
ON THE BERS CONJECTURE FOR FUCHSIAN GROUPS OF THE SECOND KIND DEDICATED TO PROFESSOR TATSUO FUJI'I'E ON HIS SIXTIETH BIRTHDAY Toshiyuki Sugawa x1. Introduction. Supposebthat D is a simply connected domain
More informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationSome codes related to BCH-codes of low dimension
Discrete Mathematics 205 (1999) 57 64 www.elsevier.com/locate/disc Some codes related to BCH-codes of low dimension Yves Edel a,jurgen Bierbrauer b; a Mathematisches Institut der Universitat, Im Neuenheimer
More informationSubclass of Meromorphic Functions with Positive Coefficients Defined by Frasin and Darus Operator
Int. J. Open Problems Complex Analysis, Vol. 8, No. 1, March 2016 ISSN 2074-2827; Copyright c ICSRS Publication, 2016 www.i-csrs.org Subclass of Meromorphic Functions with Positive Coefficients Defined
More informationSchur functions. J. Rovnyak and H. S. V. de Snoo
Schur functions J. Rovnyak and H. S. V. de Snoo The Schur class in complex analysis is the set of holomorphic functions S(z) which are defined and satisfy S(z) 1 on the unit disk D = {z : z < 1} in the
More informationON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS
ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS YAN LI AND LIANRONG MA Abstract In this paper, we study the elements of the continued fractions of Q and ( 1 + 4Q + 1)/2 (Q N) We prove
More informationLecture 7 Local properties of analytic functions Part 1 MATH-GA Complex Variables
Lecture 7 Local properties of analytic functions Part 1 MATH-GA 2451.001 omplex Variables 1 Removable singularities 1.1 Riemann s removable singularity theorem We have said that auchy s integral formula
More informationCoefficient Bounds for a Certain Class of Analytic and Bi-Univalent Functions
Filomat 9:8 (015), 1839 1845 DOI 10.98/FIL1508839S Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Coefficient Bounds for a Certain
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
More informationAn O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra
Discrete Applied Mathematics 127 (2003) 651 656 Short Note www.elsevier.com/locate/dam An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Martin Gavalec a;,jan Plavka b a Department
More informationA quadrature rule of interpolatory type for Cauchy integrals
Journal of Computational and Applied Mathematics 126 (2000) 207 220 www.elsevier.nl/locate/cam A quadrature rule of interpolatory type for Cauchy integrals Philsu Kim, U. Jin Choi 1 Department of Mathematics,
More informationRolle s Theorem for Polynomials of Degree Four in a Hilbert Space 1
Journal of Mathematical Analysis and Applications 265, 322 33 (2002) doi:0.006/jmaa.200.7708, available online at http://www.idealibrary.com on Rolle s Theorem for Polynomials of Degree Four in a Hilbert
More informationOn rational approximation of algebraic functions. Julius Borcea. Rikard Bøgvad & Boris Shapiro
On rational approximation of algebraic functions http://arxiv.org/abs/math.ca/0409353 Julius Borcea joint work with Rikard Bøgvad & Boris Shapiro 1. Padé approximation: short overview 2. A scheme of rational
More informationDoc. Math. J. DMV 321 Chern Classes of Fibered Products of Surfaces Mina Teicher Received: March 16, 1998 Revised: September 18, 1998 Communicated by
Doc. Math. J. DMV 31 Chern Classes of Fibered Products of Surfaces Mina Teicher Received: March 16, 1998 Revised: September 18, 1998 Communicated by Thomas Peternell Abstract. In this paper we introduce
More informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
More informationUniversally divergent Fourier series via Landau s extremal functions
Comment.Math.Univ.Carolin. 56,2(2015) 159 168 159 Universally divergent Fourier series via Landau s extremal functions Gerd Herzog, Peer Chr. Kunstmann Abstract. We prove the existence of functions f A(D),
More informationBulletin of the. Iranian Mathematical Society
ISSN: 7-6X Print) ISSN: 735-855 Online) Bulletin of the Iranian Mathematical Society Vol 4 6), No, pp 95 Title: A note on lacunary series in Q K spaces Authors): J Zhou Published by Iranian Mathematical
More informationConstruction ofnew extremal self-dual codes
Discrete Mathematics 263 (2003) 81 91 www.elsevier.com/locate/disc Construction ofnew extremal self-dual codes T. Aaron Gulliver a;, Masaaki Harada b, Jon-Lark Kim c a Department of Electrical and Computer
More informationAn FKG equality with applications to random environments
Statistics & Probability Letters 46 (2000) 203 209 An FKG equality with applications to random environments Wei-Shih Yang a, David Klein b; a Department of Mathematics, Temple University, Philadelphia,
More informationA Sixteenth-order Polylogarithm Ladder
A Sixteenth-order Polylogarithm Ladder Henri Cohen, Leonard Lewin and Don Zagier CONTENTS 1. Introduction 2. Numerical Computation of Polylogarithms 3. Ladders 4. Climbing the Ladder 5. Numerical Results
More informationQUASINORMAL FAMILIES AND PERIODIC POINTS
QUASINORMAL FAMILIES AND PERIODIC POINTS WALTER BERGWEILER Dedicated to Larry Zalcman on his 60th Birthday Abstract. Let n 2 be an integer and K > 1. By f n we denote the n-th iterate of a function f.
More informationMarkov Sonin Gaussian rule for singular functions
Journal of Computational and Applied Mathematics 169 (2004) 197 212 www.elsevier.com/locate/cam Markov Sonin Gaussian rule for singular functions G.Mastroianni, D.Occorsio Dipartimento di Matematica, Universita
More informationOn a generalization of addition chains: Addition multiplication chains
Discrete Mathematics 308 (2008) 611 616 www.elsevier.com/locate/disc On a generalization of addition chains: Addition multiplication chains Hatem M. Bahig Computer Science Division, Department of Mathematics,
More information