Erdős on polynomials
|
|
- Griselda Snow
- 8 years ago
- Views:
Transcription
1 Erdős on polynomials Vilmos Totik University of Szeged and University of South Florida Vilmos Totik (SZTE and USF) Polynomials 1 / *
2 Erdős on polynomials Vilmos Totik (SZTE and USF) Polynomials 2 / *
3 Erdős on polynomials Interpolation Vilmos Totik (SZTE and USF) Polynomials 2 / *
4 Erdős on polynomials Interpolation Discrepancy theorems for zeros Vilmos Totik (SZTE and USF) Polynomials 2 / *
5 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Vilmos Totik (SZTE and USF) Polynomials 2 / *
6 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Vilmos Totik (SZTE and USF) Polynomials 2 / *
7 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Geometric problems for lemniscates Vilmos Totik (SZTE and USF) Polynomials 2 / *
8 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Geometric problems for lemniscates Orthogonal polynomials Vilmos Totik (SZTE and USF) Polynomials 2 / *
9 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Geometric problems for lemniscates Orthogonal polynomials Spacing of zeros Vilmos Totik (SZTE and USF) Polynomials 2 / *
10 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Geometric problems for lemniscates Orthogonal polynomials Spacing of zeros Geometry of zeros of derivatives Vilmos Totik (SZTE and USF) Polynomials 2 / *
11 Erdős on polynomials Interpolation Discrepancy theorems for zeros Inequalities Growth of polynomials Geometric problems for lemniscates Orthogonal polynomials Spacing of zeros Geometry of zeros of derivatives Polynomials with integer coefficients Vilmos Totik (SZTE and USF) Polynomials 2 / *
12 Erdős on polynomials Interpolation (Lubinsky s and Vértesi s surveys) Discrepancy theorems for zeros Inequalities (Erdélyi s survey) Growth of polynomials Geometric problems for lemniscates (Eremenko-Hayman s and Borwein s surveys) Orthogonal polynomials Spacing of zeros Geometry of zeros of derivatives Polynomials with integer coefficients (Borwein s and Erdélyi s surveys) Vilmos Totik (SZTE and USF) Polynomials 3 / *
13 Chebyshev polynomials Vilmos Totik (SZTE and USF) Polynomials 4 / *
14 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Vilmos Totik (SZTE and USF) Polynomials 4 / *
15 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Approximate x n by linear combination of smaller powers Vilmos Totik (SZTE and USF) Polynomials 4 / *
16 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Approximate x n by linear combination of smaller powers t n = inf P n(x)=x n + P n [ 1,1] Vilmos Totik (SZTE and USF) Polynomials 4 / *
17 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Approximate x n by linear combination of smaller powers t n = inf P n(x)=x n + P n [ 1,1] P n K = sup P n (z) z K Vilmos Totik (SZTE and USF) Polynomials 4 / *
18 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Approximate x n by linear combination of smaller powers t n = inf P n(x)=x n + P n [ 1,1] P n K = sup P n (z) z K t n = 2 2 n Vilmos Totik (SZTE and USF) Polynomials 4 / *
19 Chebyshev polynomials P. L. Chebyshev: replace x 4 in [ 1,1] by combination of smaller powers Approximate x n by linear combination of smaller powers t n = inf P n(x)=x n + P n [ 1,1] P n K = sup P n (z) z K t n = 2 2 n T n (z) = 1 cos(narccosx) 2n 1 Vilmos Totik (SZTE and USF) Polynomials 4 / *
20 Zeros of the Chebyshev polynomials Uniform spacing of zeros -1 1 Vilmos Totik (SZTE and USF) Polynomials 5 / *
21 The Erdős-Turán discrepancy theorem Vilmos Totik (SZTE and USF) Polynomials 6 / *
22 The Erdős-Turán discrepancy theorem Suppose P n (x) = x n + has all its zeros in [ 1,1] Vilmos Totik (SZTE and USF) Polynomials 6 / *
23 The Erdős-Turán discrepancy theorem Suppose P n (x) = x n + has all its zeros in [ 1,1] Let x j be the zeros Vilmos Totik (SZTE and USF) Polynomials 6 / *
24 The Erdős-Turán discrepancy theorem Suppose P n (x) = x n + has all its zeros in [ 1,1] Let x j be the zeros P n [ 1,1] A n 2 n Vilmos Totik (SZTE and USF) Polynomials 6 / *
25 The Erdős-Turán discrepancy theorem Suppose P n (x) = x n + has all its zeros in [ 1,1] Let x j be the zeros P n [ 1,1] A n 2 n Th. (Erdős-Turán, 1940) For any 1 a < b 1 #{x j (a,b)} n arcsinb arcsina π 8 logan n Vilmos Totik (SZTE and USF) Polynomials 6 / *
26 Equilibrium measures Vilmos Totik (SZTE and USF) Polynomials 7 / *
27 Equilibrium measures E C compact Vilmos Totik (SZTE and USF) Polynomials 7 / *
28 Equilibrium measures E C compact µ unit Borel-measure on E, Vilmos Totik (SZTE and USF) Polynomials 7 / *
29 Equilibrium measures E C compact µ unit Borel-measure on E, its logarithmic energy is 1 I(µ) = log z t dµ(z)dµ(t) Vilmos Totik (SZTE and USF) Polynomials 7 / *
30 Equilibrium measures E C compact µ unit Borel-measure on E, its logarithmic energy is 1 I(µ) = log z t dµ(z)dµ(t) If this is finite for some µ, then there is a unique minimizing measure µ E, called equilibrium measure of E Vilmos Totik (SZTE and USF) Polynomials 7 / *
31 Equilibrium measures E C compact µ unit Borel-measure on E, its logarithmic energy is 1 I(µ) = log z t dµ(z)dµ(t) If this is finite for some µ, then there is a unique minimizing measure µ E, called equilibrium measure of E Examples: dµ [ 1,1] (t) = 1 π 1 t 2dt Vilmos Totik (SZTE and USF) Polynomials 7 / *
32 Equilibrium measures E C compact µ unit Borel-measure on E, its logarithmic energy is 1 I(µ) = log z t dµ(z)dµ(t) If this is finite for some µ, then there is a unique minimizing measure µ E, called equilibrium measure of E Examples: If C 1 is the unit circle, then dµ [ 1,1] (t) = 1 π 1 t 2dt dµ C1 (e it ) = 1 2π dt is the normalized arc measure Vilmos Totik (SZTE and USF) Polynomials 7 / *
33 Logarithmic capacity With the minimal energy I(K) = inf µ I(µ) Vilmos Totik (SZTE and USF) Polynomials 8 / *
34 Logarithmic capacity With the minimal energy I(K) = inf µ I(µ) define the logarithmic capacity as cap(k) = e I(K) Vilmos Totik (SZTE and USF) Polynomials 8 / *
35 Logarithmic capacity With the minimal energy I(K) = inf µ I(µ) define the logarithmic capacity as cap(k) = e I(K) Examples: If K is a disk/circle of radius r then c(k) = r Vilmos Totik (SZTE and USF) Polynomials 8 / *
36 Logarithmic capacity With the minimal energy I(K) = inf µ I(µ) define the logarithmic capacity as cap(k) = e I(K) Examples: If K is a disk/circle of radius r then c(k) = r cap([ 1,1]) = 1/2 Vilmos Totik (SZTE and USF) Polynomials 8 / *
37 Logarithmic capacity With the minimal energy I(K) = inf µ I(µ) define the logarithmic capacity as cap(k) = e I(K) Examples: If K is a disk/circle of radius r then c(k) = r cap([ 1,1]) = 1/2 If P n (z) = z n +, then P n K cap(k) n Vilmos Totik (SZTE and USF) Polynomials 8 / *
38 Transfinite diameter, Chebyshev constants K C compact δ n = sup z 1,...,z n K z i z j i j Vilmos Totik (SZTE and USF) Polynomials 9 / *
39 Transfinite diameter, Chebyshev constants K C compact δ n = sup z 1,...,z n K z i z j i j Transfinite diameter: δ 1/n(n 1) n δ(k) Vilmos Totik (SZTE and USF) Polynomials 9 / *
40 Transfinite diameter, Chebyshev constants K C compact δ n = sup z 1,...,z n K z i z j i j Transfinite diameter: δ 1/n(n 1) n δ(k) t n = inf z n + K Vilmos Totik (SZTE and USF) Polynomials 9 / *
41 Transfinite diameter, Chebyshev constants K C compact δ n = sup z 1,...,z n K z i z j i j Transfinite diameter: δ 1/n(n 1) n δ(k) t n = inf z n + K Chebyshev constant t 1/n n t(k) Vilmos Totik (SZTE and USF) Polynomials 9 / *
42 Transfinite diameter, Chebyshev constants K C compact δ n = sup z 1,...,z n K z i z j i j Transfinite diameter: δ 1/n(n 1) n δ(k) t n = inf z n + K Chebyshev constant t 1/n n t(k) Fekete, Zygmund, Szegő: cap(k) = δ(k) = t(k) Vilmos Totik (SZTE and USF) Polynomials 9 / *
43 The Erdős-Turán discrepancy theorem Vilmos Totik (SZTE and USF) Polynomials 10 / *
44 The Erdős-Turán discrepancy theorem P n (x) = x n +, Vilmos Totik (SZTE and USF) Polynomials 10 / *
45 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n Vilmos Totik (SZTE and USF) Polynomials 10 / *
46 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n The Erdős-Turán theorem: For any 1 a < b 1 #{x j (a,b)} b 1 n a π 1 x 2dx 8 logan n (1) Vilmos Totik (SZTE and USF) Polynomials 10 / *
47 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n The Erdős-Turán theorem: For any 1 a < b 1 #{x j (a,b)} b 1 n a π 1 x 2dx 8 logan n Normalized zero distribution ν n = 1 n j δ x j (1) Vilmos Totik (SZTE and USF) Polynomials 10 / *
48 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n The Erdős-Turán theorem: For any 1 a < b 1 #{x j (a,b)} b 1 n a π 1 x 2dx 8 logan n Normalized zero distribution ν n = 1 n j δ x j Equivalent form of (1): with the Chebyshev distribution dµ [ 1,1] (x) = 1 π 1 x 2dx (1) Vilmos Totik (SZTE and USF) Polynomials 10 / *
49 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n The Erdős-Turán theorem: For any 1 a < b 1 #{x j (a,b)} b 1 n a π 1 x 2dx 8 logan n Normalized zero distribution ν n = 1 n j δ x j Equivalent form of (1): with the Chebyshev distribution for any I [ 1,1] dµ [ 1,1] (x) = 1 π 1 x 2dx (1) νn (I) µ [ 1,1] (I) 8 logan n Vilmos Totik (SZTE and USF) Polynomials 10 / *
50 The Erdős-Turán discrepancy theorem P n (x) = x n +, P n [ 1,1] A n /2 n The Erdős-Turán theorem: For any 1 a < b 1 #{x j (a,b)} b 1 n a π 1 x 2dx 8 logan n Normalized zero distribution ν n = 1 n j δ x j Equivalent form of (1): with the Chebyshev distribution for any I [ 1,1] dµ [ 1,1] (x) = 1 π 1 x 2dx (1) νn (I) µ [ 1,1] (I) 8 logan n Vilmos Totik (SZTE and USF) Polynomials 10 / *
51 A general discrepancy theorem Let K be a finite union of smooth Jordan arcs Vilmos Totik (SZTE and USF) Polynomials 11 / *
52 A general discrepancy theorem Let K be a finite union of smooth Jordan arcs J Vilmos Totik (SZTE and USF) Polynomials 11 / *
53 A general discrepancy theorem Let K be a finite union of smooth Jordan arcs J Vilmos Totik (SZTE and USF) Polynomials 11 / *
54 A general discrepancy theorem Let K be a finite union of smooth Jordan arcs J J* Vilmos Totik (SZTE and USF) Polynomials 12 / *
55 A general discrepancy theorem Let K be a finite union of smooth Jordan arcs J J* Recall: if P n (z) = z n +, then P n K cap(k) n Vilmos Totik (SZTE and USF) Polynomials 12 / *
56 A general discrepancy theorem K finite union of smooth Jordan arcs Vilmos Totik (SZTE and USF) Polynomials 13 / *
57 A general discrepancy theorem K finite union of smooth Jordan arcs P n (z) = z n + Vilmos Totik (SZTE and USF) Polynomials 13 / *
58 A general discrepancy theorem K finite union of smooth Jordan arcs P n (z) = z n + P n K A n cap(k) n Vilmos Totik (SZTE and USF) Polynomials 13 / *
59 A general discrepancy theorem K finite union of smooth Jordan arcs P n (z) = z n + P n K A n cap(k) n ν n normalized zero distribution Vilmos Totik (SZTE and USF) Polynomials 13 / *
60 A general discrepancy theorem K finite union of smooth Jordan arcs P n (z) = z n + P n K A n cap(k) n ν n normalized zero distribution Th. (Andrievskii-Blatt, ) For any J K ν n (J ) µ K (J logan ) C. n Vilmos Totik (SZTE and USF) Polynomials 13 / *
61 A general discrepancy theorem K finite union of smooth Jordan arcs P n (z) = z n + P n K A n cap(k) n ν n normalized zero distribution Th. (Andrievskii-Blatt, ) For any J K ν n (J ) µ K (J logan ) C. n In particular, if P n 1/n K cap(k), then ν n µ K Vilmos Totik (SZTE and USF) Polynomials 13 / *
62 The Jentzsch-Szegő theorem Vilmos Totik (SZTE and USF) Polynomials 14 / *
63 The Jentzsch-Szegő theorem No such results are true for Jordan curves: Vilmos Totik (SZTE and USF) Polynomials 14 / *
64 The Jentzsch-Szegő theorem No such results are true for Jordan curves: z n on the unit circle Vilmos Totik (SZTE and USF) Polynomials 14 / *
65 The Jentzsch-Szegő theorem No such results are true for Jordan curves: z n on the unit circle Jentsch, 1918: If the radius of convergence of j=0 a jz j is 1, then the zeros of the partial sums n 0 a jz j, n = 1,2,... are dense at the unit circle Vilmos Totik (SZTE and USF) Polynomials 14 / *
66 The Jentzsch-Szegő theorem No such results are true for Jordan curves: z n on the unit circle Jentsch, 1918: If the radius of convergence of j=0 a jz j is 1, then the zeros of the partial sums n 0 a jz j, n = 1,2,... are dense at the unit circle Szegő, 1922: There is a sequence n 1 < n 2 < such that if z j,n = r j,n e iθ j,n, 1 j n are the zeros of n 0 a jz j, then {θ j,nk } n k 0 is asymptotically uniformly distributed (and r j,nk 1 for most j) Vilmos Totik (SZTE and USF) Polynomials 14 / *
67 The second discrepancy theorem P n (z) = a n z n + +a 0, C 1 = { z = 1} Vilmos Totik (SZTE and USF) Polynomials 15 / *
68 The second discrepancy theorem P n (z) = a n z n + +a 0, C 1 = { z = 1} z j = r j e iθ j are the zeros Vilmos Totik (SZTE and USF) Polynomials 15 / *
69 The second discrepancy theorem P n (z) = a n z n + +a 0, C 1 = { z = 1} z j = r j e iθ j are the zeros Th. (Erdős-Turán, 1950) For any J [0,2π] Vilmos Totik (SZTE and USF) Polynomials 15 / *
70 The second discrepancy theorem P n (z) = a n z n + +a 0, C 1 = { z = 1} z j = r j e iθ j are the zeros Th. (Erdős-Turán, 1950) For any J [0,2π] #{θ j J} J n 2π 16 log P n C1 / a 0 a n n Vilmos Totik (SZTE and USF) Polynomials 15 / *
71 The second discrepancy theorem P n (z) = a n z n + +a 0, C 1 = { z = 1} z j = r j e iθ j are the zeros Th. (Erdős-Turán, 1950) For any J [0,2π] #{θ j J} J n 2π 16 log P n C1 / a 0 a n n Note P n C1 j a j Vilmos Totik (SZTE and USF) Polynomials 15 / *
72 Number of real zeros of a polynomial Vilmos Totik (SZTE and USF) Polynomials 16 / *
73 Number of real zeros of a polynomial #{θ j J} n J log( 2π 16 j a j / ) a 0 a n, n Vilmos Totik (SZTE and USF) Polynomials 16 / *
74 Number of real zeros of a polynomial #{θ j J} n J log( 2π 16 j a j / ) a 0 a n, n Consequence: there are at most ( ) 32 nlog a j / a0 a n real zeros of P n j Vilmos Totik (SZTE and USF) Polynomials 16 / *
75 Number of real zeros of a polynomial #{θ j J} n J log( 2π 16 j a j / ) a 0 a n, n Consequence: there are at most ( ) 32 nlog a j / a0 a n real zeros of P n Better than previous estimates of Bloch, Pólya, Schmidt, basically a theorem of Schur, Szegő j Vilmos Totik (SZTE and USF) Polynomials 16 / *
76 The Szegő theorem Vilmos Totik (SZTE and USF) Polynomials 17 / *
77 The Szegő theorem j=0 a jz j, a 0 0 Vilmos Totik (SZTE and USF) Polynomials 17 / *
78 The Szegő theorem j=0 a jz j, a 0 0 Radius of convergence 1 limsup n a n 1/n = 1 Vilmos Totik (SZTE and USF) Polynomials 17 / *
79 The Szegő theorem j=0 a jz j, a 0 0 Radius of convergence 1 limsup n a n 1/n = 1 There is a subsequence {n k } with C nk := ( nk j=0 a j a0 a n ) 1/nk 1 Vilmos Totik (SZTE and USF) Polynomials 17 / *
80 The Szegő theorem j=0 a jz j, a 0 0 Radius of convergence 1 limsup n a n 1/n = 1 There is a subsequence {n k } with C nk := ( nk j=0 a j a0 a n ) 1/nk 1 z j,n = r j,n e iθ j,n are the zeros of n j=0 a jz j Vilmos Totik (SZTE and USF) Polynomials 17 / *
81 The Szegő theorem j=0 a jz j, a 0 0 Radius of convergence 1 limsup n a n 1/n = 1 There is a subsequence {n k } with C nk := ( nk j=0 a j a0 a n ) 1/nk 1 z j,n = r j,n e iθ j,n are the zeros of n j=0 a jz j #{θ j,nk J} n k J 2π 16 logc nk 0 Vilmos Totik (SZTE and USF) Polynomials 17 / *
82 General discrepancy theorems Vilmos Totik (SZTE and USF) Polynomials 18 / *
83 General discrepancy theorems J J* z 0 Vilmos Totik (SZTE and USF) Polynomials 18 / *
84 General discrepancy theorems J J* z 0 Andrievskii-Blatt, : If Γ is a smooth Jordan curve, z 0 a fixed point inside, P n (z) = z n + +a n, and Vilmos Totik (SZTE and USF) Polynomials 18 / *
85 General discrepancy theorems J J* z 0 Andrievskii-Blatt, : If Γ is a smooth Jordan curve, z 0 a fixed point inside, P n (z) = z n + +a n, and B n = P n Γ / cap(γ) n P n (z 0 ), then for all J Γ Vilmos Totik (SZTE and USF) Polynomials 18 / *
86 General discrepancy theorems J J* z 0 Andrievskii-Blatt, : If Γ is a smooth Jordan curve, z 0 a fixed point inside, P n (z) = z n + +a n, and B n = P n Γ / cap(γ) n P n (z 0 ), then for all J Γ #{z j J } µ Γ (J) n C logbn 0 n Vilmos Totik (SZTE and USF) Polynomials 18 / *
87 It is true for a family of Jordan curves Vilmos Totik (SZTE and USF) Polynomials 18 / * General discrepancy theorems J J* z 0 Andrievskii-Blatt, : If Γ is a smooth Jordan curve, z 0 a fixed point inside, P n (z) = z n + +a n, and B n = P n Γ / cap(γ) n P n (z 0 ), then for all J Γ #{z j J } µ Γ (J) n C logbn 0 n
88 Orthogonal polynomials ρ a measure with compact support Vilmos Totik (SZTE and USF) Polynomials 19 / *
89 Orthogonal polynomials ρ a measure with compact support p n (z) = γ n z n + orthonormal polynomials with respect to ρ: { 0 if n m p n p m dρ = 1 if n = m Vilmos Totik (SZTE and USF) Polynomials 19 / *
90 Orthogonal polynomials ρ a measure with compact support p n (z) = γ n z n + orthonormal polynomials with respect to ρ: { 0 if n m p n p m dρ = 1 if n = m Erdős-Turán were among the first to get results for general weights Vilmos Totik (SZTE and USF) Polynomials 19 / *
91 Orthogonal polynomials ρ a measure with compact support p n (z) = γ n z n + orthonormal polynomials with respect to ρ: { 0 if n m p n p m dρ = 1 if n = m Erdős-Turán were among the first to get results for general weights Th. (Erdős-Turán, 1940) If the support of ρ is [ 1,1], dρ(x) = w(x)dx and w > 0 almost everywhere, Vilmos Totik (SZTE and USF) Polynomials 19 / *
92 Orthogonal polynomials ρ a measure with compact support p n (z) = γ n z n + orthonormal polynomials with respect to ρ: { 0 if n m p n p m dρ = 1 if n = m Erdős-Turán were among the first to get results for general weights Th. (Erdős-Turán, 1940) If the support of ρ is [ 1,1], dρ(x) = w(x)dx and w > 0 almost everywhere, then the asymptotic zero distribution of p n is the Chebyshev distribution Vilmos Totik (SZTE and USF) Polynomials 19 / *
93 Orthogonal polynomials ρ a measure with compact support p n (z) = γ n z n + orthonormal polynomials with respect to ρ: { 0 if n m p n p m dρ = 1 if n = m Erdős-Turán were among the first to get results for general weights Th. (Erdős-Turán, 1940) If the support of ρ is [ 1,1], dρ(x) = w(x)dx and w > 0 almost everywhere, then the asymptotic zero distribution of p n is the Chebyshev distribution p n (z) 1/n z + z 2 1, z [ 1,1] Vilmos Totik (SZTE and USF) Polynomials 19 / *
94 Orthogonal polynomials w > 0 almost everywhere on [ 1, 1] implies classical behavior Vilmos Totik (SZTE and USF) Polynomials 20 / *
95 Orthogonal polynomials w > 0 almost everywhere on [ 1, 1] implies classical behavior Rakhmanov, 1982: actually p n+1 (z) p n (z) z + z 2 1 Vilmos Totik (SZTE and USF) Polynomials 20 / *
96 Orthogonal polynomials w > 0 almost everywhere on [ 1, 1] implies classical behavior Rakhmanov, 1982: actually p n+1 (z) p n (z) z + z 2 1 Widom, 1967: If the support is not connected, then such external behavior is not possible Vilmos Totik (SZTE and USF) Polynomials 20 / *
97 Orthogonal polynomials w > 0 almost everywhere on [ 1, 1] implies classical behavior Rakhmanov, 1982: actually p n+1 (z) p n (z) z + z 2 1 Widom, 1967: If the support is not connected, then such external behavior is not possible Assume S = supp(ρ) has connected complement and empty interior (e.g. S R) Vilmos Totik (SZTE and USF) Polynomials 20 / *
98 Orthogonal polynomials w > 0 almost everywhere on [ 1, 1] implies classical behavior Rakhmanov, 1982: actually p n+1 (z) p n (z) z + z 2 1 Widom, 1967: If the support is not connected, then such external behavior is not possible Assume S = supp(ρ) has connected complement and empty interior (e.g. S R) Always 1 cap(s) liminfγ1/n n Vilmos Totik (SZTE and USF) Polynomials 20 / *
99 Regular behavior Vilmos Totik (SZTE and USF) Polynomials 21 / *
100 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): Vilmos Totik (SZTE and USF) Polynomials 21 / *
101 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): The asymptotic zero distribution of p n is the equilibrium distribution µ S of the support S Vilmos Totik (SZTE and USF) Polynomials 21 / *
102 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): The asymptotic zero distribution of p n is the equilibrium distribution µ S of the support S p n (z) 1/n G S (z) z S Vilmos Totik (SZTE and USF) Polynomials 21 / *
103 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): The asymptotic zero distribution of p n is the equilibrium distribution µ S of the support S p n (z) 1/n G S (z) z S γ 1/n n 1/cap(S) Vilmos Totik (SZTE and USF) Polynomials 21 / *
104 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): The asymptotic zero distribution of p n is the equilibrium distribution µ S of the support S p n (z) 1/n G S (z) z S γ 1/n n 1/cap(S) sup P n 1/n P n S P n 1/n L q (ρ) 1, q > 0 Vilmos Totik (SZTE and USF) Polynomials 21 / *
105 Regular behavior The following are equivalent (Stahl-T., 1991, Ullman, Erdős, Widom,...): The asymptotic zero distribution of p n is the equilibrium distribution µ S of the support S p n (z) 1/n G S (z) z S γ 1/n n 1/cap(S) sup P n In this case we say ρ Reg 1/n P n S P n 1/n L q (ρ) 1, q > 0 Vilmos Totik (SZTE and USF) Polynomials 21 / *
106 Regular behavior Vilmos Totik (SZTE and USF) Polynomials 22 / *
107 Regular behavior ρ Reg the measure is not too thin on any part of its support Vilmos Totik (SZTE and USF) Polynomials 22 / *
108 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically Vilmos Totik (SZTE and USF) Polynomials 22 / *
109 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Vilmos Totik (SZTE and USF) Polynomials 22 / *
110 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. Vilmos Totik (SZTE and USF) Polynomials 22 / *
111 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Vilmos Totik (SZTE and USF) Polynomials 22 / *
112 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Many weaker criteria exist Vilmos Totik (SZTE and USF) Polynomials 22 / *
113 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Many weaker criteria exist No necessary and sufficient condition is known Vilmos Totik (SZTE and USF) Polynomials 22 / *
114 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Many weaker criteria exist No necessary and sufficient condition is known Erdős conjectured: if S = [ 1,1] and dρ(x) = w(x)dx with a bounded w, then ρ Reg Vilmos Totik (SZTE and USF) Polynomials 22 / *
115 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Many weaker criteria exist No necessary and sufficient condition is known Erdős conjectured: if S = [ 1,1] and dρ(x) = w(x)dx with a bounded w, then ρ Reg if and only if cap(e ǫ ) 1/2 as ǫ 0 where E ǫ is any set obtained from {x w(x) > 0} by removing a subset of measure < ǫ. Vilmos Totik (SZTE and USF) Polynomials 22 / *
116 Regular behavior ρ Reg the measure is not too thin on any part of its support orthogonal polynomials behave non-pathologically ρ Reg is a very weak assumption on the measure Erdős-Turán criterion for regularity on [ 1, 1]: dρ(z) = w(z)dz with w(z) > 0 a.e. General Erdős-Turán criterion for regularity: dρ(z) = w(z)dµ S (z) with w(z) > 0 µ S -a.e. Many weaker criteria exist No necessary and sufficient condition is known Erdős conjectured: if S = [ 1,1] and dρ(x) = w(x)dx with a bounded w, then ρ Reg if and only if cap(e ǫ ) 1/2 as ǫ 0 where E ǫ is any set obtained from {x w(x) > 0} by removing a subset of measure < ǫ. Sufficiency follows from some strong regularity criteria Vilmos Totik (SZTE and USF) Polynomials 22 / *
117 Spacing of zeros Vilmos Totik (SZTE and USF) Polynomials 23 / *
118 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], Vilmos Totik (SZTE and USF) Polynomials 23 / *
119 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, Vilmos Totik (SZTE and USF) Polynomials 23 / *
120 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, x j,n = cosθ j,n are the zeros Vilmos Totik (SZTE and USF) Polynomials 23 / *
121 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, x j,n = cosθ j,n are the zeros Rough spacing: θ j 1 θ j 1 n, i.e. c 1 n θ j 1 θ j c 2 n Vilmos Totik (SZTE and USF) Polynomials 23 / *
122 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, x j,n = cosθ j,n are the zeros Rough spacing: θ j 1 θ j 1 n, i.e. c 1 n θ j 1 θ j c 2 n Fine spacing: θ j 1 θ j π n, i.e. n(θ j 1 θ j ) π n Vilmos Totik (SZTE and USF) Polynomials 23 / *
123 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, x j,n = cosθ j,n are the zeros Rough spacing: θ j 1 θ j 1 n, i.e. c 1 n θ j 1 θ j c 2 n Fine spacing: θ j 1 θ j π n, i.e. n(θ j 1 θ j ) π n Classical (Jacobi) polynomials obey fine spacing inside the interval of orthogonality Vilmos Totik (SZTE and USF) Polynomials 23 / *
124 Spacing of zeros dρ(x) = w(x)dx a measure on [ 1,1], p n orthogonal polynomials, x j,n = cosθ j,n are the zeros Rough spacing: θ j 1 θ j 1 n, i.e. c 1 n θ j 1 θ j c 2 n Fine spacing: θ j 1 θ j π n, i.e. n(θ j 1 θ j ) π n Classical (Jacobi) polynomials obey fine spacing inside the interval of orthogonality Vilmos Totik (SZTE and USF) Polynomials 23 / *
125 Rough spacing of zeros Erdős and Turán had many results in s on rough spacing Vilmos Totik (SZTE and USF) Polynomials 24 / *
126 Rough spacing of zeros Erdős and Turán had many results in s on rough spacing Mastroianni-T., 2005: rough spacing ρ doubling Vilmos Totik (SZTE and USF) Polynomials 24 / *
127 Rough spacing of zeros Erdős and Turán had many results in s on rough spacing Mastroianni-T., 2005: rough spacing ρ doubling ρ is doubling if ρ(2i) Cρ(I) for I [ 1,1] Vilmos Totik (SZTE and USF) Polynomials 24 / *
128 Fine zero spacing Vilmos Totik (SZTE and USF) Polynomials 25 / *
129 Fine zero spacing Th. (Erdős-Turán, 1940) If w > 0 continuous on [ 1,1], then θ j 1 θ j π n θ j [ǫ,π ǫ] (2) Vilmos Totik (SZTE and USF) Polynomials 25 / *
130 Fine zero spacing Th. (Erdős-Turán, 1940) If w > 0 continuous on [ 1,1], then θ j 1 θ j π n θ j [ǫ,π ǫ] (2) No longer true if w can vanish! Vilmos Totik (SZTE and USF) Polynomials 25 / *
131 Fine zero spacing Th. (Erdős-Turán, 1940) If w > 0 continuous on [ 1,1], then θ j 1 θ j π n θ j [ǫ,π ǫ] (2) No longer true if w can vanish! A form of universality in random matrix theory asymptotics for the kernel n p k (z +a/n)p k (z +b/n) a,b C k=0 Vilmos Totik (SZTE and USF) Polynomials 25 / *
132 Fine zero spacing Th. (Erdős-Turán, 1940) If w > 0 continuous on [ 1,1], then θ j 1 θ j π n θ j [ǫ,π ǫ] (2) No longer true if w can vanish! A form of universality in random matrix theory asymptotics for the kernel n p k (z +a/n)p k (z +b/n) a,b C k=0 Lubinsky, 2009: universality is true under the ρ Reg global condition and under local continuity and positivity condition Vilmos Totik (SZTE and USF) Polynomials 25 / *
133 Fine zero spacing Th. (Erdős-Turán, 1940) If w > 0 continuous on [ 1,1], then θ j 1 θ j π n θ j [ǫ,π ǫ] (2) No longer true if w can vanish! A form of universality in random matrix theory asymptotics for the kernel n p k (z +a/n)p k (z +b/n) a,b C k=0 Lubinsky, 2009: universality is true under the ρ Reg global condition and under local continuity and positivity condition Levin-Lubinsky: under these conditions (2) is true Vilmos Totik (SZTE and USF) Polynomials 25 / *
134 Universality fine zero spacing Vilmos Totik (SZTE and USF) Polynomials 26 / *
135 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S Vilmos Totik (SZTE and USF) Polynomials 26 / *
136 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S If I S is an interval, then dµ S (t) = ω S (t)dt Vilmos Totik (SZTE and USF) Polynomials 26 / *
137 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S If I S is an interval, then dµ S (t) = ω S (t)dt Example: ω [ 1,1] (t) = 1 π 1 t 2 Vilmos Totik (SZTE and USF) Polynomials 26 / *
138 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S If I S is an interval, then dµ S (t) = ω S (t)dt Example: ω [ 1,1] (t) = 1 π 1 t 2 Simon, T., 2010: ρ Reg and continuity and positivity of w(t) := dρ(t)/dt at an x Int(S) imply nω S (x)(x j+1 x j ) 1, x j x (3) Vilmos Totik (SZTE and USF) Polynomials 26 / *
139 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S If I S is an interval, then dµ S (t) = ω S (t)dt Example: ω [ 1,1] (t) = 1 π 1 t 2 Simon, T., 2010: ρ Reg and continuity and positivity of w(t) := dρ(t)/dt at an x Int(S) imply nω S (x)(x j+1 x j ) 1, x j x (3) If log1/w L 1 (I), then (3) is true at almost all x I. Vilmos Totik (SZTE and USF) Polynomials 26 / *
140 Universality fine zero spacing S the support of ρ, µ S the equilibrium measures of S If I S is an interval, then dµ S (t) = ω S (t)dt Example: ω [ 1,1] (t) = 1 π 1 t 2 Simon, T., 2010: ρ Reg and continuity and positivity of w(t) := dρ(t)/dt at an x Int(S) imply nω S (x)(x j+1 x j ) 1, x j x (3) If log1/w L 1 (I), then (3) is true at almost all x I. Is (3)/universality true (say on [ 1, 1]) a.e. solely under the Erdős-Turán condition w > 0 a.e.? Vilmos Totik (SZTE and USF) Polynomials 26 / *
141 Critical points of polynomials Vilmos Totik (SZTE and USF) Polynomials 27 / *
142 Critical points of polynomials P n polynomial of degree n Vilmos Totik (SZTE and USF) Polynomials 27 / *
143 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Vilmos Totik (SZTE and USF) Polynomials 27 / *
144 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Gauss-Lucas, 1800 s: every ξ j is in the convex hull of {z 1,...,z n } Vilmos Totik (SZTE and USF) Polynomials 27 / *
145 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Gauss-Lucas, 1800 s: every ξ j is in the convex hull of {z 1,...,z n } Erdős-Niven, 1948: Vilmos Totik (SZTE and USF) Polynomials 27 / *
146 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Gauss-Lucas, 1800 s: every ξ j is in the convex hull of {z 1,...,z n } Erdős-Niven, 1948: 1 n 1 Iξ j 1 n 1 n 1 n Iz k 1 Vilmos Totik (SZTE and USF) Polynomials 27 / *
147 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Gauss-Lucas, 1800 s: every ξ j is in the convex hull of {z 1,...,z n } Erdős-Niven, 1948: 1 n 1 Iξ j 1 n 1 n 1 n Iz k 1 1 n 1 ξ j 1 n 1 n 1 n z k 1 Vilmos Totik (SZTE and USF) Polynomials 27 / *
148 Critical points of polynomials P n polynomial of degree n z 1,...,z n zeros of P n, ξ 1,...,ξ n 1 zeros of P n Gauss-Lucas, 1800 s: every ξ j is in the convex hull of {z 1,...,z n } Erdős-Niven, 1948: 1 n 1 Iξ j 1 n 1 n 1 n Iz k 1 de Bruijn-Springer: 1 n 1 ξ j 1 n 1 n 1 1 n 1 ξ j m 1 n 1 n 1 n z k 1 n z k m 1 Vilmos Totik (SZTE and USF) Polynomials 27 / *
149 Conjectures on majorization Vilmos Totik (SZTE and USF) Polynomials 28 / *
150 Conjectures on majorization de Bruijn-Springer conjecture (1948): if ϕ : C R + is convex, then 1 n 1 ϕ(ξ j ) 1 n 1 n 1 n ϕ(z k ) 1 Vilmos Totik (SZTE and USF) Polynomials 28 / *
151 Conjectures on majorization de Bruijn-Springer conjecture (1948): if ϕ : C R + is convex, then 1 n 1 ϕ(ξ j ) 1 n 1 n 1 n ϕ(z k ) 1 Very strong property, ( theory of majorization ; Weyl, Birkhoff, Hardy-Littlewood-Pólya) Vilmos Totik (SZTE and USF) Polynomials 28 / *
152 Conjectures on majorization de Bruijn-Springer conjecture (1948): if ϕ : C R + is convex, then 1 n 1 ϕ(ξ j ) 1 n 1 n 1 n ϕ(z k ) 1 Very strong property, ( theory of majorization ; Weyl, Birkhoff, Hardy-Littlewood-Pólya) Many other conjectures (by Schoenberg, Katroprinakis,...) on the relation of the z k s and ξ j s Vilmos Totik (SZTE and USF) Polynomials 28 / *
153 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if Vilmos Totik (SZTE and USF) Polynomials 29 / *
154 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if a ij 0, Vilmos Totik (SZTE and USF) Polynomials 29 / *
155 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if a ij 0, each row-sum equals 1 Vilmos Totik (SZTE and USF) Polynomials 29 / *
156 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if a ij 0, each row-sum equals 1 each column-sum equals (n 1)/n Vilmos Totik (SZTE and USF) Polynomials 29 / *
157 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if Let a ij 0, each row-sum equals 1 each column-sum equals (n 1)/n Z = z 1. z n Ξ = ξ 1. ξ n 1 Vilmos Totik (SZTE and USF) Polynomials 29 / *
158 The Malamud-Pereira theorem An (n 1) n A = (a ij ) matrix is doubly stochastic if Let a ij 0, each row-sum equals 1 each column-sum equals (n 1)/n Z = z 1. z n Ξ = ξ 1. ξ n 1 Th. (Malamud, Pereira, 2003) There is a doubly stochastic matrix A such that Ξ = AZ Vilmos Totik (SZTE and USF) Polynomials 29 / *
159 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: Vilmos Totik (SZTE and USF) Polynomials 30 / *
160 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k Vilmos Totik (SZTE and USF) Polynomials 30 / *
161 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j ϕ(ξ j ) 1 n 1 a jk ϕ(z k ) j k Vilmos Totik (SZTE and USF) Polynomials 30 / *
162 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j = 1 n 1 ϕ(ξ j ) 1 n 1 ϕ(z k ) j k a jk ϕ(z k ) j k a jk = 1 ϕ(z k ) n k Vilmos Totik (SZTE and USF) Polynomials 30 / *
163 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j = 1 n 1 ϕ(ξ j ) 1 n 1 ϕ(z k ) j k a jk ϕ(z k ) j k a jk = 1 ϕ(z k ) n k Examples: 1) 1 n 1 Rξ j m 1 n 1 n 1 n Rz k m 1 Vilmos Totik (SZTE and USF) Polynomials 30 / *
164 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j = 1 n 1 ϕ(ξ j ) 1 n 1 ϕ(z k ) j k a jk ϕ(z k ) j k a jk = 1 ϕ(z k ) n k Examples: 1) 1 n 1 Rξ j m 1 n 1 n 1 n Rz k m 1 2) If all zeros lie in the upper-half plane, then Vilmos Totik (SZTE and USF) Polynomials 30 / *
165 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j = 1 n 1 ϕ(ξ j ) 1 n 1 ϕ(z k ) j k a jk ϕ(z k ) j k a jk = 1 ϕ(z k ) n k Examples: 1) 1 n 1 Rξ j m 1 n 1 n 1 n Rz k m 1 2) If all zeros lie in the upper-half plane, then ( n ) 1/n Iz k 1 ( n 1 1 Iξ j ) 1/(n 1) Vilmos Totik (SZTE and USF) Polynomials 30 / *
166 Gauss-Lucas, de Brjuin-Springer etc. are all immediate consequences: ξ j = k a jkz k 1 n 1 j = 1 n 1 ϕ(ξ j ) 1 n 1 ϕ(z k ) j k a jk ϕ(z k ) j k a jk = 1 ϕ(z k ) n k Examples: 1) 1 n 1 Rξ j m 1 n 1 n 1 n Rz k m 1 2) If all zeros lie in the upper-half plane, then ( n ) 1/n Iz k 1 ( n 1 1 Iξ j ) 1/(n 1) Vilmos Totik (SZTE and USF) Polynomials 30 / *
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationSMALL POLYNOMIALS WITH INTEGER COEFFICIENTS
SMALL POLYNOMIALS WITH INTGR COFFICINTS IGOR. PRITSKR Abstract. We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with
More information6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.
hapter omplex integration. omplex number quiz. Simplify 3+4i. 2. Simplify 3+4i. 3. Find the cube roots of. 4. Here are some identities for complex conjugate. Which ones need correction? z + w = z + w,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationMATH 381 HOMEWORK 2 SOLUTIONS
MATH 38 HOMEWORK SOLUTIONS Question (p.86 #8). If g(x)[e y e y ] is harmonic, g() =,g () =, find g(x). Let f(x, y) = g(x)[e y e y ].Then Since f(x, y) is harmonic, f + f = and we require x y f x = g (x)[e
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More information4.5 Chebyshev Polynomials
230 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION 4.5 Chebyshev Polynomials We now turn our attention to polynomial interpolation for f (x) over [ 1, 1] based on the nodes 1 x 0 < x 1 < < x N 1. Both
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationTwo Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering
Two Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering Department of Industrial Engineering and Management Sciences Northwestern University September 15th, 2014
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationUseful Mathematical Symbols
32 Useful Mathematical Symbols Symbol What it is How it is read How it is used Sample expression + * ddition sign OR Multiplication sign ND plus or times and x Multiplication sign times Sum of a few disjunction
More informationLargest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More informationSolutions for Review Problems
olutions for Review Problems 1. Let be the triangle with vertices A (,, ), B (4,, 1) and C (,, 1). (a) Find the cosine of the angle BAC at vertex A. (b) Find the area of the triangle ABC. (c) Find a vector
More informationEstimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia
Estimating the Degree of Activity of jumps in High Frequency Financial Data joint with Yacine Aït-Sahalia Aim and setting An underlying process X = (X t ) t 0, observed at equally spaced discrete times
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More information3. Regression & Exponential Smoothing
3. Regression & Exponential Smoothing 3.1 Forecasting a Single Time Series Two main approaches are traditionally used to model a single time series z 1, z 2,..., z n 1. Models the observation z t as a
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationGeometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationError estimates for nearly degenerate finite elements
Error estimates for nearly degenerate finite elements Pierre Jamet In RAIRO: Analyse Numérique, Vol 10, No 3, March 1976, p. 43 61 Abstract We study a property which is satisfied by most commonly used
More informationInequalities of Analysis. Andrejs Treibergs. Fall 2014
USAC Colloquium Inequalities of Analysis Andrejs Treibergs University of Utah Fall 2014 2. USAC Lecture: Inequalities of Analysis The URL for these Beamer Slides: Inequalities of Analysis http://www.math.utah.edu/~treiberg/inequalitiesslides.pdf
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationSolutions for Math 311 Assignment #1
Solutions for Math 311 Assignment #1 (1) Show that (a) Re(iz) Im(z); (b) Im(iz) Re(z). Proof. Let z x + yi with x Re(z) and y Im(z). Then Re(iz) Re( y + xi) y Im(z) and Im(iz) Im( y + xi) x Re(z). () Verify
More informationAn Introduction to Partial Differential Equations in the Undergraduate Curriculum
An Introduction to Partial Differential Equations in the Undergraduate Curriculum J. Tolosa & M. Vajiac LECTURE 11 Laplace s Equation in a Disk 11.1. Outline of Lecture The Laplacian in Polar Coordinates
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationLecture 17: Conformal Invariance
Lecture 17: Conformal Invariance Scribe: Yee Lok Wong Department of Mathematics, MIT November 7, 006 1 Eventual Hitting Probability In previous lectures, we studied the following PDE for ρ(x, t x 0 ) that
More informationThe Advantages and Disadvantages of Online Linear Optimization
LINEAR PROGRAMMING WITH ONLINE LEARNING TATSIANA LEVINA, YURI LEVIN, JEFF MCGILL, AND MIKHAIL NEDIAK SCHOOL OF BUSINESS, QUEEN S UNIVERSITY, 143 UNION ST., KINGSTON, ON, K7L 3N6, CANADA E-MAIL:{TLEVIN,YLEVIN,JMCGILL,MNEDIAK}@BUSINESS.QUEENSU.CA
More informationMonte Carlo Simulation
1 Monte Carlo Simulation Stefan Weber Leibniz Universität Hannover email: sweber@stochastik.uni-hannover.de web: www.stochastik.uni-hannover.de/ sweber Monte Carlo Simulation 2 Quantifying and Hedging
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationTHE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:
THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationMATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...
MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................
More informationTHE REMEZ ALGORITHM FOR TRIGONOMETRIC APPROXIMATION OF PERIODIC FUNCTIONS
THE REMEZ ALGORITHM FOR TRIGONOMETRIC APPROXIMATION OF PERIODIC FUNCTIONS MOHSIN JAVED AND LLOYD N. TREFETHEN Abstract. In this paper we present an implementation of the Remez algorithm for trigonometric
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationFUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples First recall the basic definitions regarding operators. Definition 1.1 (Continuous
More informationSolutions to old Exam 1 problems
Solutions to old Exam 1 problems Hi students! I am putting this old version of my review for the first midterm review, place and time to be announced. Check for updates on the web site as to which sections
More informationEfficiency and the Cramér-Rao Inequality
Chapter Efficiency and the Cramér-Rao Inequality Clearly we would like an unbiased estimator ˆφ (X of φ (θ to produce, in the long run, estimates which are fairly concentrated i.e. have high precision.
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationRESEARCH STATEMENT AMANDA KNECHT
RESEARCH STATEMENT AMANDA KNECHT 1. Introduction A variety X over a field K is the vanishing set of a finite number of polynomials whose coefficients are elements of K: X := {(x 1,..., x n ) K n : f i
More informationMessage-passing sequential detection of multiple change points in networks
Message-passing sequential detection of multiple change points in networks Long Nguyen, Arash Amini Ram Rajagopal University of Michigan Stanford University ISIT, Boston, July 2012 Nguyen/Amini/Rajagopal
More informationChoice under Uncertainty
Choice under Uncertainty Part 1: Expected Utility Function, Attitudes towards Risk, Demand for Insurance Slide 1 Choice under Uncertainty We ll analyze the underlying assumptions of expected utility theory
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationEstimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 2010-2011 School Year The timeframes listed on this calendar are estimates based on a fifty-minute class period. You may need to adjust some of them from time to
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationThis is the second in a series of two papers investigating the solitary wave solutions of the integrable model wave equation
CONVERGENCE OF SOLITARY-WAVE SOLUTIONS IN A PERTURBED BI-HAMILTONIAN DYNAMICAL SYSTEM. II. COMPLEX ANALYTIC BEHAVIOR AND CONVERGENCE TO NON-ANALYTIC SOLUTIONS. Y. A. Li 1 and P. J. Olver 1, Abstract. In
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationa. all of the above b. none of the above c. B, C, D, and F d. C, D, F e. C only f. C and F
FINAL REVIEW WORKSHEET COLLEGE ALGEBRA Chapter 1. 1. Given the following equations, which are functions? (A) y 2 = 1 x 2 (B) y = 9 (C) y = x 3 5x (D) 5x + 2y = 10 (E) y = ± 1 2x (F) y = 3 x + 5 a. all
More informationOn the Eigenvalues of Integral Operators
Çanaya Üniversitesi Fen-Edebiyat Faültesi, Journal of Arts and Sciences Say : 6 / Aral 006 On the Eigenvalues of Integral Operators Yüsel SOYKAN Abstract In this paper, we obtain asymptotic estimates of
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More informationNOV - 30211/II. 1. Let f(z) = sin z, z C. Then f(z) : 3. Let the sequence {a n } be given. (A) is bounded in the complex plane
Mathematical Sciences Paper II Time Allowed : 75 Minutes] [Maximum Marks : 100 Note : This Paper contains Fifty (50) multiple choice questions. Each question carries Two () marks. Attempt All questions.
More informationMICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL NIKOLAI TARKHANOV AND NIKOLAI VASILEVSKI
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationDot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product
Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationHedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15
Hedging Options In The Incomplete Market With Stochastic Volatility Rituparna Sen Sunday, Nov 15 1. Motivation This is a pure jump model and hence avoids the theoretical drawbacks of continuous path models.
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More information5 VECTOR GEOMETRY. 5.0 Introduction. Objectives. Activity 1
5 VECTOR GEOMETRY Chapter 5 Vector Geometry Objectives After studying this chapter you should be able to find and use the vector equation of a straight line; be able to find the equation of a plane in
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces
More informationVariance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers
Variance Reduction The statistical efficiency of Monte Carlo simulation can be measured by the variance of its output If this variance can be lowered without changing the expected value, fewer replications
More informationA General Approach to Variance Estimation under Imputation for Missing Survey Data
A General Approach to Variance Estimation under Imputation for Missing Survey Data J.N.K. Rao Carleton University Ottawa, Canada 1 2 1 Joint work with J.K. Kim at Iowa State University. 2 Workshop on Survey
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More information0.1 Phase Estimation Technique
Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design
More informationTo discuss this topic fully, let us define some terms used in this and the following sets of supplemental notes.
INFINITE SERIES SERIES AND PARTIAL SUMS What if we wanted to sum up the terms of this sequence, how many terms would I have to use? 1, 2, 3,... 10,...? Well, we could start creating sums of a finite number
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More information4. How many integers between 2004 and 4002 are perfect squares?
5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationAlgebraic and Transcendental Numbers
Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationON CERTAIN DOUBLY INFINITE SYSTEMS OF CURVES ON A SURFACE
i93 c J SYSTEMS OF CURVES 695 ON CERTAIN DOUBLY INFINITE SYSTEMS OF CURVES ON A SURFACE BY C H. ROWE. Introduction. A system of co 2 curves having been given on a surface, let us consider a variable curvilinear
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information