Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0

Size: px
Start display at page:

Download "Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0"

Transcription

1 Advanced Finite Elements MA WS7/8 Solution sheet This exercise sheets deals with B-slines and NURBS, which are the basis of isogeometric analysis as they will later relace the olynomial ansatz-functions from standard finite elements. In the first exercise we will ractice how to construct B-sline functions (of higher order) and how the relevant quantities like number of degrees of freedom, knots, and sline order are linked. In the second exercise we rove some elementary roerties of B-sline functions, that will be useful later on. Exercise three then introduces B-sline curves, how they are formed and how they can be maniulated. In exercise four we finally see how a circle can be reresented exactly within the isogeometric framework using a NURBS-arametrization. Exercise 3 (Constructing B-sline basisfunctions) Given a knot vector Ξ = (ξ, ξ,..., ξ n++ ) R n++ with ξ i ξ j for i j the B-sline basis functions of degree N are defined for i =,..., n as follows: B-sline basis functions: N i, (ξ) := N i, (ξ) := { ξi ξ < ξ i+ otherwise ξ ξ i N i, (ξ) + ξ i++ ξ N i+, (ξ) () ξ i+ ξ i ξ i++ ξ i+ where := We only consider oen knot vectors Ξ, i.e. the first + and last + knots coincide ξ =... = ξ + and ξ n+ =... = ξ n++. a) Give a formula for the number of basis functions of degree that are created by such an oen knot vector with Ξ = K knots in total. b) Usually the first + reeated knots in the knot vector are set to, the last + reeated ones to. How many interior knots are necessary (e.g. equally distributed in the interval (, )) to get a total of n basis functions of degree? c) For the concrete knot vector Ξ = (,,, 3, 3,,, ) sketch the basis functions of degree =,,.

2 Solution 3 a) If K is the total number of knots in the knot vector, we comare with the definition of knot vectors and set K = n + +, where n is the number of basis functions and their degree. Hence n = K basis functions of degree can be created from the knot vector. b) If k denotes the number of interior knots, we can add these together with the first + and last + reeated ones to have a total of K = k + ( + ) knots. Now using the formula from a) we get k + ( + ) = K = n + + and hence k = n. c) The basis-functions of degree zero are constructed trivially. Here it is only imortant not to forget also the ones that are identically zero, like e.g. N, (ξ) which would only be not zero for ξ [ξ, ξ ) but this interval is emty due to ξ = ξ, hence N, (ξ). The basis functions of degree one again start with a constant zero function, since N, is a combination of N, and N, which are both zero. From there on one always combines the ξ ξ i ξ i+ ξ i iecewise constant functions of degree zero with the terms of () giving iecewise linear hat-functions known from classical finite element theory. For the quadratic basis-functions one now starts from the linear hat-functions and again multilies them with terms, yielding iecewise quadratic functions. ξ ξ i ξ i+ ξ i Fig. : B-sline basis of left: degree, middle: degree, right: degree, each for the node vector (,,,,,,, ). 3 3 We give the analytical exressions for the first basis-functions of each degree: degree degree degree N, (ξ) N, (ξ) N, (ξ) = ( 3ξ) χ [,/3) (ξ) N, (ξ) N 3, (ξ) = χ [,/3) (ξ) N, (ξ) = ( 3ξ) χ [,/3) (ξ) N, (ξ) = 3ξ( 3ξ)χ [,/3) (ξ)+ N 3, (ξ) = 3ξχ [,/3) (ξ)+ ( 3ξ)3ξχ [,/3) (ξ)+ N 4, (ξ) = χ [/3,/3) (ξ) ( 3ξ)χ [/3,/3) (ξ) ( 3ξ) χ [/3,/3) (ξ)... If you want to lay around with different knot vectors and degrees, you can find the MATLAB-file draw_b_sline_basis.m on the lecture homeage. It is a function that accets a knot vector and a degree as an inut and lots the B-sline basis-functions of

3 that knot-vector u to the given degree. The ictures above can be recreated using: N = draw_b_sline_basis ([,,,/3,/3,,,], ); The function is nothing else but a direct imlementation of formula (), where secial attention has to be aid to the / := -cases. Exercise 3 (Proerties of B-Sline basis functions) Proof the following roerties of the B-sline basis functions with oen knot vectors. a) Their suort always covers + knot-sans, i.e. su(n i, ) = [ξ i, ξ i++ ]. b) They form a artition of unity: N i, (ξ) on the interval [ξ +, ξ n+ ]. i= c ) Where defined, for the derivatives of the B-sline basis functions there holds: B-sline derivative formula: d dξ N i,(ξ) = ξ i+ ξ i N i, (ξ) ξ i++ ξ i+ N i+, (ξ) () d ) At knot ξ i the basis functions are m i times continuously differentiable, where m i states how often ξ i aears in the knot vector (knot multilicity). e ) If m i for some knot ξ i only the basis function N i, (take i to be the number of the last reetition of the reeated knot, for examle if ξ 3 = ξ 4 = ξ 5 take i = 5) is taking the value at ξ i while all the others are there (interolatory roerty). Solution 3 Since the B-sline basis functions are defined in a recursive way, induction over is the method of choice to rove those roerties: a) For = the claim holds by definition. Assuming it holds for one sees by induction: N i, (ξ) := ξ ξ i ξ i+ ξ i }{{} in (ξ i,ξ +i ) N i, (ξ) }{{} has su =[ξ i,ξ +i ] + ξ i++ ξ ξ i++ ξ i+ }{{} in (ξ i+,ξ i++ ) N i+, (ξ) }{{} has su =[ξ i+,ξ i++ ] Hence su(n i, ) = [ξ i, ξ i++ ]. Here we have excluded the degenerated case of the suort being the emty set, e.g. for the first degree basis function in an oen not vector. b) Obviously the claim holds for =, hence we assume it to hold for and do the induction ste ( ). Using the recursive definition of the basis functions and 3

