The Weierstrass Approximation Theorem
|
|
- Cathleen Wiggins
- 5 years ago
- Views:
Transcription
1 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined as the unknown roots of soe equation and when we cannot solve the equation explicitly, as is ost often the case, then we ust copute approxiate solutions. But even if we write down a real nuber sybolically, like 2, for exaple, we cannot specify its nuerical value copletely in general. In this case, we approxiate the real nuber to any desired accuracy using rational nubers with finite decial expansions. The situation for functions is copletely analogous. In general, functions that are specified as the solutions of differential equations cannot be written down explicitly in ters of known functions. Instead, we ust look for good approxiations. Moreover, ost of the functions that we can write down, i.e., those involving exp, log, sin, and so on, are coplicated in the sense that they take on real values that cannot be written down explicitly. To use these functions in practical coputations, we ust resort to using good approxiations of their values. Put it this way; when we press the e x key on a calculator, we do not get e x, rather we get a good approxiation. This raises one of the fundaental probles of analysis, which is figuring out how to approxiate a given function using sipler functions. In this chapter, we begin the study of this proble by proving a fundaental result which says that any continuous function can be approxiated arbitrarily well by polynoials. This is an iportant result because polynoials are relatively siple. In particular, a polynoial is specified copletely by a finite set of coefficients. In other words, the relatively siple polynoi-
2 The Weierstrass Approxiation Theore als play the sae role with respect to continuous functions that rational nubers play with real nubers. The result is due to Weierstrass and it states: Theore 36.1 Weierstrass Approxiation Theore Assue that f is continuous on a closed bounded interval I. Given any ɛ>0, there is a polynoial P n with sufficiently high degree n such that f(x P n (x <ɛfor a x b. (36.1 There are any different proofs of this result, but in keeping with our constructivist tendencies, we present a constructive proof based on Bernstein 1 polynoials. The otivation for this approach rests in probability theory. We do not have space in this book to develop probability theory, but we describe the connection in an intuitive way. Later in Chapter 37 and Chapter 38, we investigate other polynoial approxiations of functions that arise fro different considerations. Before beginning, we note that it suffices to prove Theore 36.1 for the interval [0, 1]. The reason is that the arbitrary interval a y b is apped to 0 x 1byx =(a y/(a b and vice versa by y =(b ax + a. Ifg is continuous on [a, b], then f(x =g((b ax + a is continuous on [0, 1]. If the polynoial P n of degree n approxiates f to within ɛ on [0, 1], then the polynoial P n (y =P n ((a y/(a b of degree n approxiates g(y to within ɛ on [a, b] The Binoial Expansion One ingredient needed to construct the polynoial approxiations is an iportant forula called the binoial expansion. For natural nubers 0 n, we define the binoial coefficient ( n,orn choose, by ( n = n!!(n!. Exaple ( 4 = 4! 2 2!2! =6, ( 6 = 6! 1 1!5! =6, ( 3 = 3! 0 3!0! =1 We can interpret n choose as the nuber of distinct subsets with eleents that can be chosen fro a set of n objects, or the nuber of cobinations of n objects taken at a tie. 1 The Russian atheatician Sergi Natanovich Bernstein ( studied in France before returning to Russia to work. He proved significant results in approxiation theory and probability.
3 36.1 The Binoial Expansion 511 Exaple We copute the probability P of getting an ace of diaonds in a poker hand of 5 cards chosen at rando fro a standard deck of 52 cards. Recall the forula P( event = probability of an event = nuber of outcoes in the event total nuber of possible outcoes that holds if all outcoes are equally likely. The total nuber of 5 card poker hands is ( Obtaining a good hand aounts to choosing any 4 cards fro the reaining 51 cards after getting an ace of diaonds. So there are ( 51 4 good hands. This eans ( 51 4 P = = 51! 5!47! = 5 4!47! 52! 52. ( 52 5 It is straightforward (Proble 36.3 to show the following identities, ( ( ( ( ( ( n n n n n n =, =, = =1. (36.2 n 1 n 1 n 0 An iportant application of the binoial coefficient is the following theore. Theore 36.2 Binoial Expansion For any natural nuber n, Exaple (a + b n = n (a + b 2 = a 2 +2ab + b 2 (a + b 3 = a 3 +3a 2 b +3ab 2 + b 3 ( n a b n. (36.3 (a + b 4 = a 4 +4a 3 b +6a 2 b 2 +4ab 3 + b 4 The proof is by induction. For n =1, ( ( 1 1 (a + b 1 = a + b = a + b. 0 1 We assue the forula is true for n 1, so that (a + b n 1 = and prove it holds for n. n 1 ( n 1 a b n 1,
4 The Weierstrass Approxiation Theore We ultiply out (a + b n =(a + b(a + b n 1 n 1 ( n 1 = Now changing variables in the su, while Hence, n 1 ( n 1 n 1 ( n 1 (a + b n = a 0 b n + a +1 b n 1 = a +1 b n 1 + n 1 =1 a b n = a 0 b n + n 1 =1 (( n n 1 ( n 1 a b n. ( n 1 a b n + a n b 0, 1 n 1 =1 ( n 1 ( n 1 a b n. a b n + a n b 0. (36.4 It is a good exercise (Proble 36.5 to show that ( ( ( n 1 n 1 n + =. ( Using this in (36.4 proves the result. We use the binoial expansion to drive two other useful forulas. We differentiate both sides of n ( n (x + b n = x b n (36.6 to get n(x + b n 1 = n ( n x 1 b n. Setting x = a and ultiplying through by a/n, a(a + b n 1 = n Differentiating (36.6 twice (Proble 36.6 gives ( 1 1 a 2 (a + b n 2 = n n n ( 2 ( n a b n. (36.7 n 2 n 2 ( n a b n. (36.8
5 36.2 The Law of Large Nubers 36.2 The Law of Large Nubers 513 The approxiating polynoials used to prove Theore 36.1 are constructed by taking linear cobinations of ore eleentary polynoials called binoial polynoials. In this section, we explore the properties of the binoial polynoials and their connection to probability. We set a = x and b =1 x in the binoial expansion (36.3 to get n ( n 1=(x +(1 x n = x (1 x n. (36.9 We define the +1binoial polynoials of degree n as the ters in the expansion, so ( n p n, (x = x (1 x n, =0, 1,,n. Exaple ( 2 p 2,0 (x = x 0 (1 x 2 =(1 x 2 0 ( 2 p 2,1 (x = x 1 (1 x 1 =2x(1 x 1 ( 2 p 2,2 (x = x 2 (1 x 0 = x 2 2 If 0 x 1 is the probability of an event E, then p n, (x isthe probability that E occurs exactly ties in n independent trials. Exaple In particular, consider tossing an coin with probability x that a head (H occurs and, correspondingly, probability 1 x that a tail (T occurs. The coin is unfair if x 1/2. The probability of the occurrence of a particular sequence of n tosses containing heads, e.g., } HTTHHTHTHTTHHHTHTHTTT {{ T }, heads in n tosses ( is x (1 x n by the ultiplication rule for probabilities. There are n sequences of n tosses with exactly heads. By the addition rule for probabilities, p n, (x is the probability of getting exactly heads in n tosses. The binoial polynoials have several useful properties, soe of which follow directly fro the connection to probability. For exaple, we interpret n p n, (x = 1 (36.10
6 The Weierstrass Approxiation Theore as saying that event E with probability x occurs either exactly 0, 1,,or n ties in n independent trials with probability 1. Since p n, (x 0 for 0 x 1, (36.10 iplies that 0 p n, (x 1 for 0 x 1, as it ust since it is a probability. A couple ore useful properties: (36.7 iplies and (36.8 iplies n p n, (x =nx (36.11 n 2 p n, (x =(n 2 nx 2 + nx. (36.12 An iportant use of the binoial polynoials is an application to the Law of Large Nubers. Suppose we have an event E that has probability x of occurring, such as the unfair coin fro Exaple But suppose we don t know the probability. How ight we deterine x? If we conduct a single trial, e.g., flip the coin once, we ight see event E or ight not. One trial does not give uch inforation for deterining x. However, if we conduct a large nuber n 1 of trials, then intuition suggests that E should occur approxiately nx ties out of n trials, at least ost of the tie. Exaple The connection between the probability of occurrence in one trial and the frequency of occurrence in any trials is not copletely straightforward to deterine. Consider coin tossing again. If we flip a fair coin 100, 000 ties, we expect to see around 50, 000 heads ost of the tie. Of course, we could be very unlucky and get all tails. But the probability of this occurring is ( On the other hand, it is also unlikely that we will see heads in exactly half of the tosses. In fact, one can show that the probability of getting heads exactly half of the tie is approxiately 1/ πn for n large, and therefore also goes to zero as n increases. A Law of Large Nubers encapsulates in soe way the intuitive connection between the probability of an event occurring in one trial and the frequency that the event occurs in a large nuber of trials. A atheatical expression of this intuition is a little tricky to state, however, as we saw in Exaple We prove the following version that is originally due to Jacob Bernoulli.
7 36.2 The Law of Large Nubers 515 Theore 36.3 Law of Large Nubers Assue that event E occurs with probability x and let denote the nuber of ties E occurs in n trials. Let ɛ>0 and δ>0 be given. The probability that /n differs fro x by less than δ is greater than 1 ɛ, i.e., ( P n x <δ > 1 ɛ, (36.13 for all n sufficiently large. Note that we can choose ɛ>0 and δ>0arbitrarily sall at the cost of aking n possibly very large, hence the nae of the theore. Also note that while this result says that it is likely that event E will occur approxiately xn ties in n trials, it does not say that event E will occur exactly xn ties in n trials nor does it say that event E ust occur approxiately xn ties in n trials. Thus, this result does not contradict the coputations in Exaple Phrased in ters of the binoial polynoials, we want to show that given ɛ, δ>0, p n, (x > 1 ɛ ( n n x <δ for n sufficiently large. Consider the copleentary su p n, (x =1 0 n n x δ which we estiate siply as p n, (x 1 δ 2 0 n n x δ where S n = = n ( nx 2 p n, (x n 2 p n, (x 2nx 0 n n x δ 0 n n x <δ p n, (x, ( n x 2 pn, (x 1 n 2 δ 2 S n n p n, (x+n 2 x 2 n p n, (x. (36.15 Using (36.10, (36.11, and (36.12, we find S n siplifies (Proble 36.9 to S n = nx(1 x. Since x(1 x 1/4 for 0 x 1, S n n/4. Therefore, p n, (x 1 4nδ 2 ( n n x δ
8 The Weierstrass Approxiation Theore and p n, (x 1 1 4nδ 2. 0 n n x <δ In particular, for fixed ɛ, δ>0, we can insure that (4nδ 2 1 <ɛby choosing n>1/(4δ 2 ɛ The Modulus of Continuity In order to prove a strong version of Theore 36.1, we introduce a useful generalization of Lipschitz continuity. First note that by Theore 32.11, the continuous function f on [a, b] in Theore 36.1 is actually uniforly continuous on [a, b]. That is given ɛ>0 there is a δ>0 such that f(x f(y <ɛfor all x, y in [a, b] with x y < δ. 2 Now a Lipschitz continuous function f with constant L is uniforly continuous because f(x f(y L x y <ɛfor all x, y with x y <δ= ɛ/l. On the other hand, uniforly continuous functions are not necessarily Lipschitz continuous. They do, however, satisfy a generalization of the condition that defines Lipschitz continuity called the odulus of continuity. The generalization is based on the observation that if f is uniforly continuous on a closed, bounded interval I =[a, b], then for any δ>0, the set of nubers { f(x f(y with x, y in I, x y <δ} (36.17 is bounded. Otherwise, f could not be uniforly continuous (Proble But, Theore then iplies that the set of nubers (36.17 has a least upper bound. Turning this around, we define the odulus of continuity ω(f,δ of a general function f on a general interval I by ω(f,δ = sup { f(x f(y }. x,y in I x y <δ Note that ω(f,δ = if the set (36.17 is not bounded. We can guarantee that ω(f,δ is finite if f is uniforly continuous and I is a closed interval, but if f is not uniforly continuous and/or I is open or unbounded, then ω(f,δ ight be infinite. Exaple We know x 2 is uniforly continuous on [0, 1]. Now consider the difference x 2 y 2 = x y x + y, where x y <δ. 2 Unifority refers to the fact that δ can be chosen independently of x and y.
9 36.4 The Bernstein Polynoials 517 The values of x y increases onotonically fro 0 to δ, while the corresponding largest values of x + y decrease onotonically fro 2 to 2 δ. The largest value of their product occurs when x y = δ so that ω(x 2,δ=2δ δ 2. Exaple ω(x 1,δon(0, 1 is infinite. Exaple ω(sin(x 1,δ = 2 on (0, 1 since for any δ>0wecan find x and y within δ of 0, and hence within δ of each other, such that sin(x 1 = 1 and sin(y 1 = 1. Note that the functions in Exaple 36.8 and Exaple 36.9 are not uniforly continuous on the indicated intervals. In fact, if f is uniforly continuous on [a, b], then ω(f,δ 0asδ 0 (Proble If f is Lipschitz continuous on [a, b] with constant L, then ω(f,δ Lδ. In this sense, the odulus of continuity is a generalization of the idea of Lipschitz continuity The Bernstein Polynoials To construct the approxiating polynoial, we partition [0, 1] by a unifor esh with n + 1 nodes x = n, =0,,n. The Bernstein polynoial of degree n for f on [0, 1] is B n (f,x =B n (x = n f(x p n, (x. (36.18 Note that the degree of B n is at ost n. The reason that the Bernstein polynoials becoe increasingly accurate approxiations as the degree n increases is rather intuitive. The forula for B n (x decoposes into two sus, B n (x = f(x p n, (x+ f(x p n, (x. x x x x large The first su converges to f(x asn becoes large, since we can find nodes x = /n arbitrarily close to x by taking n large. 3 The second su converges to zero by the Law of Large Nubers. This is exactly what we prove below. Before stating a convergence result, we consider a couple of exaples. 3 Recall that any real nuber can be approxiated arbitrarily well by rational nubers.
10 The Weierstrass Approxiation Theore Exaple n 2 is given by The Bernstein polynoial B n for x 2 on [0, 1] with B n (x = n ( 2 pn, (x. n By (36.12, this eans ( B n (x = 1 1 x n n x = x2 + 1 x(1 x. n We see that B n (x 2,x x 2 and in fact the error decreases like 1/n as n increases. x 2 B n (x = 1 x(1 x n Exaple We copute B 1, B 2, and B 3 for f(x =e x on [0, 1], B 1 (x =e 0 (1 x+e 1 x =(1 x+ex B 2 (x =(1 x 2 +2e 1/2 x(1 x+ex 2 B 3 (x =(1 x 3 +3e 1/2 x(1 x 2 +3e 2/3 x 2 (1 x+ex 3. We plot these functions in Fig exp(x B 1 (x B 2 (x B 3 (x x FIGURE The first three Bernstein polynoials for e x. We prove: Theore 36.4 Bernstein Approxiation Theore Let f beacon- tinuous function on [0, 1] and n 1 a natural nuber. Then f(x B n (f,x 9 4 ω(f,n 1/2. (36.19
11 If f is Lipschitz continuous with constant L, then 36.4 The Bernstein Polynoials 519 f(x B n (f,x 9 4 Ln 1/2. (36.20 Theore 36.1 follows iediately since for ɛ>0, we siply choose n sufficiently large so that f(x B n (f,x 9 4 ω(f,n 1/2 <ɛ. Using (36.10, we write the error as a su involving the differences between f(x and the values of f at the nodes: f(x B n (x = = n f(xp n, (x n f(x p n, (x n (f(x f(x p n, (x We expect that the differences f(x f(x should be sall when x is close to x by the continuity of f. To take advantage of this, for δ>0, we split the su into two parts f(x B n (x = (f(x f(x p n, (x 0 n x x <δ + 0 n x x δ (f(x f(x p n, (x. (36.21 The first su is sall by the continuity of f, since (f(x f(x p n, (x f(x f(x p n, (x 0 n x x <δ 0 n x x <δ ω(f,δ ω(f,δ n 0 n x x <δ p n, (x n p n, (x =ω(f,δ. We can get a crude bound on the second su in (36.21 easily. Since f is continuous on [0, 1] there is a constant C such that f(x C for 0 x 1. Therefore, 0 n x x δ (f(x f(x p n, (x 2C 0 n x x δ p n, (x C nδ 2
12 The Weierstrass Approxiation Theore by ( So we can ake the second su as sall as desired by taking n large. To get a sharper estiate on the second su in (36.21, we use a trick siilar to that used to prove Theore We let M be the largest integer less than or equal to x x /δ and choose M uniforly spaced points y 1,y 2,,y M in the interval spanned by x and x so that each of the resulting M + 1 intervals have length x x /(M +1<δ. Now, we can write f(x f(x =(f(x f(y 1 +(f(y 1 f(y 2 + +(f(y M f(x. Therefore, f(x f(x (M +1ω(f,δ We use this to estiate the second su in (36.21, (f(x f(x p n, (x 0 n x x δ ( ω(f,δ 0 n x x δ p n, (x+ 1 δ Using the fact that x x /δ = M 1, (f(x f(x p n, (x 0 n x x δ ( ω(f,δ 0 n x x δ p n, (x+ 1 δ 2 ( n ω(f,δ p n, (x+ 1 δ 2 ( ω(f,δ nδ 2 ( 1+ x x ω(f,δ. δ n 0 n x x δ 0 n x x δ x x p n, (x. (x x 2 p n, (x (x x 2 p n, (x by (36.11 and ( So ( (f(x f(x p n, (x ω(f,δ nδ 2 0 n x x δ.
13 36.5 Accuracy and Convergence 521 Putting the estiates on the sus back into (36.21, ( f(x B n (x ω(f,δ nδ 2. Setting δ = n 1/2 proves the theore Accuracy and Convergence We can interpret Theore 36.4 as saying that the Bernstein polynoials {B n (f,x} converge uniforly to f(x on[0, 1] as n. In other words, the errors of the Bernstein polynoials B n for a given function f on [0, 1] tend to zero as n increases. This is a strong property; unfortunately, the price is that the convergence is very slow in general. Exaple To deonstrate how slowly the Bernstein polynoials can converge, we plot the Bernstein polynoial of degree 4 for sin(πx on[0, 1] in Fig sin(x B 4 (x x FIGURE A plot of the Bernstein polynoial B 4(x for sin(πx. If the error bound in (36.19 is accurate, i.e., f(x B n (x 9 4 ω(f,n 1/2 Cn 1/2 for soe constant C, then we have to increase n by a factor of 100 in order to see an iproveent of 10 (one additional digit of accuracy in the error. This follows because fro the coputation f(x B n1 (x f(x B n2 (x n 1/2 1 =10 1 n 1/2 2
14 The Weierstrass Approxiation Theore we need n 2 = 100n 1. The error can decrease ore quickly in soe cases. Above, we saw that the error for x 2 decreases like 1/n. But even this is relatively slow copared to soe other polynoial approxiations and for this reason the Bernstein polynoials are not often encountered in practice Unanswered Questions We have shown that continuous functions can be approxiated by polynoials. But we have not really explained why polynoials are well-suited for approxiating functions. In other words, what are the properties of polynoials that ake the good approxiations? Are there other sets of functions that have siilar approxiation properties? Atkinson [2], Isaacson and Keller [15], and Rudin [19] have interesting aterial on these topics.
15 36.6 Unanswered Questions 523 Chapter 36 Probles Evaluate ( Explain the clai that be arranged in groups of Prove ( Expand (a + b Prove ( Prove ( Verify ( ( n gives the nuber of ways that n objects can Deterine a forula for the probability of getting exactly n/2 heads when tossing a fair coin n ties, where n is even. Make a plot of the forula for a n in the range of 1 to 100 and test the clai that it approaches πn for n large Prove that S n defined in (36.15 is equal to S n = nx(1 x. Probles have to do with the odulus of continuity. Several of the proofs in this book could be generalized by using the odulus of continuity instead of Lipschitz continuity Prove that if f is uniforly continuous on [a, b], then for any δ>0 the set of nubers (36.17 is bounded Evaluate (a ω(x 2,δon[0, 2] (b ω(1/x, δ on[1, 2] (b ω(log(x,δon[1, 2] Verify Exaple Verify Exaple Prove that if f is uniforly continuous on [a, b], then ω(f,δ 0as δ Prove that if f has a continuous derivative on [a, b], then ω(f, δ ax [a,b] f δ. Coputing Bernstein polynoial approxiations can be tedious. You ight want to use MAPLE c, for exaple, to do Probles Copute forulas for p 3,, =0, 1, 2, 3.
16 The Weierstrass Approxiation Theore Verify the coputations in Exaple Copute the Bernstein polynoials for x on [0, 1] Copute and plot the Bernstein polynoials for exp(x on[1, 3] of degree 1, 2, and (a Copute a suation forula for the Bernstein polynoial for x 3 on [0, 1] for degree 3. (b Find an explicit forula for the Bernstein polynoial fro (a that does not involve suation. (c Write down a forula for the error Copute and plot the Bernstein polynoials for sin(πx on[0, 1] of degree 1, 2, 3, and 4. We have shown that the Bernstein polynoials approxiate a differentiable function, which is continuous of course, uniforly well. In Proble 36.22, we ask you to show that the derivative of the function is also approxiated by the derivatives of the function s Bernstein polynoials If f(x has a continuous first derivative in [0, 1], prove that the derivatives of the Bernstein polynoials {P n(f,x} converge uniforly to f (x on[0, 1]. Hint: First, verify the forulas p n, = n(p n 1, 1 p n 1, for =1,, 1 p n,n = np n 1,n 1, p n,0 = np n 1,0. Then find a suation forula for the error f (x P n(x and rearrange the su in ters of p n 1, for =0, 1,,n If f is continuous on [0, 1] and if 1 0 f(xx n dx = 0 for n =0, 1, 2,,, then prove that f(x = 0 for 0 x 1. Hint: This says that the integral of the product of f and any polynoial is zero. Use Theore 36.1 to first prove that 1 0 f 2 (x dx =0. We say that the real nubers R are separable because any real nuber can be approxiated to arbitrary accuracy by a rational nuber. The analogous property holds for the space of continuous functions on a closed, bounded interval, which is the content of the theore we ask you to prove in Proble Prove the following extension of the Weierstrass Approxiation Theore: Theore 36.5 Assue that f is continuous on a closed bounded interval I. Given any ɛ>0, there is a polynoial P n with rational coefficients with finite decial expansions and of sufficiently high degree n such that f(x P n(x <ɛfor a x b. Hint: Use Theore 36.1 to first get an approxiate polynoial and then analyze the effect of replacing its coefficients by rational approxiations.
17
13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More information16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437
cs-ftl 010/9/8 0:40 page 431 #437 16 Independence 16.1 efinitions Suppose that we flip two fair coins siultaneously on opposite sides of a roo. Intuitively, the way one coin lands does not affect the way
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationHermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s
International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationA RECURRENCE RELATION FOR BERNOULLI NUMBERS. Mümün Can, Mehmet Cenkci, and Veli Kurt
Bull Korean Math Soc 42 2005, No 3, pp 67 622 A RECURRENCE RELATION FOR BERNOULLI NUMBERS Müün Can, Mehet Cenci, and Veli Kurt Abstract In this paper, using Gauss ultiplication forula, a recurrence relation
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationComputable Shell Decomposition Bounds
Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung
More informationBeyond Mere Convergence
Beyond Mere Convergence Jaes A. Sellers Departent of Matheatics The Pennsylvania State University 07 Whitore Laboratory University Park, PA 680 sellers@ath.psu.edu February 5, 00 REVISED Abstract In this
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationSome Perspective. Forces and Newton s Laws
Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationResearch Article Rapidly-Converging Series Representations of a Mutual-Information Integral
International Scholarly Research Network ISRN Counications and Networking Volue 11, Article ID 5465, 6 pages doi:1.54/11/5465 Research Article Rapidly-Converging Series Representations of a Mutual-Inforation
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More information13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization
3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationEgyptian Mathematics Problem Set
(Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3
More informationUSEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta
1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve
More informationLectures 8 & 9: The Z-transform.
Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationMax-Product Shepard Approximation Operators
Max-Product Shepard Approxiation Operators Barnabás Bede 1, Hajie Nobuhara 2, János Fodor 3, Kaoru Hirota 2 1 Departent of Mechanical and Syste Engineering, Bánki Donát Faculty of Mechanical Engineering,
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationNB1140: Physics 1A - Classical mechanics and Thermodynamics Problem set 2 - Forces and energy Week 2: November 2016
NB1140: Physics 1A - Classical echanics and Therodynaics Proble set 2 - Forces and energy Week 2: 21-25 Noveber 2016 Proble 1. Why force is transitted uniforly through a assless string, a assless spring,
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationIntroduction to Optimization Techniques. Nonlinear Programming
Introduction to Optiization echniques Nonlinear Prograing Optial Solutions Consider the optiization proble in f ( x) where F R n xf Definition : x F is optial (global iniu) for this proble, if f( x ) f(
More informationMath Real Analysis The Henstock-Kurzweil Integral
Math 402 - Real Analysis The Henstock-Kurzweil Integral Steven Kao & Jocelyn Gonzales April 28, 2015 1 Introduction to the Henstock-Kurzweil Integral Although the Rieann integral is the priary integration
More informationSampling How Big a Sample?
C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationMoment of Inertia. Terminology. Definitions Moment of inertia of a body with mass, m, about the x axis: Transfer Theorem - 1. ( )dm. = y 2 + z 2.
Terinology Moent of Inertia ME 202 Moent of inertia (MOI) = second ass oent Instead of ultiplying ass by distance to the first power (which gives the first ass oent), we ultiply it by distance to the second
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationIterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel
1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution
More informationWhat is Probability? (again)
INRODUCTION TO ROBBILITY Basic Concepts and Definitions n experient is any process that generates well-defined outcoes. Experient: Record an age Experient: Toss a die Experient: Record an opinion yes,
More informationTight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions
Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805
More informationComputable Shell Decomposition Bounds
Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More information1. INTRODUCTION AND RESULTS
SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationA Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science
A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest
More informationSolutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes.
Solutions 1 Exercise 1.1. See Exaples 1.2 and 1.11 in the course notes. Exercise 1.2. Observe that the Haing distance of two vectors is the iniu nuber of bit flips required to transfor one into the other.
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationNow multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:
Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationBinomial and Poisson Probability Distributions
Binoial and Poisson Probability Distributions There are a few discrete robability distributions that cro u any ties in hysics alications, e.g. QM, SM. Here we consider TWO iortant and related cases, the
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationRAFIA(MBA) TUTOR S UPLOADED FILE Course STA301: Statistics and Probability Lecture No 1 to 5
Course STA0: Statistics and Probability Lecture No to 5 Multiple Choice Questions:. Statistics deals with: a) Observations b) Aggregates of facts*** c) Individuals d) Isolated ites. A nuber of students
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More informationSUSAN M. PITTS ABSTRACT
A FUNCTIONAL APPROACH TO APPROXIMATIONS FOR THE INDIVIDUAL RISK MODEL BY SUSAN M. PITTS ABSTRACT A functional approach is taken for the total clai aount distribution for the individual risk odel. Various
More informationSaddle Points in Random Matrices: Analysis of Knuth Search Algorithms
Saddle Points in Rando Matrices: Analysis of Knuth Search Algoriths Micha Hofri Philippe Jacquet Dept. of Coputer Science INRIA, Doaine de Voluceau - Rice University Rocquencourt - B.P. 05 Houston TX 77005
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationCHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS Nicholas Wage Appleton East High School, Appleton, WI 54915, USA
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationVC Dimension and Sauer s Lemma
CMSC 35900 (Spring 2008) Learning Theory Lecture: VC Diension and Sauer s Lea Instructors: Sha Kakade and Abuj Tewari Radeacher Averages and Growth Function Theore Let F be a class of ±-valued functions
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationOn the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs
On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More information