CONJUGACY IN THOMPSON S GROUP F. 1. Introduction

Size: px
Start display at page:

Download "CONJUGACY IN THOMPSON S GROUP F. 1. Introduction"

Transcription

1 CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of pecewse lnear homeomorphsms of the unt nterval. 1. Introducton The object of ths paper s to extend the methods of Brn and Squer descrbed n [3] to solve the conjugacy problem n Thompson s group F. Let f : (a, b) (a, b) be a pecewse lnear order-preservng homeomorphsm of the open nterval (a, b); the ponts at whch f s not locally affne are called the nodes of f. We wrte PLF + (a, b) to denote the group of all pecewse lnear order-preservng homeomorphsms of the open nterval (a, b) whch have fntely many nodes. Thompson s group F s the subgroup of PLF + (0, 1) defned as follows: an element f of PLF + (0, 1) les n F f and only f the nodes of f le n the rng of dyadc ratonal numbers, Z [ 1 2], and f (x) s a power of 2 whenever x s not a node. In [3] Brn and Squer analysed conjugacy n PLF + (a, b) for (a, b) any open nterval. For (a, b) equal to (0, 1) we can restate ther prmary result [3, Theorem 5.3] as follows: we have a smple quantty Σ on PLF + (0, 1) such that two elements f and g of PLF + (0, 1) are conjugate f and only f Σ f = Σ g. If f and g are elements of F then Σ f and Σ g can be computed and compared usng a smple algorthm. Brn and Squer comment on ther constructon of Σ that, Our goal at the tme was to analyze the conjugacy problem n Thompson s group F. In ths paper we acheve Brn and Squer s goal by defnng a quantty on F such that the followng theorem holds. Theorem 1.1. Let f, g F. Then f and g are conjugate n F f and only f (Σ f, f ) = (Σ g, g ). Ths s not the frst soluton of the conjugacy problem n F. In partcular the conjugacy problem n F was frst solved by Guba and Sapr n [5] usng dagram groups. More recently, Belk and Matucc [1, 2] have another soluton usng strand dagrams. Kassabov and Matucc [6] also solved the conjugacy problem, and the smultaneous conjugacy problem. Our analyss s dfferent to all of these as we buld on the geometrc nvarants ntroduced by Brn and Squer. Note that Thm. 1.1 reduces the study of roots and centralzers n F (frst completed n [5]) to a set of easy computatons; we leave ths to the nterested reader. Date: December 10, Mathematcs Subject Classfcaton. Prmary: 20E45. Secondary: 20F10, 37E05. Key words and phrases. Conjugacy, pecewse lnear, Thompson. 1

2 We wll not prove Theorem 1.1 drectly. Rather we prove the followng proposton whch, gven [3, Theorem 5.3], mples Theorem 1.1: Proposton 1.2. Two elements f and g of F that are conjugate n PLF + (0, 1) are conjugate n F f and only f f = g. Our paper s structured as follows. In 2 we ntroduce some mportant background concepts, ncludng the defnton of Σ. In 3 we defne. In 4 we prove Proposton 1.2. In 5 and 6 we outlne formulae whch can be used to calculate. 2. The defnton of Σ Let f be a member of Thompson s group F, embedded n PLF + (0, 1). Followng Brn and Squer [3] we defne the nvarant Σ f to be a tuple of three quanttes, Σ 1, Σ 2 and Σ 3, whch depend on f. The frst quantty, Σ 1, s a lst of ntegers relatng to values of the sgnature of f, ϵ f. We defne ϵ f as follows: 1, f(x) > x; ϵ f : (0, 1) { 1, 0, 1}, x 0, f(x) = x; 1, f(x) < x. If f s an element of PLF + (0, 1) then there s a sequence of open ntervals I 1, I 2,..., I m, I j = (p j 1, p j ), p 0 = 0, p m = 1, (2.1) such that ϵ f s constant on each nterval, and the values of ϵ f on two consecutve ntervals dffer. We defne Σ 1 = (ϵ f (x 1 ),..., ϵ f (x m )) where x I for = 1,..., m. Let fx(f) be the set of fxed ponts of f and observe that the ponts p 0,..., p m from (2.1) all le n fx(f). We say that the nterval I j s a bump doman of f f ϵ f s non-zero on that nterval. Our next two nvarants consst of lsts wth entres for each bump doman of f. If k s a pecewse lnear map from one nterval (a, b) to another, then the ntal slope of k s the dervatve of k at any pont between a and the frst node of k, and the fnal slope of k s the dervatve of k at any pont between the fnal node of k and b. The nvarant Σ 2 s a lst of postve real numbers. The entry for a bump doman I j = (p j 1, p j ) s the value of the ntal slope of f n I j. To defne Σ 3 we need the noton of a fnte functon; ths s a functon [0, 1) R + whch takes the value 1 at all but fntely many values. The nvarant Σ 3 s a lst of equvalence classes of fnte functons. We calculate the entry for a bump doman I j = (p j 1, p j ) as follows. Suppose frst of all that Σ 1 = 1 n I j. Defne, for x I j, the slope rato f (x) = f + (x) f (x). Thus f (x) = 1 except when x s a node of f. Now defne ϕ f,j : I j R, x n= f (f n (x)). Snce f has only fntely many nodes, only fntely many terms of ths nfnte product are dstnct from 1. Let p be the smallest node of f n I j and let p be the smallest 2