4 reordering the terms within the sum by an index shift gives: ξ ξ i N i, (ξ) = N i, (ξ) + ξ i= i= i+ ξ i = ξ ξ ξ + ξ N, (ξ) + = ξ ξ + ξ + ξ i= ξ i++ ξ ξ i++ ξ i+ N i+, (ξ) ξ ξ i ξ i+ ξ i N i, (ξ) + ξ i+ ξ ξ i+ ξ i N i, (ξ) i= i= + ξ n++ ξ N n+, (ξ) ξ n++ ξ n+ = ξ ξ N, (ξ) + N i, (ξ) + ξ n++ ξ N n+, (ξ) ξ + ξ ξ i= n++ ξ n+ }{{} = N, N n+, ( ) ( ) ξ ξ ξn++ ξ = + N, (ξ) + N n+, (ξ) ξ + ξ ξ n++ ξ n+ }{{}}{{} = ξ n+ ξ ξ n++ ξ n+ = + (ξ ξ ) N, (ξ) ξ + ξ }{{} = +(ξ n+ ξ) N n+, (ξ) ξ n++ ξ n+ }{{} = The last two underbraces are zero due to the definition of := and the fact that in an oen knot vector ξ = ξ +, ξ n+ = ξ n++ and also N, N n+,. If the knot vector is not oen, the artition of unity roerty only holds on the interval [ξ +, ξ n+ ], where the suort of N, has already ended (due to a)) and the suort of N n+, has not yet started (also due to a)) and hence the terms are again zero. c) Again we will use induction over the degree from ( ). For = the basis functions are iecewise constant and hence their derivative (where defined) is constant zero, which is also the case in the claimed formula when setting =. To do the induction ste from ( ) to we roceed from both sides and in the end find the equality sign in between..) First we differentiate () by using the roduct rule: d dξ N i,(ξ) = ξ i+ ξ i N i, (ξ) + ξ ξ i d ξ i+ ξ i dξ N i, (ξ) = N i+, (ξ) + ξ i++ ξ d ξ i++ ξ i+ ξ i++ ξ i+ dξ N i+, (ξ) By the induction remise for degree we know that: d dξ N i, (ξ) = N i, (ξ) N i+, (ξ) ξ i+ ξ i ξ i+ ξ i+ d dξ N i+, (ξ) = ξ i+ ξ i+ N i+, (ξ) ξ i++ ξ i+ N i+, (ξ) 4

5 which we substitute into the resective terms from above to arrive at: d dξ N i,(ξ) = ξ ξ ( ) i N i, (ξ) ξ i+ ξ i ξ i+ ξ i ξ ξ ( ) i N i+, (ξ) ξ i+ ξ i ξ i+ ξ i+ + ξ ( ) i++ ξ N i+, (ξ) ξ i++ ξ i+ ξ i+ ξ i+ ξ ( ) i++ ξ N i+, (ξ) ξ i++ ξ i+ ξ i++ ξ i+ + N i, (ξ) N i+, (ξ) ξ i+ ξ i ξ i++ ξ i+ (3a) (3b) (3c) (3d) (3e).) From the other side we start with the claimed formula () and substitute the recursion formula () at the resective ositions, to obtain: d dξ N i,(ξ) = N i, (ξ) + N i, (ξ) ξ i+ ξ i ξ i+ ξ i N i+, (ξ) N i+, (ξ) ξ i++ ξ i+ ξ i++ ξ i+ = N i, (ξ) N i+, (ξ) ξ i+ ξ i ξ i++ ξ i+ + ( ) ξ ξi N i, (ξ) ξ i+ ξ i ξ i+ ξ i + ( ) ξi+ ξ N i+, (ξ) ξ i+ ξ i ξ i+ ξ i+ ( ) ξ ξi+ N i+, (ξ) ξ i++ ξ i+ ξ i+ ξ i+ ( ) ξi++ ξ N i+, (ξ) ξ i++ ξ i+ ξ i++ ξ i+ (4a) (4b) (4c) (4d) (4e) 3.) To finish the roof, it remains to show, that equations (3a-3e) and (4a-4e) are indeed the same. This is obvious for (3e) and (4a), for (3a) and (4b) and for (3d) and (4e). The equality is not evident for (3b) and (4c) as well as for (3c) and (4d), hence we will maniulate (3b) and (3c) to match with their counterarts. Both of those terms have the common factor ( )N i+, (ξ), which we will exclude in the following exressions. Excet from this factor (3b)+(3c) reads: ξ ξ i (ξ i+ ξ i )(ξ i+ ξ i+ ) + ξ i++ ξ (ξ i++ ξ i+ )(ξ i+ ξ i+ ) Finding a common denominator one can also write this as: (ξ i ξ)(ξ i++ ξ i+ ) + (ξ i++ ξ)(ξ i+ ξ i ) (ξ i+ ξ i )(ξ i++ ξ i+ )(ξ i+ ξ i+ ) 5

6 factoring out the enumerator one realizes that ξ i ξ i++ cancels with its own negative and when adding a zero, i.e. in the enumerator adding +ξ i+ ξ i+ ξ i+ ξ i+ the whole fraction transforms to: (ξ i++ ξ i+ )(ξ i+ ξ) + (ξ i+ ξ i )(ξ i+ ξ) (ξ i+ ξ i )(ξ i++ ξ i+ )(ξ i+ ξ i+ ) Searating this again into two fractions: ξ i+ ξ (ξ i+ ξ i )(ξ i+ ξ i+ ) ξ ξ i+ (ξ i+ ξ i+ )(ξ i++ ξ i+ ) and again adding the common factor ( )N i+, (ξ) that was droed, one arrives at: ( )(ξ i+ ξ) (ξ i+ ξ i )(ξ i++ ξ i+ ) N ( )(ξ ξ i+ ) i+, (ξ) (ξ i+ ξ i+ )(ξ i++ ξ i+ ) N i+, (ξ) which are exactly (4c)+(4d). d) Again by induction over : = : The degree zero basis functions are discontinuous by definition, so indeendently of the knot multilicity m i = m i is less than and hence the claim holds. = : For j {,..., n}: ξ ξ j ξ j+ ξ lim N j, (ξ) = lim χ ξ ξ i ξ ξi ξ j+ ξ [ξj,ξ j+ )(ξ) + lim χ j ξ ξi ξ j+ ξ [ξj+,ξ j+ )(ξ) j+ } {{}} {{}, ξ i < ξ j < ξ j+, ξ i < ξ j+ < ξ j+, ξ i = ξ j < ξ j+, ξ j < ξ j+ = ξ i =, ξ j < ξ j+ < ξ i, ξ i < ξ j = ξ j+, ξ i = ξ j = ξ j+, ξ j = ξ j+ < ξ i, ξ i = ξ j+ < ξ j+, ξ j+ < ξ j+ = ξ i =, ξ j+ < ξ j+ < ξ i, ξ i < ξ j+ = ξ j+, ξ i = ξ j+ = ξ j+, ξ j+ = ξ j+ < ξ i ξ ξ j ξ j+ ξ lim N j, (ξ) = lim χ ξ ξ i ξ ξi ξ j+ ξ [ξj,ξ j+ )(ξ) + lim χ j ξ ξi ξ j+ ξ [ξj+,ξ j+ )(ξ) j+ } {{}} {{}, ξ i < ξ j < ξ j+, ξ i < ξ j+ < ξ j+, ξ i = ξ j < ξ j+, ξ j < ξ j+ = ξ i =, ξ j < ξ j+ < ξ i, ξ i < ξ j = ξ j+, ξ i = ξ j+ < ξ j+, ξ j+ < ξ j+ = ξ i =, ξ j+ < ξ j+ < ξ i, ξ i < ξ j+ = ξ j+, ξ i = ξ j = ξ j+, ξ j = ξ j+ < ξ i, ξ i = ξ j+ = ξ j+, ξ j+ = ξ j+ < ξ i There is only one case that might lead to a discontinuity: ξ i = ξ j+ > ξ j (= ξ i ) the limit from below is, which can only hold for the limit from above for ξ i = ξ j+ < ξ j+ (= ξ i+ ), 6

7 i.e. ξ i < ξ i < ξ i+ and hence ξ i must have multilicity to avoid discontinuity. The other way round, if ξ i has multilicity or more, we assume w.l.o.g. that (... = ξ i = )ξ i = ξ i ξ i+ and choose j = i, then ξ i = ξ j+ < ξ j+, hence the limit from above is, but the limit from below can not be since ξ i = ξ i contradicts ξ i = ξ j+ > ξ j = ξ i. ( ) : By means of the derivative formula () the continuity of the derivatives of a degree basis function is layed back to the continuity of the degree ( ) basis functions, i.e. the k-th derivative of N i, is a linear combination of {N j, k } j, which have regularity k m i, hence N i, has regularity m i. e) One more time a roof by induction: = : Assuming ξ i is resent in the knot vector at least once, we have for all j =,..., n by (): N j, (ξ i ) = ξ i ξ j χ ξ j+ ξ [ξj,ξ j+ )(ξ i ) + ξ { j+ ξ i, i = j + χ j ξ j+ ξ [ξj+,ξ j+ )(ξ i ) = j+, else Hence N i, (ξ) = N i, (ξ) is the searched for basis-function. ( ) : We assume that ξ i is resent times in the knot vector, i.e. ξ i = ξ i =... = ξ i +. Again by () we have for all j =,..., n. N j, (ξ i ) := ξ i ξ j N j, (ξ i ) + ξ j++ ξ i N j+, (ξ i ) ξ j+ ξ j ξ j++ ξ j+ N j, and N j+, are both of degree with ξ i having multilicity (one larger than degree). By the induction remise, we have that only one secial N k, takes the value one at ξ i, yielding: N j, (ξ i ) = ξ i ξ k δ j,k + ξ k+ ξ i δ j+,k ξ k+ ξ j ξ k+ ξ k Also by induction remise the k is chosen as k = i ( degree of the ( ) function) = i ( ) = i +. Plugging this in yields: N j, (ξ i ) = ξ { i ξ i + ξ i+ ξ i, i = j + δ j,i + + δ j+,i + = ξ i+ ξ j ξ i+ ξ i +, else }{{}}{{} = since ξ i =ξ i + = since ξ i =ξ i + Hence again N i, (ξ) is the searched for function. 7

8 Exercise 33 (B-sline curves, sensitivity and tangents) For a given (oen) knot vector Ξ R n++ with associated B-sline basis (N i, (ξ)) n i= and a set of control oints B i R d the d-dimensional B-sline curve of degree is defined as: B-sline curve: γ : [ξ, ξ n++ ] R d, γ(ξ) = N i, (ξ) B i (5) i= a) Prove that a B-sline curve of degree with an oen knot vector interolates all its control oints. b) Exlain why this is not always the case for higher degrees than (e.g. for the quadratic curve in fig. ) c) The following icture shows a B-sline curve of degree with control oints. Exlain why the curve changes only locally when a single control oint is moved, i.e. exlain why the right art of the curve does not change at all, if a control oints at the left end is moved Fig. : Quadratic B-sline curves to the knot vector Ξ = (,,,,, 3, 4, 5, 6, 7, 8, 9,,, ). The control oints (red dots) are both the same excet for the fourth one counted from left, that was moved from x = 3 to x = 4 for the right curve. The small red x show the hysical ositions of the ξ i. -) U to which oint exactly is the curve influenced by the moved control oint? -) How would the situation change when we use a quintic curve (i.e. degree = 5) or even an octic ( = 8) with the same control oints? d) Let Ξ be an oen knot-vector where the first + and last + knots are res. and let γ(ξ) be a B-sline curve of degree that is built via the basis-functions associated to Ξ. Prove that the tangent of γ at ξ = always oints towards the second control oint, even if the curve itself does not interolate that oint. Mathematically: Show that γ () = c (B B ), where c is some scaling factor. 8