3 node of f n I j such that ϕ f,j (p ) 1 (such a node must exst). Defne, for s [0, 1), ψ f,j (s) = ϕ f (λ s (r p j 1 ) + p j 1 ). Here λ s the entry n Σ 2 correspondng to I j and r s any pont n the nterval (0, p) whch satsfes the formula r = f n (p ) for n some negatve nteger. Note that ψ f,j s a fnte functon; furthermore, n our defnton of ψ f,j, we have chosen a value for r whch guarantees that ψ f,j (0) 1; we can do ths by vrtue of [3, Lemma 4.4]. The entry for Σ 3 correspondng to I j s the equvalence class [ψ f,j ], where two fnte functons c 1 and c 2 are consdered equvalent f c 1 = c 2 ρ where ρ s a translaton of [0, 1) modulo 1. If f(x) < x for each x I j then the entry for Σ 3 correspondng to I j s the equvalence class [ψ f 1,j]. 3. The defnton of The quantty wll also be a lst, ths tme a lst of equvalence classes of tuples of real numbers. To begn wth we need the concept of a mnmum cornered functon The mnmum cornered functon. Take f PLF + (0, 1); n ths subsecton we focus on the restrcton of f to one of ts bump domans D = (a, b). We adjust one of the defntons of Brn and Squer [3]: for us, a cornered functon n PLF + (0, 1) s an element l whch has a sngle bump doman (a, b) and whch satsfes the followng property: Σ 1 takes value 1 (resp. 1) n relaton to (a, b) and there exsts a pont x (a, b) such that all nodes of l whch le n (a, b) le n (x, l(x)) (resp. (l(x), x)). We wll sometmes abuse notaton and consder such a cornered functon as an element of PLF + (a, b). Fgure 1. A cornered functon. We say that a cornered functon l corresponds to a fnte functon c f ψ l = c (we drop the subscrpt here, snce there s only one bump doman). Roughly speakng ths means that the frst node of l corresponds to c(0). For a gven ntal slope λ there s a unque cornered functon n PLF + (a, b) such that ψ l = c (ths follows from [3, Prop. 4.9]; t can also be deduced from the proof of Lemma 5.2). 3