9 Solution 33 a) In the knot vector each knot is resent at least = times. By exercise,d) this means that for every ξ i, i =,..., n there is exactly one basis-function being at ξ i while all other basis-functions are zero there, furthermore this basis function is always given by N i, (ξ). By definition of the B-sline curve, we can evaluate it at ξ j+ to get: γ(ξ j+ ) = N i, (ξ j+ ) B i i= n+ = N i, (ξ j+ ) B }{{} i i= =δ i,j+ = B j Hence the curve certainly goes through the oint B j, where j {,..., n} was arbitrarily chosen. b) In contrast to the first order basis-functions, higher order bases are in general not interolatory, i.e. for a certain ξ [ξ, ξ n++ ] there are always more than just one basis functions with N i, (ξ). Even though they do form a artition of unity the weight they contribute to the unity might be distributed between them and not lie on just one of them. In other words: In the linear ( = ) case we have seen in exercise art a) that at ξ j+ only the basis function associated to B j is active. For > there are also some other basis functions each associated to an other control oint such that γ(ξ j+ ) becomes a linear combination of those control oints lying somewhere in between them. c) To answer the question recisely lets have a look at the B-sline basis functions associated to the given knot vector that are also used to create the curves via definition (5) Fig. 3: Quadratic B-sline basis functions to the knot vector Ξ = (,,,,, 3, 4, 5, 6, 7, 8, 9,,, ). The basis function associated with the fourth control oint (the one that was moved) is also the fourth one from the left, i.e. the urle one. By exercise,a) we knot that 9

10 su(n 4, ) = [ξ 4, ξ 7 ] = [, 4 ]. By changing B 4 we change the contribution of N 4, to the curve, which is only not-zero in the given suort interval. Hence the geometry of γ is only changed between ξ = and ξ = 4, which is the region between the first and fourth red x in the icture above, before and after these oints, the curves are exactly the same! The following icture shows an overlay of the both curves to highlight the difference / similarity - regions: Fig. 4: Quadratic B-sline curves: blue: before the change, black: after For the same curve but with order = 5 the knot vector, in order to still have an oen one, is recomuted to: Ξ = (,,,,,, 7, 7, 3 7, 4 7, 5 7, 6 7,,,,,, ). In case of = 8 it even becomes: Ξ = (,,,,,,,,, 4, 4, 3 4,,,,,,,,, ). The resective B-sline bases look as follows: Fig. 5: left: Quintic B-sline basis, right: Octic B-sline basis For the suorts of the fourth basis functions each there holds: su(n 4,5 ) = [ξ 4, ξ ] = [, 4 7 ] and su(n 4,8) = [ξ 4, ξ 3 ] = [, ], i.e. the fourth quintic basis function already influences more than half of the arametric interval, while the octic-basis function influences even the whole curve. The following overlay-lots show the situation:

11 Fig. 6: Left: Overlay lot of quintic B-sline curves with one control oint changed, right: the same for octic sline functions. Esecially in the octic case it is imossible to see that indeed the whole curve changes. This is due to the fact, that N 4,8 is extremely small towards the right end of its suort (around 39 ), however(!) it is not zero there, so really the whole curve is influenced by the moved control oint. Summarizing the revious results we can conclude that with increasing degree the suort of individual basis functions grows and hence each control oints influences a larger art of the B-sline curve. d) Using linearity of the differentiation and () we get: γ (ξ) = N i,(ξ) B i i= = i= ξ i+ ξ i N i, (ξ) B i ξ i++ ξ i+ N i+, (ξ) B i Since the knot-vector is suosed to be oen, ξ = is reeated + times and by exercise,d) is only one basis-function of degree not being zero at ξ = ξ =... = ξ +, i.e. N + ( ), (ξ) = N, (ξ). This lets us reduce the sum to n = and we get: γ () = N, () B ξ + ξ N, () B ξ + ξ + + N, () B ξ + ξ N 3, () B ξ +3 ξ where the first and last term vanish and we remain with: γ () = ξ + ξ (B B )