4 Now let c : [0, 1) R be a fnte functon such that [c] s the entry n Σ 3 assocated wth D. Wthn ths equvalence class [c] we can defne a mnmum fnte functon c m as follows. Frst defne C = {c 1 [c] c 1 (0) 1} and defne an orderng on C as follows. Let c 1, c 2 C and let x be the smallest value such that c 1 (x) c 2 (x). Wrte c 1 < c 2 provded c 1 (x) < c 2 (x). We defne c m to be the mnmum functon n C under ths orderng. Fgure 2. Two equvalent fnte functons. The mnmum fnte functon s on the left. Suppose that λ s the entry n Σ 2 assocated wth D. Suppose that l s the cornered functon n PLF + (a, b), wth ntal slope λ, whch corresponds to c m. We say that l s the mnmum cornered functon assocated wth f over D The quantty. Now let us fx f to be n F and defne accordngly. A bump chan s a subsequence I t, I t+1,..., I u of (2.1) such that each nterval s a bump doman, and of the ponts p t 1, p t,..., p u only p t 1 and p u are dyadc. Thus I 1, I 2,..., I m can be parttoned nto bump chans and open ntervals of fxed ponts of f (whch have dyadc numbers as end-ponts). In [3], conjugatng functons n PLF + (0, 1) are constructed by dealng wth one bump doman at a tme. We wll construct conjugatng functons n F by dealng wth one bump chan at a tme. Consder a partcular bump chan D 1,..., D s and let f j be the restrcton of f to D j = (a j, b j ). Accordng to [3, Theorem 4.18], the centralzer of f j wthn PLF + (a j, b j ) s an nfnte cyclc group generated by a root f j of f j. We defne λ j to be the ntal slope of f j and µ j to be the fnal slope of f j. (Let m j be the nteger such that f j m j = f j ; then λ j and µ j are the postve m j th roots of the ntal and fnal slopes of f j.) Next, let k j be a member of PLF + (a j, b j ) that conjugates f j to the assocated mnmum cornered functon, l j, n PLF + (a j, b j ). Thus k j s some functon satsfyng the equalty k j f j k 1 j = l j. Let α j be the ntal slope of k j and let β j be the fnal slope. 4

5 Consder the equvalence relaton on R s where (x 1,..., x s ) s equvalent to (y 1,..., y s ) f and only f there are ntegers m, n 1,..., n s such that 2 m x 1 = λ n 1 1 y 1 µ n 1 1 x 2 = λ n 2 2 y 2 µ n 2 2 x 3 = λ n 3 3 y 3. µ n s 1 s 1 x s = λ n s s y s. It s possble to check whether two s-tuples of real numbers are equvalent accordng to the above relaton n a fnte amount of tme because the quanttes λ and µ j are ratonal powers of 2. We assgn to the chan D 1,..., D s the equvalence class of the s-tuple ( α1, α 2 w 1,..., α ) s w s 1 w 1 w 2 β 1 w s β s 1 where w j = b j a j. We defne f to consst of an ordered lst of such equvalence classes; one per bump chan. 4. Proof of Proposton 1.2 We prove Proposton 1.2 after the followng elementary lemma. Lemma 4.1. Let f and g be maps n F, and let h be an element of PLF + (0, 1) such that hfh 1 = g. Let D = (a, b) be a bump doman of f and suppose that the ntal slope of h n D s an nteger power of 2. Then all slopes of h n D are nteger powers of 2 and all nodes of h n D occur n Z[ 1 2 ]. Proof. Let (a, a + δ) be a small nterval over whch h has constant slope; suppose that ths slope s greater than 1. We may assume that f has ntal slope greater than 1 otherwse replace f wth f 1 and g wth g 1. Now observe that hf n h 1 = g n for all ntegers n and so h = g n hf n. Now, for any x (a, b) there s an nterval (x, x + ϵ) and an nteger n so that f n (x, x + ϵ) (a, a + δ). Then the equaton h = g n hf n mples that, where defned, the dervatve of h over (x, x + ϵ) s an ntegral power of 2. Furthermore any node of h occurng n (x, x + ϵ) must le n Z[ 1 ] as requred. 2 If h does not have slope greater than 1 then apply the same argument to h 1 usng the equaton h 1 gh = f. We have two elements f and g of F and a thrd element h of PLF + (0, 1) such that hfh 1 = g. We use the notaton for f descrbed n the prevous secton, such as the quanttes I j, p j, f j, f j, k j, l j, α j, β j, w j, λ j, and µ j. We need exactly the same quanttes for g, and we dstngush the quanttes for g from those for f by addng a after each one. In partcular, we choose a bump chan D 1,..., D s of f and defne D = h(d ) for = 1,..., s. Note that D 1,..., D s are bump domans but need not form a bump chan for g accordng to our assumptons, because h s not necessarly a member of F. 5

6 Let the functon h = h D have ntal slope γ and fnal slope δ. Let u be the member of PLF + (0, 1) whch, for = 1,..., m, s affne when restrcted to I, and maps ths nterval onto I. Notce that, restrcted to D, ul u 1 s a cornered functon whch s conjugate to l (by the map k h k 1 u 1 ), and whch satsfes ψ l = ψ ul u 1. Therefore = l, k g k 1 = l, and ul u 1 = l. Combne ths equaton wth the equatons k f k 1 h f h 1 = g to yeld (k 1 u 1 k h )f (k 1 u 1 k h ) 1 = f. Therefore k 1 u 1 k h s n the centralzer of f, so there s an nteger N such that h = (k ) 1 uk f N for each = 1,..., s. Then by comparng ntal and fnal slopes n ths equaton we see that γ = λ N α w w α, δ = µ N β w w for = 2,..., s. We are now n a poston to prove Proposton 1.2. β (4.1) Proof of Proposton 1.2. Suppose that h F. Then there are ntegers M 1,..., M s such that γ 1 = 2 M 1 and γ = δ 1 = 2 M for = 2,..., s. Substtutng these values nto (4.1) we see that 2 M 1 α 1 w 1 for = 2,..., s, as requred. = λ N 1 1 α 1 w 1, µ N 1 1 α w w 1 β 1 = λ N α w 1, w β 1 Conversely, suppose that f = g. We modfy h so that t s a member of F. If I j s an nterval of fxed ponts of f then modfy h j so that t s any pecewse lnear map from I j to I j whose slopes are nteger powers of 2, and whose nodes occur n Z[ 1 ]. (It 2 s straghtforward to construct such maps, see [4, Lemma 4.2].) Now we modfy h on a bump chan D 1,..., D s. Snce f = g we know that there are ntegers m and n 1,..., n s such that, for = 2,..., s, 2 m α 1 = λ n 1 1 w 1 α 1 w 1, µ n 1 1 α w 1 = λ n w β 1 α w w 1. (4.2) β 1 Consder the pecewse lnear map h : D h (D ) gven by h n N = h f. The ntal slope γ of h s γ λ n N and the fnal slope δ = δ µ n N. From (4.1) and (4.2) we see that γ 1 = 2 m, γ = δ 1. for = 2,..., s. We modfy h by replacng h wth h on D. Then h does not have a node at any of the end-ponts of D 1,..., D s other than the frst and last end-pont. By Lemma 4.1, the nodes of h 1 occur n Z[ 1] and the slopes of h 2 1 are all powers of 2. Snce the ntal slope of h 1 concdes wth the fnal slope of h 1, the same can be sad of h 2. Smlarly, for = 2,..., s, the ntal slope of h concdes wth the fnal slope of h 1. We repeat these modfcatons for each bump chan of f; the resultng conjugatng map s a member of F. 6