12 Exercise 34 (NURBS-reresentation of a circle) Consider the quadratic B-sline curve C : [, 4] R 3 with knot vector Ξ = (,,,,,,, 3, 3, 4, 4, 4) and control oints B i = (±,, ), (, ±, ), (±, ±, ) which are ordered clockwise starting with (,, ) (and also again ending with (,, ), i.e. this control oints aears twice and hence the curve is closed), also see figure 7. a) Homogenize the coordinates of the B-sline curve, i.e. roject it onto the z = -lane of R 3 and identify this lane as R to obtain a lane curve P. Using the oint (,, ) as the rojection center, the homogenization rocedure can be summarized in the following formula: P x (ξ) P y (ξ) P z (ξ) = C x(ξ) C z(ξ) C y(ξ) C z(ξ) C z(ξ) C z(ξ) b) Show that the curve P (ξ) is an exact circle of radius. c) How does this relate to the NURBS-setting / definition of NURBS? Solution 34 Since the considered sline-curve C(ξ) is rotational eriodic with eriod π/, it suffices to rove the statement for the first quarter of the curve (that this will be rojected onto a quarter of a circle). The arametrization of the sline-curves is done over the interval [, 4] (knot vector [,,,,,,, 3, 3, 4, 4, 4]), so for the first quarter it is sufficient to restrict the arametrization to [, ]. On that subinterval only the first three B-sline basisfunctions are non-zero and hence the curve is exclusively comosed by them (see figure 7,c)). Exlicitely these three first B-sline basisfunctions can be exressed as follows: N, (ξ) [,] = ( ξ), N, (ξ) [,] = ξ ( ξ) and N 3, (ξ) [,] = ξ. Now emloying the definition of a B-sline-curve and using the secific control oints given in figure 7 yields: C x(ξ) C y(ξ) C z(ξ) [,] N,(ξ) + N,(ξ) + N 3,(ξ) = N,(ξ) + N,(ξ) + N 3,(ξ) N,(ξ) + N,(ξ) + N 3,(ξ) ( )ξ + ξ = ( )ξ + ( )ξ + ( )ξ + ( )ξ + = ξ( ξ) + ξ ( ξ) + ξ( ξ) ( ξ) + ξ( ξ) + ξ (6) a) P x (ξ) P y (ξ) P z (ξ) = [,] C x (ξ) C z (ξ) C y (ξ) C z (ξ) C z (ξ) C z (ξ) = [,] ( )ξ + ξ ( )ξ + ( )ξ + ( )ξ + ( )ξ + ( )ξ + ( )ξ + (7)

13 Projection of the B-sline curve Projection of the control olygon.5.5 z z.5.5 y x y x a) b) quadratic B-sline-basisfunctions used to create the rojection curve to-down view at the curves and control olygons Ni;(9) y x c) d) Fig. 7: a) B-sline curve of order with knot vector Ξ = (,,,,,,, 3, 3, 4, 4, 4) (blue) and its rojection (green) onto the z = lane, which is an exact circle with radius. b) The control oints of the B-sline curve (red) and their rojections onto the z = lane (orange). c) The B-sline basisfunctions used to create the B-sline curve in a). d) A to-down view at the entities from a) and b) (same colours) to better see the ositions of the control oints: (±,, ), (, ±, ), (±, ±, ) for (red, (,, ) aears twice, as first and last oint) and (±,, ), (, ±, ) and (±, ±, ) for (orange). b) Identifying the z = lane from R 3 with R finally gives: ( P x (ξ) P y (ξ) ) = P x (ξ) + P y (ξ) = [ ( )ξ + ξ ] [ + ( )ξ + ( )ξ + ] [ ( )ξ + ( )ξ + ] = (4 6 )ξ 4 6ξ 3 + (4 4 )ξ + (8 6)ξ + 4 (4 6 )ξ 4 6ξ 3 + (4 4 )ξ + (8 6)ξ + 4 c) Obviously a rational arametrization of a quarter-circle (again after identifying the z = lane from R 3 with R ) has been found in equation (7), which can be glued together iecewise with other quarter-circles to a full circle (again see figure 7). To further examine the structure of the rational arametrization of the quarter-circle, one again invokes equation (6) (only the first = sign) to write: 3

14 ( N, (ξ) + N, (ξ) + N 3, (ξ) ) ( ) Px (ξ) = P y (ξ) [,] N, (ξ) + N, (ξ) + N 3, (ξ) N, (ξ) + N, (ξ) + N 3, (ξ) Since all the other B-sline basisfunctions N i, (ξ), i = 4,..., 9 are zero on the interval [, ] (see figure 7,c)) one can add them in the enumerator as well as in the denominator to arrive at: ( Px (ξ) P y (ξ) ) [,] = 9 N i, (ξ) B i x i= B iy (8) 9 N i, (ξ) B iz i= For the second quarter-circle (ξ [, ]) now the B-sline basisfunctions N, (ξ) and N, (ξ) as well as N i, (ξ), i = 6,..., 9 are identically zero, which means equation (8) can be derived in the same way also for ξ [, ]. Finally this holds true for any of the four quarter circles so that in the end, the rational arametrization of the full circle also reads: ( Px (ξ) P y (ξ) ) = 9 N i, (ξ) B i x i= B iy (9) 9 N i, (ξ) B iz i= The structure of this arametrization of the unit circle, which is comonentwise a fraction of olynomials, more recisely linear combinations of the B-sline basisfunctions, and hence a rational function is exactly what was given in the definition of NURBS and NURBS-curves, where NURBS stands for Non-Uniform (the knot vector doesn t have to be uniform in general) Rational B-Sline. 4

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Complex Analysis Homework 1

Complex Analysis Homework 1 Comlex Analysis Homework 1 Steve Clanton Sarah Crimi January 27, 2009 Problem Claim. If two integers can be exressed as the sum of two squares, then so can their roduct. Proof. Call the two squares that

More information

Section 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative

Section 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

DIFFERENTIAL GEOMETRY. LECTURES 9-10,

DIFFERENTIAL GEOMETRY. LECTURES 9-10, DIFFERENTIAL GEOMETRY. LECTURES 9-10, 23-26.06.08 Let us rovide some more details to the definintion of the de Rham differential. Let V, W be two vector bundles and assume we want to define an oerator

More information

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017 th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

Isogeometric analysis based on scaled boundary finite element method