7 5. Calculatng α and β It may appear that, n order to calculate, t s necessary to construct varous conjugatng functons. In partcular to calculate α one mght have to construct the functon n PLF + (a, b ) whch conjugates f to the conjugate mnmum cornered functon n PLF + (a, b ). It turns out that ths s not the case. The values for α and β can be calculated smply by lookng at the entres n Σ 1, Σ 2 and Σ 3 whch correspond to D. In ths secton we gve a formula for α ; we then observe how to use the formula for α to calculate β. In what follows we take f to be a functon n PLF + (a, b) such that f(x) x for x (a, b). Let l be the mnmum cornered functon whch s conjugate to f n PLF + (a, b) Calculatng α. Suppose frst that f(x) > x for x (a, b). Let y j, for j = 0,..., t be the ponts at whch the fnte functon ψ f does not take value 1; let ψ f take the postve value z j at the pont y j and assume that 0 = y 0 < y 1 < < y t < 1. We wll denote ψ f by c t and defne c j = c t (x + y j+1 ). Then c j s a translaton of c t under whch y j s mapped to the last pont of c j whch does not take value 1. Let u j be the cornered functon correspondng to c j and let x j be the fnal node of u j. Note that u j s conjugate to f and, for j equal to some nteger n, u j equals l, the mnmum cornered functon. Defne the elementary functon h x,r to be the functon whch s affne on (0, x) and (x, 1) and whch has slope rato r at x. We defne ζ j to be the ntal slope of the elementary functon h xj,z j. Let p be the frst node of f and let q be the frst node of u t. Lemma 5.1. There exsts k n PLF + (a, b) such that kfk 1 = l and the ntal slope of k s ( ) q a (ζ t ζ t 1... ζ n+1 ). p a Note that, n the formula just gven, p and q stand for the x-coordnates of the correspondng nodes. Before we prove Lemma 5.1 we observe that we can calculate values for the ζ j and q smply by lookng at Σ 2 and Σ 3 and usng the followng lemma: Lemma 5.2. Let l be a cornered functon n PLF + (a, b) wth ntal slope λ > 1, and suppose that the correspondng fnte functon c takes the value 1 at all ponts n [0, 1) except 0 = s 0 < s 1 < < s k < 1, at whch c(s ) = z. Then the frst node q 0 of l s gven by the formula q 0 = a + (b a)(1 [λz 0 z k ]) [λ(1 z 0 )]+[λ s 1 +1 z 0 (1 z 1 )]+ +[λ s k 1 +1 z 0 z k 2 (1 z k 1 )]+[λ s k +1 z 0 z k 1 (1 z k )], (5.1) and the ntal slope ζ of the elementary functon h qk,z k, where q k s the fnal node of l, s gven by b a ζ =. (5.2) λ s k (q0 a)(1 z k ) + (b a)z k Proof. If q 0,..., q k are the nodes of l we have equatons λ s (q 0 a) + a = q, = 0, 1, 2,..., k. (5.3) 7

8 Defne q k+1 = b and let λ be the slope of l between the nodes q 1 and q for = 1,..., k + 1. Then z = λ /λ 1 for > 1, and we obtan If we substtute (5.3) and (5.4) nto the equaton λ = λz 0... z 1, = 1,..., k + 1. (5.4) b a = λ(q 0 a) + λ 1 (q 1 q 0 ) + λ 2 (q 2 q 1 ) + + λ k+1 (b q k ), then we obtan (5.1). To obtan (5.2), notce that z k ζ s the fnal slope of h qk,z k, therefore b a = ζ(q k a) + z k ζ(b q k ). Substtute the value of q k from (5.3) nto ths equaton to obtan (5.2). Before we prove Lemma 5.1, we make the followng observaton. Let g be a functon such that g(x) > x for all x (a, b) and suppose that g has nodes p 1 < < p s. Now let h = h ps,g (p s ). Then hgh 1 has nodes h(p 1 ),..., h(p s 1 ), hg 1 (p s ) wth (hgh 1 ) takng on values g (p 1 ),... g (p t ) at the respectve nodes. If hg 1 (p s ) = h(p ) for some, then (hgh 1 ) has value g (p )g (p s ). Proof of Lemma 5.1. The formula gven n Lemma 5.1 arses as follows. We start by fndng the conjugator from f to the cornered functon u t ; then we cycle through the cornered functons u j untl we get to u n = l. Thus the q a part of the formula arses p a from the ntal conjugaton to a cornered functon, and the ζ j s arse from the cyclng. Consder ths cyclng part frst and use our observaton above on the cornered functons, u j : we have h xj,z j u j (h xj,z j ) 1 = u j 1. Thus n order to move from u t to u n we repeatedly conjugate by elementary functons wth ntal gradent ζ t,..., ζ n+1. We must now explan why we can use q a for the frst conjugaton whch moves from p a f to u t. It s suffcent to fnd a functon whch conjugates f to u t and whch s lnear on [a, p]. Consder the effect of applyng an elementary conjugaton to a functon f that s not a cornered functon. Suppose that f has nodes p 1 < < p s. So p = p 1. We consder the effect of conjugaton by an elementary functon h = h ps,f (p s ) as above. To reterate, we obtan a functon wth nodes h(p 1 ),..., h(p s 1 ), hf 1 (p s ) Now observe that, snce f (p s ) < 1, h(x) > x for all x and h s lnear on [a, p s ]. So clearly h s lnear on the requred nterval. There are three possbltes: If hf 1 (p s ) < h(p) then f was already a cornered functon; n fact f = u t. We are done. If hf 1 (p s ) > h(p) then we smply terate. We replace f wth hfh 1, p wth h(p) etc. We conjugate by another elementary functon exactly as before. It s clear that the next elementary conjugaton wll be lnear on [a, h(p)] whch s suffcent to ensure that the composton s lnear on [a, p]. If hf 1 (p s ) = h(p) then we need to check f hfh 1 s a cornered functon. If so then hfh 1 = u t, the corner functon we requre. If hfh 1 s not a cornered functon then we terate as above, replacng f wth hfh 1. It s possble that h(p) wll no longer be the frst node of hfh 1, but n ths case we replace p by 8

9 h(p 2 ). Snce [a, h(p 2 ] [a, h(p)] ths s suffcent to ensure that the composton s lnear on [a, p]. We can proceed lke ths untl the process termnates at a cornered functon. Snce conjugatng a non-cornered functon by h preserves ψ we can be sure that we wll termnate at u t as requred. What s more the composton of these elementary functons s lnear on [a, p]. Suppose next that f(x) < x for all x (a, b) and kfk 1 = l, a mnmum cornered functon. Observe that kf 1 k 1 = l 1 and f 1 (x) > x for all x (a, b). We can now apply the formula n Lemma 5.1, replacng f wth f 1 and l wth l 1, to get a value for the ntal slope of k Calculatng β. The method we have used to calculate α can also be used to calculate β. Defne τ : [a, b] [a, b], x b + a x. Now τ s an automorphsm of PLF + (a, b); the graph of a functon, when conjugated by τ, s rotated 180 about the pont ( b+a, b+a ). Consder the functon τfτ and let k be 2 2 the conjugatng functon from earler, so that kfk 1 = l. Then (τkτ)(τfτ)(τkτ) 1 = (τlτ). The ntal slope of τkτ equals the fnal slope of k. Thus we can use the method outlned above replacng f wth τfτ and l wth τlτ to calculate the ntal slope of τkτ. Note that, for ths to yeld β, we must make an adjustment to the nteger n n the formula n Lemma 5.1: the functon τ lτ s not necessarly the mnmum cornered functon whch s conjugate to τfτ. Thus we choose n to ensure that l s mnmum rather than τlτ. 6. Calculatng λ and µ Let f be a fxed-pont free element of PLF + (a, b). Let f be a generator of the centralzer of f wthn PLF + (a, b). The formula for requres that we calculate the ntal slope and the fnal slope of f. It turns out that ths s easy thanks to the work of Brn and Squer [3]. Let c, c : [0, 1) R be fnte functons. We say that c s the p-th root of c provded that, for all x [0, 1), we have c(x) = c (px). The property of havng a p-th root s preserved by the equvalence used to defne Σ 3. Thus we may talk about the equvalence class [c] havng a p-th root, provded any representatve of [c] has a p-th root. Now [3, Theorem 4.15] asserts that f has a p-th root n PLF + (a, b), for p a postve nteger, f and only f the sngle equvalence class n Σ 3 s a p-th power (followng Brn and Squer we say that ths class has p-fold symmetry). What s more [3, Theorem 4.18] asserts that f must be a root of f. Thus f p s the largest nteger for whch the sngle class n Σ 3 has p-fold symmetry then f s the p-th root of f. The ntal slope of f s the postve p-th root of the ntal slope of f, and the fnal slope of f s the postve p-th root of the fnal slope of f. 9

10 References [1] James Belk and Francesco Matucc. Conjugacy n Thompson s groups. Preprnt avalable at [2] James Belk and Francesco Matucc. Dynamcs n Thompson s groups. Preprnt avalable at [3] M. G. Brn and C. C. Squer. Presentatons, conjugacy, roots, and centralzers n groups of pecewse lnear homeomorphsms of the real lne. Comm. Algebra, 29(10): , [4] J. W. Cannon, W. J. Floyd, and W. R. Parry. Introductory notes on Rchard Thompson s groups. Ensegn. Math. (2), 42(3-4): , [5] Vctor Guba and Mark Sapr. Dagram groups. Mem. Amer. Math. Soc., 130(620):v+117, [6] Martn Kassabov and Francesco Matucc. The smultaneous conjugacy problem n Thompson s group F. Preprnt avalable at E-mal address: n.gll@open.ac.uk E-mal address:.short@open.ac.uk Department of Mathematcs and Statstcs, The Open Unversty, Mlton Keynes, MK7 6AA, Unted Kngdom 10

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

8.6 The Complex Number System

8.6 The Complex Number System 8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

CHAPTER 5: Lie Differentiation and Angular Momentum

CHAPTER 5: Lie Differentiation and Angular Momentum CHAPTER 5: Le Dfferentaton and Angular Momentum Jose G. Vargas 1 Le dfferentaton Kähler s theory of angular momentum s a specalzaton of hs approach to Le dfferentaton. We could deal wth the former drectly,

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture. LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

10. Canonical Transformations Michael Fowler

10. Canonical Transformations Michael Fowler 10. Canoncal Transformatons Mchael Fowler Pont Transformatons It s clear that Lagrange s equatons are correct for any reasonable choce of parameters labelng the system confguraton. Let s call our frst

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

A Quantum Gauss-Bonnet Theorem

A Quantum Gauss-Bonnet Theorem A Quantum Gauss-Bonnet Theorem Tyler Fresen November 13, 2014 Curvature n the plane Let Γ be a smooth curve wth orentaton n R 2, parametrzed by arc length. The curvature k of Γ s ± Γ, where the sgn s postve

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

Restricted divisor sums

Restricted divisor sums ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

Fundamental loop-current method using virtual voltage sources technique for special cases

Fundamental loop-current method using virtual voltage sources technique for special cases Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets 5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

Lecture 4: Universal Hash Functions/Streaming Cont d

Lecture 4: Universal Hash Functions/Streaming Cont d CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

k(k 1)(k 2)(p 2) 6(p d.

k(k 1)(k 2)(p 2) 6(p d. BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the

More information

Lecture 7: Gluing prevarieties; products

Lecture 7: Gluing prevarieties; products Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Projective change between two Special (α, β)- Finsler Metrics

Projective change between two Special (α, β)- Finsler Metrics Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

arxiv: v1 [math.ho] 18 May 2008

arxiv: v1 [math.ho] 18 May 2008 Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc

More information

Section 3.6 Complex Zeros

Section 3.6 Complex Zeros 04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there

More information

Homework Notes Week 7

Homework Notes Week 7 Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we

More information

AGC Introduction

AGC Introduction . Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

), it produces a response (output function g (x)

), it produces a response (output function g (x) Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans

More information

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)? Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

More information

EXPANSIVE MAPPINGS. by W. R. Utz

EXPANSIVE MAPPINGS. by W. R. Utz Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs

More information

Group Analysis of Ordinary Differential Equations of the Order n>2

Group Analysis of Ordinary Differential Equations of the Order n>2 Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

More information

PHYS 705: Classical Mechanics. Canonical Transformation II

PHYS 705: Classical Mechanics. Canonical Transformation II 1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

A combinatorial problem associated with nonograms

A combinatorial problem associated with nonograms A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

More information

On the smoothness and the totally strong properties for nearness frames

On the smoothness and the totally strong properties for nearness frames Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information