Isogeometric analysis based on scaled boundary finite element method IOP Conference Series: Materials Science and Engineering Isogeometric analysis based on scaled boundary finite element method To cite this article: Y Zhang et al IOP Conf. Ser.: Mater. Sci. Eng. 37 View

More information

By Evan Chen OTIS, Internal Use

By Evan Chen OTIS, Internal Use Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there

More information

MAS 4203 Number Theory. M. Yotov

MAS 4203 Number Theory. M. Yotov MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

CHAPTER 2: SMOOTH MAPS. 1. Introduction In this chapter we introduce smooth maps between manifolds, and some important

CHAPTER 2: SMOOTH MAPS. 1. Introduction In this chapter we introduce smooth maps between manifolds, and some important CHAPTER 2: SMOOTH MAPS DAVID GLICKENSTEIN 1. Introduction In this chater we introduce smooth mas between manifolds, and some imortant concets. De nition 1. A function f : M! R k is a smooth function if

More information

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO MARIA ARTALE AND DAVID A. BUCHSBAUM Abstract. We find an exlicit descrition of the terms and boundary mas for the three-rowed

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

01. Simplest example phenomena

01. Simplest example phenomena (March, 20) 0. Simlest examle henomena Paul Garrett garrett@math.umn.edu htt://www.math.umn.edu/ garrett/ There are three tyes of objects in lay: rimitive/rimordial (integers, rimes, lattice oints,...)

More information

Introduction to Banach Spaces

Introduction to Banach Spaces CHAPTER 8 Introduction to Banach Saces 1. Uniform and Absolute Convergence As a rearation we begin by reviewing some familiar roerties of Cauchy sequences and uniform limits in the setting of metric saces.

More information

RECIPROCITY LAWS JEREMY BOOHER

RECIPROCITY LAWS JEREMY BOOHER RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre

More information

Elementary theory of L p spaces

Elementary theory of L p spaces CHAPTER 3 Elementary theory of L saces 3.1 Convexity. Jensen, Hölder, Minkowski inequality. We begin with two definitions. A set A R d is said to be convex if, for any x 0, x 1 2 A x = x 0 + (x 1 x 0 )

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over

More information

Multiplicative group law on the folium of Descartes

Multiplicative group law on the folium of Descartes Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of

More information

SUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS *

SUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS * Journal of Comutational Mathematics Vol.8, No.,, 48 48. htt://www.global-sci.org/jcm doi:.48/jcm.9.-m6 SUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS

More information

CSC165H, Mathematical expression and reasoning for computer science week 12

CSC165H, Mathematical expression and reasoning for computer science week 12 CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml

More information

MATH 6210: SOLUTIONS TO PROBLEM SET #3

MATH 6210: SOLUTIONS TO PROBLEM SET #3 MATH 6210: SOLUTIONS TO PROBLEM SET #3 Rudin, Chater 4, Problem #3. The sace L (T) is searable since the trigonometric olynomials with comlex coefficients whose real and imaginary arts are rational form

More information

Solutions to Problem Set 5

Solutions to Problem Set 5 Solutions to Problem Set Problem 4.6. f () ( )( 4) For this simle rational function, we see immediately that the function has simle oles at the two indicated oints, and so we use equation (6.) to nd the

More information

THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN

THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN INTERNATIONAL JOURNAL OF GEOMETRY Vol. 5 (2016), No. 1, 31-38 THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN PETER WALKER Abstract. We show that in the Erd½os-Mordell theorem, the art of the region

More information

Strong Matching of Points with Geometric Shapes

Strong Matching of Points with Geometric Shapes Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract

More information

CMSC 425: Lecture 4 Geometry and Geometric Programming

CMSC 425: Lecture 4 Geometry and Geometric Programming CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas

More information

Mobius Functions, Legendre Symbols, and Discriminants

Mobius Functions, Legendre Symbols, and Discriminants Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

1-way quantum finite automata: strengths, weaknesses and generalizations

1-way quantum finite automata: strengths, weaknesses and generalizations 1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum

More information

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider

More information

Analysis of some entrance probabilities for killed birth-death processes

Analysis of some entrance probabilities for killed birth-death processes Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction

More information

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to

More information

MATH 361: NUMBER THEORY ELEVENTH LECTURE

MATH 361: NUMBER THEORY ELEVENTH LECTURE MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties

More information

On the Toppling of a Sand Pile

On the Toppling of a Sand Pile Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université

More information

LECTURE 6: FIBER BUNDLES

LECTURE 6: FIBER BUNDLES LECTURE 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann

More information

POINTS ON CONICS MODULO p

POINTS ON CONICS MODULO p POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics

More information

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1.

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1. MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT -ADIC L-FUNCTION XEVI GUITART Abstract. We give an overview of Mazur s construction of the Kubota Leooldt -adic L- function as the -adic Mellin transform of a

More information

Principles of Computed Tomography (CT)

Principles of Computed Tomography (CT) Page 298 Princiles of Comuted Tomograhy (CT) The theoretical foundation of CT dates back to Johann Radon, a mathematician from Vienna who derived a method in 1907 for rojecting a 2-D object along arallel

More information

MATH 248A. THE CHARACTER GROUP OF Q. 1. Introduction

MATH 248A. THE CHARACTER GROUP OF Q. 1. Introduction MATH 248A. THE CHARACTER GROUP OF Q KEITH CONRAD 1. Introduction The characters of a finite abelian grou G are the homomorhisms from G to the unit circle S 1 = {z C : z = 1}. Two characters can be multilied

More information

THE CHARACTER GROUP OF Q

THE CHARACTER GROUP OF Q THE CHARACTER GROUP OF Q KEITH CONRAD 1. Introduction The characters of a finite abelian grou G are the homomorhisms from G to the unit circle S 1 = {z C : z = 1}. Two characters can be multilied ointwise

More information

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and

More information

SECTION 5: FIBRATIONS AND HOMOTOPY FIBERS

SECTION 5: FIBRATIONS AND HOMOTOPY FIBERS SECTION 5: FIBRATIONS AND HOMOTOPY FIBERS In this section we will introduce two imortant classes of mas of saces, namely the Hurewicz fibrations and the more general Serre fibrations, which are both obtained

More information

Lecture 1.2 Pose in 2D and 3D. Thomas Opsahl

Lecture 1.2 Pose in 2D and 3D. Thomas Opsahl Lecture 1.2 Pose in 2D and 3D Thomas Osahl Motivation For the inhole camera, the corresondence between observed 3D oints in the world and 2D oints in the catured image is given by straight lines through

More information

The Euler Phi Function

The Euler Phi Function The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the

More information

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3 0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial

More information

p-adic Measures and Bernoulli Numbers

p-adic Measures and Bernoulli Numbers -Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

1 Extremum Estimators

1 Extremum Estimators FINC 9311-21 Financial Econometrics Handout Jialin Yu 1 Extremum Estimators Let θ 0 be a vector of k 1 unknown arameters. Extremum estimators: estimators obtained by maximizing or minimizing some objective

More information

Econometrica Supplementary Material

Econometrica Supplementary Material Econometrica Sulementary Material SUPPLEMENT TO WEAKLY BELIEF-FREE EQUILIBRIA IN REPEATED GAMES WITH PRIVATE MONITORING (Econometrica, Vol. 79, No. 3, May 2011, 877 892) BY KANDORI,MICHIHIRO IN THIS SUPPLEMENT,

More information

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices Coyright 202 Tech Science Press CMES, vol.86, no.4,.30-39, 202 An Inverse Problem for Two Sectra of Comlex Finite Jacobi Matrices Gusein Sh. Guseinov Abstract: This aer deals with the inverse sectral roblem

More information

Factorizations Of Functions In H p (T n ) Takahiko Nakazi

Factorizations Of Functions In H p (T n ) Takahiko Nakazi Factorizations Of Functions In H (T n ) By Takahiko Nakazi * This research was artially suorted by Grant-in-Aid for Scientific Research, Ministry of Education of Jaan 2000 Mathematics Subject Classification

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

ALGEBRAIC TOPOLOGY MASTERMATH (FALL 2014) Written exam, 21/01/2015, 3 hours Outline of solutions

ALGEBRAIC TOPOLOGY MASTERMATH (FALL 2014) Written exam, 21/01/2015, 3 hours Outline of solutions ALGERAIC TOPOLOGY MASTERMATH FALL 014) Written exam, 1/01/015, 3 hours Outline of solutions Exercise 1. i) There are various definitions in the literature. ased on the discussion on. 5 of Lecture 3, as

More information

Factorability in the ring Z[ 5]

Factorability in the ring Z[ 5] University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring

More information

Congruences modulo 3 for two interesting partitions arising from two theta function identities

Congruences modulo 3 for two interesting partitions arising from two theta function identities Note di Matematica ISSN 113-53, e-issn 1590-093 Note Mat. 3 01 no., 1 7. doi:10.185/i1590093v3n1 Congruences modulo 3 for two interesting artitions arising from two theta function identities Kuwali Das

More information

Characteristics of Fibonacci-type Sequences

Characteristics of Fibonacci-type Sequences Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and

More information

SYMPLECTIC STRUCTURES: AT THE INTERFACE OF ANALYSIS, GEOMETRY, AND TOPOLOGY

SYMPLECTIC STRUCTURES: AT THE INTERFACE OF ANALYSIS, GEOMETRY, AND TOPOLOGY SYMPLECTIC STRUCTURES: AT THE INTERFACE OF ANALYSIS, GEOMETRY, AND TOPOLOGY FEDERICA PASQUOTTO 1. Descrition of the roosed research 1.1. Introduction. Symlectic structures made their first aearance in

More information

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points. Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca

More information

1 Probability Spaces and Random Variables

1 Probability Spaces and Random Variables 1 Probability Saces and Random Variables 1.1 Probability saces Ω: samle sace consisting of elementary events (or samle oints). F : the set of events P: robability 1.2 Kolmogorov s axioms Definition 1.2.1

More information

Math 751 Lecture Notes Week 3

Math 751 Lecture Notes Week 3 Math 751 Lecture Notes Week 3 Setember 25, 2014 1 Fundamental grou of a circle Theorem 1. Let φ : Z π 1 (S 1 ) be given by n [ω n ], where ω n : I S 1 R 2 is the loo ω n (s) = (cos(2πns), sin(2πns)). Then

More information

Notes on Instrumental Variables Methods

Notes on Instrumental Variables Methods Notes on Instrumental Variables Methods Michele Pellizzari IGIER-Bocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of

More information

TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS

TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS #A4 INTEGERS 8 (208) TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS Akhilesh P. IV Cross Road, CIT Camus,Taramani, Chennai, Tamil Nadu, India akhilesh.clt@gmail.com O. Ramaré 2 CNRS / Institut de Mathématiques

More information

CHAPTER 5 TANGENT VECTORS

CHAPTER 5 TANGENT VECTORS CHAPTER 5 TANGENT VECTORS In R n tangent vectors can be viewed from two ersectives (1) they cature the infinitesimal movement along a ath, the direction, and () they oerate on functions by directional

More information

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

Number Theory Naoki Sato

Number Theory Naoki Sato Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO

More information

IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP

IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number 5, May 996 IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP TIM HSU (Communicated by Ronald M. Solomon) Abstract. We exhibit a simle

More information

Quantitative estimates of propagation of chaos for stochastic systems with W 1, kernels

Quantitative estimates of propagation of chaos for stochastic systems with W 1, kernels oname manuscrit o. will be inserted by the editor) Quantitative estimates of roagation of chaos for stochastic systems with W, kernels Pierre-Emmanuel Jabin Zhenfu Wang Received: date / Acceted: date Abstract

More information

6 Stationary Distributions

6 Stationary Distributions 6 Stationary Distributions 6. Definition and Examles Definition 6.. Let {X n } be a Markov chain on S with transition robability matrix P. A distribution π on S is called stationary (or invariant) if π

More information

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations

More information

Best approximation by linear combinations of characteristic functions of half-spaces

Best approximation by linear combinations of characteristic functions of half-spaces Best aroximation by linear combinations of characteristic functions of half-saces Paul C. Kainen Deartment of Mathematics Georgetown University Washington, D.C. 20057-1233, USA Věra Kůrková Institute of

More information

A construction of bent functions from plateaued functions

A construction of bent functions from plateaued functions A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for

More information

arxiv:cond-mat/ v2 25 Sep 2002

arxiv:cond-mat/ v2 25 Sep 2002 Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,

More information

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER #A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu

More information

Short Solutions to Practice Material for Test #2 MATH 2421

Short Solutions to Practice Material for Test #2 MATH 2421 Short Solutions to Practice Material for Test # MATH 4 Kawai (#) Describe recisely the D surfaces listed here (a) + y + z z = Shere ( ) + (y ) + (z ) = 4 = The center is located at C (; ; ) and the radius

More information

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections

More information

p-adic Properties of Lengyel s Numbers

p-adic Properties of Lengyel s Numbers 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée

More information

Brownian Motion and Random Prime Factorization

Brownian Motion and Random Prime Factorization Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

Averaging sums of powers of integers and Faulhaber polynomials

Averaging sums of powers of integers and Faulhaber polynomials Annales Mathematicae et Informaticae 42 (20. 0 htt://ami.ektf.hu Averaging sums of owers of integers and Faulhaber olynomials José Luis Cereceda a a Distrito Telefónica Madrid Sain jl.cereceda@movistar.es

More information

SECTION 12: HOMOTOPY EXTENSION AND LIFTING PROPERTY

SECTION 12: HOMOTOPY EXTENSION AND LIFTING PROPERTY SECTION 12: HOMOTOPY EXTENSION AND LIFTING PROPERTY In the revious section, we exloited the interlay between (relative) CW comlexes and fibrations to construct the Postnikov and Whitehead towers aroximating

More information

ε i (E j )=δj i = 0, if i j, form a basis for V, called the dual basis to (E i ). Therefore, dim V =dim V.

ε i (E j )=δj i = 0, if i j, form a basis for V, called the dual basis to (E i ). Therefore, dim V =dim V. Covectors Definition. Let V be a finite-dimensional vector sace. A covector on V is real-valued linear functional on V, that is, a linear ma ω : V R. The sace of all covectors on V is itself a real vector

More information

Multi-Operation Multi-Machine Scheduling

Multi-Operation Multi-Machine Scheduling Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job

More information

STRONG TYPE INEQUALITIES AND AN ALMOST-ORTHOGONALITY PRINCIPLE FOR FAMILIES OF MAXIMAL OPERATORS ALONG DIRECTIONS IN R 2

STRONG TYPE INEQUALITIES AND AN ALMOST-ORTHOGONALITY PRINCIPLE FOR FAMILIES OF MAXIMAL OPERATORS ALONG DIRECTIONS IN R 2 STRONG TYPE INEQUALITIES AND AN ALMOST-ORTHOGONALITY PRINCIPLE FOR FAMILIES OF MAXIMAL OPERATORS ALONG DIRECTIONS IN R 2 ANGELES ALFONSECA Abstract In this aer we rove an almost-orthogonality rincile for

More information

1. Introduction. ( u p 2 u ) (p 1) u p 2 u = 0, u(0) = 0, u (0) = 1,

1. Introduction. ( u p 2 u ) (p 1) u p 2 u = 0, u(0) = 0, u (0) = 1, Electronic Journal of Differential Equations, Vol. 208 (208), No. 35,.. ISSN: 072-669. URL: htt://ejde.math.txstate.edu or htt://ejde.math.unt.edu MACLAURIN SERIES FOR sin WITH AN INTEGER GREATER THAN

More information

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R. 1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo

More information

FORMAL DEFINITION OF TOLERANCING IN CAD AND METROLOGY

FORMAL DEFINITION OF TOLERANCING IN CAD AND METROLOGY P. SERRÉ, A. CLÉENT, A. RIVIÈRE FORAL DEFINITION OF TOLERANCING IN CAD AND ETROLOGY Abstract: Our aim is to unify mathematically the secification and the metrological verification of a given geometrical

More information

6 Binary Quadratic forms

6 Binary Quadratic forms 6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has

More information

Elements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley

Elements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the

More information

we get our formula for the saddle-point integral (5.294) h(w) e xf(w). (5.301) xf 00 (w) (w j )

we get our formula for the saddle-point integral (5.294) h(w) e xf(w). (5.301) xf 00 (w) (w j ) 5.3 The Abel-Plana Formula and the Casimir E ect 9 and using f (w) = e i and + = to show that e i = e i i = e i = f (w) (5.3) we get our formula for the saddle-oint integral (5.94) I(x) / h(w) e xf(w).

More information

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,

More information

On a Markov Game with Incomplete Information

On a Markov Game with Incomplete Information On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information

More information