Algebraic transformations of Gauss hypergeometric functions

Size: px
Start display at page:

Download "Algebraic transformations of Gauss hypergeometric functions"

Transcription

1 Algebraic transformations of Gauss hypergeometric functions Raimunas Viūnas Faculty of Mathematics, Kobe University Abstract This article gives a classification scheme of algebraic transformations of Gauss hypergeometric functions, or pull-back transformations between hypergeometric ifferential equations. The classification recovers the classical transformations of egree,, 4,, an fins other transformations of some special classes of the Gauss hypergeometric function. The other transformations are consiere more thoroughly in a series of supplementing articles. Introuction An algebraic transformation of Gauss hypergeometric functions is an ientity of the form Ã, B A, B F C x = θx F C ϕx. Here ϕx is a rational function of x, an θx is a raical function, i.e., a prouct of some powers of rational functions. Examples of algebraic transformations are the following well-known quaratic transformations see [Er5, Section.], [Gou8, formulas 8, 45]: a, b a F a+b+ x = F, b a+b+ 4x x, a, b F b x = x a a F, a+ x b + x. Algebraic transformations of Gauss hypergeometric functions are usually inuce by pull-back transformations between their hypergeometric ifferential equations. General relation between these two kins of transformations is given in Lemma. here below. By that lemma, if a pull-back transformation converts a hypergeometric equation to a hypergeometric equation as well, then there are ientities of the form between hypergeometric solutions of the two hypergeometric equations. Conversely, an algebraic transformation is inuce by a pull-back transformation of the corresponing hypergeometric equations, unless the hypergeometric series on the left-han sie of satisfies a first orer linear ifferential equation. This article classifies pull-back transformations between hypergeometric ifferential equations. At the same time we essentially classify algebraic transformations of Gauss hypergeometric functions. Supporte by the Dutch NWO project -0-55, an by the Kyushu University Century COE Programme Development of Dynamic Mathematics with High Functionality of the Ministry of Eucation, Culture, Sports, Science an Technology of Japan. viunas@math.kobe-u.ac.jp

2 Classical fractional-linear an quaratic transformations are ue to Euler, Pfaff, Gauss an Kummer. In [Gou8] Goursat gave a list of transformations of egree, 4 an. It has been wiely assume that there are no other algebraic transformations, unless hypergeometric functions are algebraic functions. For example, [Er5, Section..5] states the following: Transformations of [egrees other than,, 4, ] can exist only if a, b, c are certain rational numbers; in those cases the solutions of the hypergeometric equation are algebraic functions. As our stuy shows, this assertion is unfortunately not true. This fact is notice in [AK0] as well. Existence of a few special transformations follows from [Ho8], [Beu0]. Regaring transformations of algebraic hypergeometric functions or more exactly, pull-back transformations of hypergeometric ifferential equations with a finite monoromy group, celebrate Klein s theorem [Kle77] ensures that all these hypergeometric equations are pull-backs of a few stanar hypergeometric equations. Klein s pull-back transformations o not change the projective monoromy group. The possible finite projective monoromy groups are: a cyclic incluing the trivial, a finite iheral, the tetraheral, the octaheral or the icosaheral groups. Transformations of algebraic hypergeometric functions that reuce the projective monoromy group are compositions of a few reucing transformations an Klein s transformation keeping the smaller monoromy group; see Remark 7. below. The ultimate list of pull-back transformations between hypergeometric ifferential equations an of algebraic transformations for their hypergeometric solutions is the following: Classical algebraic transformations of egree,, 4 an ue to Gauss, Euler, Kummer, Pfaff an Goursat. We review classical transformations in Section 4, incluing fractional-linear transformations. Transformations of hypergeometric equations with an abelian monoromy group. This is a egenerate case [Vi07]; the hypergeometric equations have rather than actual singularities. We consier these transformations in Section 5. Transformations of hypergeometric equations with a iheral monoromy group. These transformations are consiere here in Section, or more thoroughly in [Vi08a, Sections an 7]. Transformations of hypergeometric equations with a finite monoromy group. The hypergeometric solutions are algebraic functions. Transformations of hypergeometric equations with finite cyclic or iheral monoromy groups can be inclue in the previous two cases. Transformations of hypergeometric equations with the tetraheral, octaheral or icosaheral projective monoromy groups are consiere here in Section 7, or more thoroughly in [Vi08b]. Transformations of hypergeometric functions which are incomplete elliptic integrals. These transformations correspon to enomorphisms of certain elliptic curves. They are consiere in Section 8, or more thoroughly in [Vi08c]. Finitely many transformations of so-calle hyperbolic hypergeometric functions. Hypergeometric equations for these functions have local exponent ifferences /k, /k, /k, where k, k, k are positive integers such that /k + /k + /k <. These transformations are escribe in Section 9, or more thoroughly in [Vi05]. The classification scheme is presente in Section. Sections 4 through 9 characterize various cases of algebraic transformations of hypergeometric functions. We mention some three-term ientities with Gauss hypergeometric functions as well. The non-classical cases are consiere more thoroughly in separate articles [Vi08a], [Vi08b], [Vi08c], [Vi05]. Recently, Kato [Kat08] classifie algebraic transformations of the F hypergeometric series. The rational transformations for the argument z in that list form a strict subset of the transformations consiere here.

3 Preliminaries The hypergeometric ifferential equation is [AAR99, Formula..5]: z z yz z + C A+B+ z yz z A B yz = 0. 4 This is a Fuchsian equation with regular singular points z = 0, an. The local exponents are: 0, C at z = 0; 0, C A B at z = ; an A, B at z =. A basis of solutions for general equation 4 is A, B F + A C, + B C C z, z C F C z. 5 For basic theory of hypergeometric functions an Fuchsian equations see [Beu0], [vw0, Chapters, ] or [Tem9, Chapters 4, 5]. We use the approach of Riemann an Papperitz [AAR99, Sections.,.9]. A rational pull-back transformation of an orinary linear ifferential equation has the form z ϕx, yz Y x = θx yϕx, where ϕx an θx have the same meaning as in formula. Geometrically, this transformation pullbacks a ifferential equation on the projective line P z to a ifferential equation on the projective line P x, with respect to the finite covering ϕ : P x P z etermine by the rational function ϕx. Here an throughout the paper, we let P x, P z enote the projective lines with rational parameters x, z respectively. A pull-back transformation of a Fuchsian equations gives a Fuchsian equation again. In [AK0] pull-back transformations are calle RS-transformations. We introuce the following efinition: an irrelevant singularity for an orinary ifferential equation is a regular singularity which is not logarithmic, an where the local exponent ifference is equal to. An irrelevant singularity can be turne into a non-singular point after a suitable pull-back transformation with ϕx = x. For comparison, an apparent singularity is a regular singularity which is not logarithmic, an where the local exponents are integers. Recall that at a logarithmic point is a singular point where there is only one local solution of the form x λ + α x + α x +..., where x is a local parameter there. For us, a relevant singularity is a singular point which is not an irrelevant singularity. We are intereste in pull-back transformations of one hypergeometric equation to other hypergeometric equation, possibly with ifferent parameters A, B, C. These pull-back transformations are relate to algebraic transformations of Gauss hypergeometric functions as follows. Lemma.. Suppose that pull-back transformation of hypergeometric equation 4 is a hypergeometric equation as well with the new ineterminate x. Then, possibly after fractional-linear transformations on P x an P z, there is an ientity of the form between hypergeometric solutions of the two hypergeometric equations.. Suppose that hypergeometric ientity hols in some region of the complex plane. Let Y x enote the left-han sie of the ientity. If Y x/y x is not a rational function of x, then the transformation converts the hypergeometric equation 4 into a hypergeometric equation for Y x. Proof. We have a two-term ientity whenever we have a singular point S P x of the transforme equation above a singular point Q P z of the starting equation. Using fractional-linear transformations on P x an P z we can achieve S is the point x = 0 an that Q is the point z = 0. Then ientification of two hypergeometric solutions with the local exponent 0 an the value at respectively x = 0 an z = 0 gives a two-term ientity as in. If all three singularities of the transforme equation o not

4 lie above {0,, } P z, they are apparent singularities. Then the transforme equation has trivial monoromy, while the starting hypergeometric equation has a finite monoromy group. As we will consier explicitly in Sections 7 an 5,, the pull-back transformations reucing the monoromy group an the pull-back transformations keeping the trivial monoromy group can be realize by two-term hypergeometric ientities. This is recape in Remark 7. below. For the secon statement, we have two secon-orer linear ifferential equations for the left-han sie of : the hypergeometric equation for Y x, an a pull-back transformation of the hypergeometric equation 4. If these two equations are not Cx-proportional, then we can combine them linearly to a first-orer ifferential equation Y x = rx Y x with rx Cx, contraicting the conition on Y x/y x. If we have an ientity without a pull-back transformation between corresponing hypergeometric equations, the left-han sie of the ientity can be expresse as terminating hypergeometric series up to a raical factor; see Kovacic algorithm [Kov8], [vps0, Section 4..4]. In a formal sense, any pair of terminating hypergeometric series is algebraically relate. We o not consier these egenerations. Remark. We also o not consier transformations of the type F ϕ z = θz F ϕ z, where ϕ z, ϕ z are rational functions of egree at least. Therefore we miss transformations of some complete elliptic integrals, such as where x + y = an Kx = + y K Kx = π F /, / x = y + y 0, 7 t t x t. Ientity 7 plays a key role in the theory of arithmetic-geometric mean; see [AAR99, Chapter.]. Other similar example is the following formula, prove in [BBG95, Theorem.]: c, c + F c+5 x = + x c c, c+ F c+ x +x. 8 The case c = / was foun earlier in [BB9]. A pull-back transformation between hypergeometric equations usually gives several ientities like between some of the 4 Kummer s solutions of both equations. It is appropriate to look first for suitable pull-back coverings ϕ : P x P z up to fractional-linear transformations. As we will see, suitable pull-back coverings are etermine by appropriate transformations of singular points an local exponent ifferences. Once a suitable covering ϕ is known, it is convenient to use Riemann s P -notation for eriving hypergeometric ientities with the argument ϕx. Recall that a Fuchsian equation with singular points is etermine by the location of those singular points an local exponents there. The linear space of solutions is etermine by the same ata. It can be efine homologically without reference to hypergeometric equations as a local system on the projective line; see [Kat9], [Gra8, Section.4]. The notation for it is P α β γ a b c z, 9 a b c where α, β, γ P z are the singular points, an a, a ; b, b ; c, c are the local exponents at them, respectively. Recall that secon orer Fuchsian equations with relevant singularities are efine uniquely 4

5 by their singularities an local exponents, unlike general Fuchsian equations with more than singular points. Our approach can be entirely formulate in terms of local systems, without reference to hypergeometric equations an their pull-back transformations. By Papperitz theorem [AAR99, Theorem..] we must have a + a + b + b + c + c =. We are looking for transformations of local systems of the form 0 0 P 0 0 Ã x C C Ã B B = θx P 0 0 A C C A B B ϕx. 0 The factor θx shoul shift local exponents at irrelevant singularities to the values 0 an, an it shoul shift one local exponent at both x = 0 an x = to the value 0. In intermeiate computations, Fuchsian equations with more than singular points naturally occur, but those extra singularities are irrelevant singularities. We exten Riemann s P -notation an write α β γ S... S k P a b c e... e k a b c e +... e k + to enote the local system of solutions of a Fuchsian equation with irrelevant singularities S,..., S k. This notation makes sense if a local system exists i.e., if the local exponents sum up to the right value; then it can be transforme to a local system like 9. For example, if none of the points γ, S,..., S k is the infinity, local system can be ientifie with z S e... z S k e k z γ e+...+e k P z α β γ a b c + e e k z. a b c + e e k Here is an example of computation with local systems leaing to quaratic transformation : P a b b a a+ t = P = P = x a P a b b a b a a a b b a b a a a b b a b t x = t t + To conclue, one has to ientify two functions with the local exponent 0 an the value at t = 0 an x = 0 in the first an the last local systems respectively, like in the proof of part of Lemma.. Once a hypergeometric ientity is obtaine, it can be compose with Euler s an Pfaff s fractionallinear transformations; we recall them in formulas 8 below. Geometrically, these transformations permute the singularities, on P z or P x an their local exponents. Besies, simultaneous permutation of the local exponents at x = 0 an z = 0 usually implies a similar ientity to, as presente in the following lemma. x. 5

6 Lemma. Suppose that a pull-back transformation inuces ientity in an open neighborhoo of x = 0. Then ϕx C Kx ec as x 0 for some constant K, an the following ientity hols if both hypergeometric functions are well-efine: F + Ã C, + B C C x = θx ϕx C K x e C F + A C, + B C C ϕx. Proof. The asymptotic relation ϕx C Kx ec as x 0 is clear from the transformation of local exponents. We are ensure that θ0 =. Further, we have relation 0 an the relations 0 P 0 0 A C C A B B 0 P 0 0 Ã C C Ã B B ϕx = ϕx C P x = x ec P From here we get the right ientification of local systems for. 0 C 0 A + C 0 C A B B + C 0 C 0 Ã + C 0 C Ã B B + C A general pull-back transformation converts a hypergeometric equation to a Fuchsian ifferential equation with several singularities. To fin proper caniates for pull-back coverings ϕ : P x P z, we look first for possible pull-back transformations of hypergeometric equations to Fuchsian equations with at most relevant singularities. These Fuchsian equations can be always transforme to hypergeometric equations by suitable fractional-linear pull-back transformations, an vice versa. Relevant singular points an local exponent ifferences for the transforme equation are etermine by the covering ϕ only. Here are simple rules which etermine singularities an local exponent ifferences for the transforme equation. Lemma.4 Let ϕ : P x P z be a finite covering. Let H enote a Fuchsian equation on P z, an let H enote the pull-back transformation of H uner. Let S P x, Q P z be points such that ϕs = Q.. The point S is a logarithmic point for H if an only if the point Q is a logarithmic point for H.. If the point Q is non-singular for H, then the point S is not a relevant singularity for H if an only if the covering ϕ oes not branch at S.. If the point Q is a singular point for H, then the point S is not a relevant singularity for H if an only if the following two conitions hol: The point Q is not logarithmic. The local exponent ifference at Q is equal to /k, where k is the branching inex of ϕ at S. Proof. First we note that if the point S is not a relevant singularity, then it is either a non-singular point or an irrelevant singularity. Therefore S is not a relevant singularity if an only if it is not a logarithmic point an the local exponent ifference is equal to. Let p, q enote the local exponents for H at the point Q. Let k enote the branching orer of ϕ at S. Then the local exponent ifference at S is equal to kp q. To see this, note that if m C is the orer of θx at S, the local exponents at S are equal to kp + m an kq + m. This fact is clear if Q is not logarithmic, when the local exponents can be rea from solutions. In general one has to use the inicial polynomial to etermine local exponents. The first statement is clear, since local solutions of H at S can be pull-backe to local solutions of H at Q, an local solutions of H at Q can be push-forware to local solutions of H at S. x ϕx.,

7 If the point Q is non-singular, the point S is not logarithmic by the first statement, so S is a not a relevant singularity if an only if k =. If the point Q is singular, then the local exponent ifference at S is equal to if an only if the local exponent ifference p q is equal to /k. The following Lemma gives an estimate for the number of points S to which part of Lemma.4 applies, an it gives a relation between local exponent ifferences of two hypergeometric equations relate by a pull-back transformation an the egree of the pull-back transformation. In this paper we make the convention that real local exponent ifferences are non-negative, an complex local exponent ifferences have the argument in the interval π, π]. Lemma.5 Let ϕ : P x P z be a finite covering, an let enote the egree of ϕ.. Let enote a set of points on P z. If all branching points of ϕ lie above, then there are exactly + istinct points on P x above. Otherwise there are more than + istinct points above.. Let H enote a hypergeometric equation on P z, an let H enote a pull-back transformation of H with respect to ϕ. Suppose that H is hypergeometric equation as well. Let e, e, e enote the local exponent ifferences for H, an let e, e, e enote the local exponent ifferences for H. Then e + e + e = e + e + e. Proof. For a point S P x let or S ϕ enote the branching orer of ϕ at S. By Hurwitz formula [Har77, Corollary IV..4] we have = + D, where D = or S ϕ. S P x Therefore D =. The number of points above is or S ϕ D = +. ϕs We have the equality if an only if all branching points of ϕ lie above. Now we show the secon statement. For a point S P z or S P x, let les enote the local exponent ifference for H or H respectively at S. The following sums make sense: les les S P x = Q P z = Q P z ϕs=q leq ϕs=q leq + D. = Q P z The first sum is equal to e + e + e. The last expression is equal to e + e + e +. The classification scheme The core problem is to classify pull-back transformations of hypergeometric equations to Fuchsian equations with at most relevant singular points. By Lemma.4, a general pull-back transformation gives a Fuchsian equation with quite many relevant singular points, especially above the set {0,, } P z. 7

8 In orer to get a Fuchsian equation with so few singular points, we have to restrict parameters or local exponent ifferences of the original hypergeometric equation, an usually we can allow branching only above the set {0,, } P z. We classify pull-back transformations between hypergeometric equations an algebraic transformations of Gauss hypergeometric functions in the following five principal steps:. Let H enote hypergeometric equation 4, an consier its pull-back transformation. Let H enote the pull-backe ifferential equation, an let T enote the number of singular points of H. Let enote the subset {0,, } of P z, an let enote the egree of the covering ϕ : P x P z in transformation. We consequently assume that exactly N {0,,, } of the local exponent ifferences for H at are restricte to the values of the form /k, where k is a positive integer. If k = then the corresponing point of is assume to be not logarithmic, as we cannot get ri of singularities above a logarithmic point.. In each assume case, use Lemma.4 an etermine all possible combinations of the egree an restricte local exponent ifferences. Let k,..., k N enote the enominators of the restricte ifferences. By part 4 of Lemma.4, T [the number of singular points above ] + [the number of non-singular points above ] N +. j= Since we wish T, we get the following restrictive inequality in integers: k j N. 4 j= To skip specializations of cases with smaller N, we may assume that maxk,..., k N. A preliminary list of possibilities can be obtaine by ropping the rouning own in 4; this gives a weaker but more convenient inequality + N j= k j k j. 5. For each combination of an restricte local exponent ifferences, etermine possible branching patterns for ϕ such that the transforme equation H woul have at most three singular points. In most cases we can allow branching points only above, an we have to take the maximal number /k j of non-singular points above the point with the local exponent ifference /k j. 4. For each possible branching pattern, etermine all rational functions ϕx which efine a covering with that branching pattern. For this can be one using a computer by a straightforwar metho of unetermine coefficients. In [Vi05, Section ] a more appropriate algorithm is introuce which uses ifferentiation of ϕx. In many cases this problem has precisely one solution up to fractionallinear transformations. But not for any branching pattern a covering exists, an there can be several ifferent coverings with the same branching pattern. For infinite families of branching patterns we are able to give a general, algorithmic or explicit characterization of corresponing coverings. For instance, if hypergeometric solutions can be expresse very explicitly, we can ientify the local systems in 0 up to unknown factor θx. Then quotients of corresponing hypergeometric solutions aka Schwarz maps can be ientifie precisely, which gives a straightforwar way to etermine ϕx. 8

9 5. Once a suitable covering ϕ : P x P z is compute, there always exist corresponing pull-back transformations. Two-term ientities like can be compute using extene Riemann s P -notation of Section. We have two-term ientities for each singular point S of the transforme equation such that ϕs, as in the proof of part of Lemma.. Once we fix S, ϕs as x = 0, z = 0 respectively, permutations of local exponents an other singularities give ientities which are relate by Euler s an Pfaff s transformations an Lemma.. If the transforme equation has less than actual singularities, one can consier any point above in this manner. Some of the obtaine ientities may be the same up to change of free parameters. Now we sketch explicit appliance of the above proceure. When N = 0, i.e., when no local exponent ifferences are restricte, then = by formula 5. This gives Euler s an Pfaff s fractional-linear transformations. When N =, we have the following cases: k =, =. This gives the classical quaratic transformations. See Section 4. k =, any. The z-point with the local exponent ifference /k is assume to be non-logarithmic, so the equation H has only two relevant singularities. As we show in Lemma 5. below, the two unrestricte local exponent ifferences must be equal. As it turns out, the covering ϕ branches only above the two points with unrestricte local exponent ifferences. If the triple of local exponent ifferences for H is, p, p, the triple of local exponent ifferences for H is, p, p. Formally, this case has a continuous family of fractional-linear pull-back transformations, but that oes not give interesting hypergeometric ientities. When N =, we have the following cases: If maxk, k >, the possibilities are liste in Table. Steps an of the classification scheme are straightforwar, an a snapshot of possibilities after them is presente by the first four columns of Table. The notation for a branching pattern in the fourth column gives + branching orers for the points above ; branching orers at points in the same fiber are separate by the + signs, branching orers for ifferent fibers are separate by the = signs. Step 4 of our scheme gives at most one covering up to fractional-linear transformations for each branching pattern. Ultimately, Table yiels precisely the classical transformations of egree, 4, ue to Goursat [Gou8]; see Section 4. It is straightforwar to figure out possible compositions of small egree coverings, an then ientify them with the unique coverings for Table. Degrees of constituents for ecomposable coverings are liste in the last column from right for the constituent transformation from H to left. Note that one egree covering has two istinct ecompositions; a corresponing hypergeometric transformation is given in formula 8 below. k =, k =, any. The monoromy group of H is a iheral group. The hypergeometric functions can be expresse very explicitly, see Section. The triple /, /, p of local exponent ifferences for H is transforme either to /, /, p for any, or to, p/, p/ for even. k = ; k an are any positive integers. The z-point with the local exponent ifference /k is not logarithmic, so the triple of local exponent ifferences for H must be, /k, /k. The monoromy group is a finite cyclic group. Possible transformations are outline in Section 5. When N =, we have the following three very istinct cases: /k +/k +/k >. The monoromy groups of H an H are finite, the hypergeometric functions are algebraic. The egree is unboune. Klein s theorem [Kle77] implies that any hypergeometric equation with a finite monoromy group or equivalently, with algebraic solutions is a pull-back transformation of a stanar hypergeometric equation with the same monoromy group. These are the most interesting pull-back transformations for this case. Equations with finite cyclic monoromy 9

10 Local exponent ifferences Degree Branching pattern above Covering /k, /k, p above the regular singular points composition /, /, p /, p, p + = = + inecomposable /, /, p /, p, p 4 + = + = + inecomposable /, /, p /, p, p 4 + = + = + no covering /, /, p p, p, 4p + + = + = /, /, p p, p, p + + = + = + + or /, /, p p, p, p + + = + = + + no covering /, /4, p p, p, p 4 + = 4 = + + /, /, p p, p, p = = + + inecomposable Table : Transformations of hypergeometric functions with free parameter groups are mentione in the previous subcase; their transformations are consiere in Section 5. Equations with finite iheral monoromy groups are consiere in Section. Equations with the tetraheral, octaheral or icosaheral projective monoromy groups are characterize in Section 7. /k + /k + /k =. Non-trivial hypergeometric solutions of H are incomplete elliptic integrals, see Section 8. The egree is unboune, ifferent transformations with the same branching pattern are possible. Most interesting transformations pull-back the equation H into itself, so that H = H ; these transformations come from enomorphisms of the corresponing elliptic curve. /k + /k + /k <. Here we have transformations of hyperbolic hypergeometric functions, see Section 9. The list of these transformations is finite, the maximal egree of their coverings is 4. Existence of some of these transformations is shown in [Ho8], [Beu0], [AK0]. The egree of transformations is etermine by formula, except in the case of incomplete elliptic integrals. If all local exponent ifferences are real numbers in the interval 0, ], the covering ϕ : P x P z is efine over R an it branches only above {0,, } P z, then it inuces a tessellation of the Schwarz triangle for H into Schwarz triangles for H, as outline in [Ho8, Beu0] or [Vi05, Section ]. Recall that a Schwarz triangle for a hypergeometric equation is the image of the upper half-plane uner a Schwarz map for the equation. The escribe tessellation is calle Coxeter ecomposition. If it exists, formula can be interprete nicely in terms of areas of the Schwarz triangles for H an H in the spherical or hyperbolic metric. Out of the classical transformations, only the cubic transformation with the branching pattern = = + + oes not allow a Coxeter ecomposition; see formula below. The following sections form an overview of algebraic transformations for ifferent types of Gauss hypergeometric functions. We also mention some three-term ientities with Gauss hypergeometric functions. Non-classical cases are consiere more thoroughly in other articles [Vi08a], [Vi08b], [Vi08c], [Vi05]. 4 Classical transformations Formally, Euler s an Pfaff s fractional-linear transformations [AAR99, Theorem..5] a, b F a, c b c z = z a F z c z c a, b = z b F z c 7 z c a, c b = z c a b F c z. 8 0

11 can be consiere as pull-back transformations of egree. These are the only transformations without restrictions on the parameters or local exponent ifferences of a hypergeometric function uner transformation. In a geometrical sense, they permute the local exponents at z = an z =. In general, permutation of the singular points z = 0, z =, z = an local exponents at them gives 4 Kummer s hypergeometric series solutions to the same hypergeometric ifferential equation. Any three hypergeometric solutions are linearly relate, of course. To present other classical an non-classical transformations, we introuce the following notation. Let p, q, r p, q, r schematically enote a pull-back transformation of egree, which transforms a hypergeometric equation with the local exponent ifferences p, q, r to a hypergeometric equation with the local exponent ifferences p, q, r. The orer of local exponents in a triple is irrelevant. Note that the arrow follows the irection of the covering ϕ : P x P z. The list of classical transformations comes from the ata of Table. Here is the list of classical transformations with inecomposable ϕ, up to Euler s an Pfaff s fractional-linear transformations an the conversion of Lemma.. /, p, q p, q, q. These are classical quaratic transformations. All two-term quaratic transformations of hypergeometric functions can be obtaine by composing or with Euler s an Pfaff s transformations. An example of a three-term relation uner a quaratic transformation is the following see also Remark 5. below, an [Er5,.]: a, b F a+b+ x = Γ a+b+ Γ a Γ a+ b+ Γ F, b x + x Γ a+b+ Γ Γ a Γ b F a+, b+ x. 9 /, /, p /, p, p. These are well-known Goursat s cubic transformations. Two-term transformations follow from the following three formulas, along with Euller s an Pfaff s transformations an application of Lemma. to : a, a+ F 4a+ x = x a a F, a+ 7 x x 4 4a+5 4 x, 0 a, a+ a F 4a+5 x = + x a F, a+ 7 x x 4a+5 + x, a, a+ F x = + x a a F, a+ x 9 x + x. /, /, p p, p, p These are less-known cubic transformations. Let ω enote a primitive cubic root of unity, so ω + ω + = 0. Since singular points of the transforme equation are all the same, there is only one two-term formula up to changing the parameter: a, a+ F a+ x = + ω x a a F, a+ ω+ xx a+ x + ω. A three-term formula is the following see also [Er5,.8]: a, a+ F a+ x = a +ω x a [ Γ a+ Γ a Γ Γa F +ωx Γ a+ Γ a+ a+ +ω x Γ 4 Γa F a, a+, a+ 4 x+ω x+ω x+ω ]. 4 x+ω

12 4 /, /, p /, p, p. These are inecomposable Goursat s transformations of egree 4. Twoterm transformations follow from the following three formulas, if we compose them with Euller s an Pfaff s transformations an apply Lemma. to 7: 4a F, 4a+ 4a+ x = 8x a a F, a+ 4 x x 9 4a+5 9 8x, 5 4a F, 4a+ a 4a+5 x = + 8x a F, a+ 4 x x 4a+5 + 8x, 4a F, 4a+ a x = x a F, a x 8 + x 4 x. 7 As recore in Table, there are four ways to compose quaratic an cubic transformations to higher egree transformations of hypergeometric functions. This gives three ifferent pull-back transformations of egree 4 an. The composition transformations can be schematically represente as follows: /, /4, p /, /, p /, /, p /, /, p /, p, p p, p, p, /, p, p p, p, 4p, /, p, p p, p, p, /, /, p p, p, p. The last two compositions shoul prouce the same covering, since computations show that the pull-back /, /, p p, p, p is unique up to fractional-linear transformations; see [Vi05, Section ]. Inee, one may check that the ientity a, a+ a F 4a+ x = x + x a F, a+ 7 x x 4a+5 4 x x+ 8 is a composition of an, an also a composition of, an. compositions use ifferent types of cubic transformations. Note that these two 5 Hypergeometric equations with two singularities Here we outline transformations of hypergeometric equations with two relevant singularities; their monoromy group is abelian. The explicit classification scheme of Section refers to this case three times. These equations form a special sample of egenerate hypergeometric equations [Vi07]. For the egenerate cases, not all usual hypergeometric formulas for fractional-linear transformations or other classical algebraic transformations may hol, since the structure of 4 Kummer s solutions egenerates; see [Vi07, Table ]. Here we consier only the new case of pull-back transformations of the hypergeometric equations with the cyclic monoromy group. If a Fuchsian equation has the local exponent ifference at some point, that point can be a nonsingular point, an irrelevant singularity or a logarithmic point. Here is how the logarithmic case is istinguishe for hypergeometric equations. Lemma 5. Consier hypergeometric equation 4, an let P {0,, }. Suppose that the local exponent ifference at S is equal to. Then the point S is logarithmic if an only if absolute values of the two local exponent ifferences at the other two points of the set {0,, } are not equal.

13 Proof. Because of fractional-linear transformations, we may assume that S is the point z = 0, an the local exponents there are 0 an. Therefore C = 0. Then the point z = 0 is either a non-singular point or a logarithmic point. It is non-singular if an only if A B = 0. If B = 0, then local exponent ifferences at z = an z = are both equal to A. This lemma implies that a hypergeometric equation has at most two relevant singularities if an only if the local exponent ifference at one of the three points z = 0, z =, z = is, an the local exponent ifferences at the other two points are equal. After applying a suitable fractional-linear transformation to this situation we may assume that the point z = 0 is non-singular. Like in the proof of Lemma 5., we have C = 0 an we may take B = 0. Then we are either in the case n = m = 0 of [Vi07, Section 7 or 8], or in the case n = m = l = 0 of [Vi07, Section 9]. Most of the 4 Kummer s solutions have to be interprete either as the constant or the power function z a. The only interesting hypergeometric function up to Euler s an Pfaff s transformations is the following: + a, F z = z a, if a 0, a z 9 z log z, if a = 0. For general a, pull-back transformation of the consiere hypergeometric equation to a hypergeometric equation branches only above the points z = an z =. Inee, if the covering ϕ : P x P z branches above other point, then these branching points woul be singular by part of Lemma.4, an there woul be at least singular points above {, } P z by part of Lemma.5. To keep the number of singular points own to, the covering ϕ shoul branch only above {, }. Up to fractional-linear transformations on P x, these coverings have the form z x, or z x φ x, where φ x = x. 0 x Note that φ x is a polynomial of egree. A corresponing hypergeometric ientity is + a, F x = φ x + a, F x φ x. This transformation is obvious from the explicit expressions in 9. Formally, we aitionally have a continuous family z β + βz of fractional-linear pull-back transformations which fix the two points z = an z =. However, they o not give interesting hypergeometric ientities since Kummer s series at those two points are trivial. If a = /k for an integer k >, there are more pull-back transformations of hypergeometric equations with the local exponent ifferences, a, a. In this case, the monoromy group is a finite cyclic group, of orer k. Pull-backe equations will have a cyclic monoromy group as well, possibly of smaller orer. On the other han, the mentione Klein s theorem [Kle77] implies that any hypergeometric equation with a cyclic monoromy group of orer k is a pull-back of a hypergeometric equation with the local exponent ifferences, /k, /k. These pull-back transformations can be easily compute from explicit terminating solutions of the target ifferential equation. Accoring to [Vi07, Section 7], a general hypergeometric equation with a completely reucible but non-trivial monoromy representation has the local exponents m + n +, a, a + n m, where a Z an n, m Z are non-negative. A basis of terminating solutions is n, a m F m, a n m n z, z a F m n z.

14 The monoromy group is finite cyclic if a = l/k with co-prime positive k, l Z. The terminating solutions can be written as terminating hypergeometric series at z = as well: n, a m F m n z = + a n m! n, a m F m + n! + a z, etc. The quotient of two solutions in efines a Schwarz map for the hypergeometric equation. In the simplest case n = m = 0, a = /k, the Schwartz map is just z /k. Klein s pull-back transformation for, /k, /k m+n+, l/k, l/k +n m is obtaine from ientification of the two Schwarz maps. The pull-back covering is efine by / n, l/k m k z x l F m, l/k n m n x k F m n x. The Schwarz maps or pairs of hypergeometric solutions are ientifie here by the corresponing local exponents at x = place above z = an the same value at x = 0 place above x = 0. The egree of the transformation is equal to maxnk + l, mk, by formula as well. Besies, z Ox n+m+ at x = 0 by the require branching pattern. In particular, / x x = x l/k + Ox n+m+ 4 F m, l/k n m n F n, l/k m m n at x = 0, hence the quotient of two hypergeometric polynomials is the Paé approximation of x l/k of precise egree m, n. For example, the Pae approximation of x of egree, is 4 x/4 x. Hence the following pullback must give a transformation, /, /, /, /: z x x 4 x 4. A corresponing hypergeometric ientity is /, F 4 x = 4 /, 4 x F x x 4. 5 Transformation is Klein s pull-back transformation if gck, l =. Otherwise the transforme hypergeometric equation has a smaller monoromy group. These transformations must factor via 0 with = gck, l, an Klein s transformation between equations with the smaller monoromy group. Even l/k Z can be allowe if the transforme equation has no logarithmic points. The conition for that is l/k > m; see [Vi07, Corollary. part ]. Uner this conition, one may even allow k = an consier transformations,, l+n m + n +, l, l + n m. All hypergeometric equations with the trivial monoromy group can be obtaine in this way, by Klein s theorem. Solutions of these hypergeometric equations are analyze in [Vi07, Section 8]. A hypergeometric equation with the local exponent ifferences,, can be transforme to y = 0 by fractional-linear transformations. We unerscore that transformation specializes nicely even for k = if only logarithmic solutions are not involve; the corresponing two-term hypergeometric ientities are trivial. Remark 5. Algebraic transformations of Gauss hypergeometric functions often hol only in some part of the complex plane, even after stanar analytic continuation. For example, formula is obviously false at x =. Formula hols when Rex < /, as the stanar z-cut, is mappe into the line Rex = / uner the transformation z = 4x x. An extreme example of this kin is the following transformation of a hypergeometric function to a rational function: /, F 4 x x x + x x = x x +. 4

15 This ientity hols in a neighborhoo of x = 0, but it certainly oes not hol aroun x = or x =. Apparently, stanar cuts for analytic continuation for the hypergeometric function isolate the three points x = 0, x =, x =. Note that F /, z = z/z is a two-value algebraic function on P z. Its composition in with the egree rational function apparently consists of two isjoint branches. The secon branch is the rational function x /x, which is the correct evaluation of the left-han sie of aroun the points x =, x = check the power series. Many ientities like can be prouce for hypergeometric functions of this section with /a Z. The pull-backe hypergeometric equations shoul be Fuchsian equations with the trivial monoromy group. More generally, any algebraic hypergeometric function can be pull-backe to a rational function. Other algebraic hypergeometric functions are consiere in the following two sections. Three-term hypergeometric ientities may also have limite region of valiity. But it may happen that branch cuts of two hypergeometric terms cancel each other in a three-term ientity. For example, stanar branch cuts for the hypergeometric functions on the right-han sie of 9 are the intervals [, an, 0] on the real line. But ientity 9 is vali on C \ [,, if we agree to evaluate the right-han consistently on the interval, 0]: either using analytic continuation of both terms from the upper half-plane, or from the lower half-plane. Diheral functions Hypergeometric equations with infinite or finite iheral monoromy group are characterize by the property that two local exponent ifferences are rational numbers with the enominator. By a quaratic pull-back transformation, these equations can be transforme to Fuchsian equations with at most 4 singularities an with a cyclic monoromy group. Explicit expressions an transformations for these functions are consiere thoroughly in [Vi08a]. Here we look at transformations of hypergeometric equations which have two local exponent ifferences equal to /. The explicit classification scheme of Section refers to this case twice. The starting hypergeometric equation for new transformations has the local exponent ifferences /, /, a. Hypergeometric solutions of such an equation can be written explicitly. In particular, quaratic transformation with b = a + implies Other explicit formulas are a F, a+ F a+, a+ a F, a+ a + z z z = a + z. 7 = z a + + z a, 8 z a + z a = a, if a 0, z z log + 9 z z, if a = 0. General iheral Gauss hypergeometric functions are contiguous to these F functions. As shown in [Vi08a], explicit expressions for them can be given in terms of terminating Appell s F or F series. For example, generalizations of 7 8 are a F, a+ + l a + k + l + z a k l + z = z k/ k +, l + ; k, l F z a + k + l + z, 5 z, 40

16 a+ n n a F, a+ + n m z = + z a + z a a; m, n F z m, n + z, + z a; m, n F z m, n, z z. 4 Here m, n are assume to be non-negative integers. For general a, there are two types of transformations: /, /, a /, /, a. These are the only transformations to a iheral monoromy group as well, as there is a singularity above the point with the local exponent ifference a. Ientification of explicit Schwarz maps gives the following recipe for computing the pull-back coverings ϕ : P x P z. Expan + x in the form θ x + θ x x with θ x, θ x C[x]. Then ϕx = x θx/θ x gives a pull-back transformation of iheral hypergeometric equations. Explicitly, θ x = θ x = / k=0 / k=0 x k = F k k+, x, x k = F, x. A particular transformation of hypergeometric functions is the following: a F, a+ a x = θ x a F, a+ x θ x θ x. 4 It is instructive to check this transformation using 8. Other transformations from the same pullback covering are given in [Vi08a, Section ]. Particularly interesting are the following formulas; they hol for o or even, respectively: F a, a F a, a x x The branching pattern of ϕx is = F a, a = F a, a x F, + / x, x x F, + / x = = , if is o, = = , if is even. /, /, a l, la, l a, an = l is even. These are transformations to hypergeometric equations of Section 5. They are compositions of the mentione quaratic transformation an the transformations /, /, a /, /, a or, a, a, a, a escribe above. If a = /k with k a positive integer, the monoromy group is the finite iheral group with k elements, an hypergeometric solutions are algebraic. Klein s theorem [Kle77] implies that any hypergeometric equation with a finite iheral monoromy group is a pull-back from a hypergeometric equation with the local exponent ifferences /, /, /k an the same monoromy group. The pull-back transformation can be compute by the similar metho: ientification of explicit Schwarz maps, using the mentione explicit evaluations with terminating Appell s F or F series. That leas to expressing a polynomial in x in the form θ x + xθ x as above.

17 Theorem. Let k, l, m, n be positive integers, an suppose that k, gck, l =. Let us enote m +, n + ; m, n Gx = x m/ F x + + l/k x, + x. This is a polynomial in x. We can write + x l Gx k = Θ x + x m+ Θ x, so that Θ x an Θ x are polynomials in x. Then the rational function Φx = x m+ Θ x /Θ x efines Klein s pull-back covering /, /, /k m + /, n + /, l/k. The egree of this rational function is equal to m + nk + l. Proof. This is Theorem 7. in [Vi08a]. The conition gck, l = can be replace by the weaker conition l/k Z, but then the transforme hypergeometric equation has a smaller iheral monoromy group, an it factors via the transformation in 4 with = gck, l. Even more, l/k Z can be allowe, if the transforme equation has no logarithmic solutions. Sufficient an necessary conitions for that are given in [Vi08a, Theorem.]. The branching pattern for all these coverings has the following pattern: Above the two points with the local exponent ifference /, there are two points with the branching orers m +, n +, an the remaining points are simple branching points. Above the point with the local exponent ifference /k, there is one point with the ramification orer l, an m + n points with the ramification orer k. Any covering /, /, /k m + /, n + /, l/k is unique up to fractional-linear transformations, as Schwarz maps are ientifie uniquely. Transformations from the local exponent ifferences /, /, /k to hypergeometric equations with finite cyclic monoromy groups are either the mentione egeneration l/k Z, or compositions with the quaratic transformation /, /, /k, /k, /k. Other transformations involving iheral Gauss hypergeometric functions are special cases of classical transformations. For the purposes of Theorem., the function Gx can be alternatively efine as follows: m+n+l l/k m n; m, n + x F k x m, n + x, +. 4 x The two efinitions iffer by a constant multiple. The F an F sums are relate by reversing the orer of summation in both irections in the rectangular sums, as note in [Vi08a]. For an example, consier the case n =, m = 0, l = of Theorem.. To compute the transformation /, /, /k k+ /, /, /k we nee to expan k x + x = θ x + x / θ 4 x. k Straightforwar computation shows that k θ x = F, k+ x / k, θ 4 x = k k k F, k x 5/ k. 44 A transformation of hypergeometric functions is k F, k x = θ x /k k F, k 7 x θ 4 x θ x. 45

18 On the other han, F k, k k z = k z k + z /k by formula 40. Note that the construction in 44 breaks own if k = ; a hypergeometric equation with the local exponent ifferences /, /, has logarithmic solutions. As compute in [Vi08a, Section 7], the polynomials Θ x, Θ x of Theorem. in the case n =, m = 0, l = can be expresse as terminating F series. 7 Algebraic Gauss hypergeometric functions Algebraic Gauss hypergeometric functions form a classical subject of mathematics. These functions were classifie by Schwarz [Sch7]. Recall that a Fuchsian equation has a basis of algebraic solutions if an only if its monoromy group is finite. Finite projective monoromy groups for secon orer equations are either cyclic, or iheral, or the tetraheral group isomorphic to A 4, or the octaheral group isomorphic to S 4, or the icosaheral group isomorphic to A 5. An important characterization of secon orer Fuchsian equations with finite monoromy group was given by Klein [Kle77, Kle78]: all these equations are pullbacks of a few stanar hypergeometric equations with algebraic solutions. In particular, this hols for hypergeometric equations with finite monoromy groups. The corresponing stanar equation epens on the projective monoromy group: Secon orer equations with a cyclic monoromy group are pull-backs of a hypergeometric equation with the local exponent ifferences, /k, /k, where k is a positive integer. Klein s transformations to general hypergeometric equations with a cyclic monoromy group are consiere in Section 5 above. Secon orer equations with a finite iheral monoromy group are pull-backs of a hypergeometric equation with the local exponent ifferences /, /, /k, where k. Klein s transformations to general hypergeometric equations with a iheral monoromy group are consiere in Section above. Secon orer equations with the tetraheral projective monoromy group are pull-backs of a hypergeometric equation with the local exponent ifferences /, /, /. Hypergeometric equations with this monoromy group are contiguous to hypergeometric equations with the local exponent ifferences /, /, / or /, /, /. Secon orer equations with the octaheral projective monoromy group are pull-backs of a hypergeometric equation with the local exponent ifferences /, /, /4. Hypergeometric equations with this monoromy group are contiguous to hypergeometric equations with the local exponent ifferences /, /, /4 or /, /4, /4. Secon orer equations with the icosaheral projective monoromy group are pull-backs of a hypergeometric equation with the local exponent ifferences /, /, /5. Hypergeometric equations with this monoromy group are contiguous to hypergeometric equations with the local exponent ifferences /, /, /5, /, /, /5, /, /5, /5, /, /, /5, /, /, /5, /, /5, /5, /, /5, /5, /, /5, /5, /5, /5, 4/5 or /5, /5, /5. A general algorithm for computation of Klein s coverings is given in [vhw05]. The algorithm is base on fining semi-invariants of the monoromy group by solving appropriate symmetric powers of the given secon orer ifferential equation. A more effective algorithm specifically for hypergeometric equations with finite monoromy groups is given in [Vi08b]. This algorithm is base on ientification of explicit Schwarz maps for the given an the corresponing stanar hypergeometric equation. 8

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie

More information

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

arxiv: v1 [math.co] 15 Dec 2017

arxiv: v1 [math.co] 15 Dec 2017 Rectilinear Crossings in Complete Balance -Partite -Uniform Hypergraphs Rahul Gangopahyay Saswata Shannigrahi arxiv:171.05539v1 [math.co] 15 Dec 017 December 18, 017 Abstract In this paper, we stuy the

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Classical Mechanics Examples (Lagrange Multipliers)

Classical Mechanics Examples (Lagrange Multipliers) Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the

More information

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.

More information

2-connected graphs with small 2-connected dominating sets

2-connected graphs with small 2-connected dominating sets 2-connecte graphs with small 2-connecte ominating sets Yair Caro, Raphael Yuster 1 Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel Abstract Let G be a 2-connecte graph. A

More information

Linear First-Order PDEs

Linear First-Order PDEs MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 9 Lecture 2 Linear First-Orer PDEs The most general first-orer linear PDE has the form a(x, y)z x + b(x, y)z y + c(x, y)z = (x, y), (1) where a, b,

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

Learning convex bodies is hard

Learning convex bodies is hard Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples

More information

Exercises of PIV. incomplete draft, version 0.0. October 2009

Exercises of PIV. incomplete draft, version 0.0. October 2009 Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary

More information

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple

More information

Solutions to Tutorial 1 (Week 8)

Solutions to Tutorial 1 (Week 8) The University of Syney School of Mathematics an Statistics Solutions to Tutorial 1 (Week 8) MATH2069/2969: Discrete Mathematics an Graph Theory Semester 1, 2018 1. In each part, etermine whether the two

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

Table-based division by small integer constants

Table-based division by small integer constants Table-base ivision by small integer constants Florent e Dinechin, Laurent-Stéphane Diier LIP, Université e Lyon (ENS-Lyon/CNRS/INRIA/UCBL) 46, allée Italie, 69364 Lyon Ceex 07 Florent.e.Dinechin@ens-lyon.fr

More information

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 03 series 0607 CAMBRIDGE INTERNATIONAL MATHEMATICS 0607/4 Paper 4 (Extene), maximum

More information

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS PAPA CAMBRIDGE CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 0 series CAMBRIDGE INTERNATIONAL MATHEMATICS /4 4 (Extene), maximum

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

Implicit and Explicit Functions

Implicit and Explicit Functions 60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible

More information

Try It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x

Try It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x SECTION 5 Implicit Differentiation Section 5 Implicit Differentiation Distinguish between functions written in implicit form an eplicit form Use implicit ifferentiation to fin the erivative of a function

More information

4.2 Implicit Differentiation

4.2 Implicit Differentiation 6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable

More information

Polygon Simplification by Minimizing Convex Corners

Polygon Simplification by Minimizing Convex Corners Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University

More information

6 Gradient Descent. 6.1 Functions

6 Gradient Descent. 6.1 Functions 6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output

More information

Chapter 1. Math review. 1.1 Some sets

Chapter 1. Math review. 1.1 Some sets Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

Properties of the Derivative Lecture 9.

Properties of the Derivative Lecture 9. Properties of the Derivative Lecture 9. Recall that the average rate of change of a function y = f(x) over the interval from a to a + h, with h 0, is the slope of the line between y x f(a + h) f(a) =,

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

Surfaces Beyond Classification

Surfaces Beyond Classification Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

Math 131. Implicit Differentiation Larson Section 2.5

Math 131. Implicit Differentiation Larson Section 2.5 Math 131. Implicit Differentiation Larson Section.5 So far we have ealt with ifferentiating explicitly efine functions, that is, we are given the expression efining the function, such as f(x) = 5 x. However,

More information

Large Monochromatic Components in Two-colored Grids

Large Monochromatic Components in Two-colored Grids Large Monochromatic Components in Two-colore Gris Jiří Matoušek 1 Aleš Přívětivý 2 Department of Applie Mathematics 1,2 an Institute of Theoretical Computer Science (ITI) 1 Charles University Malostranské

More information

B-Splines and NURBS Week 5, Lecture 9

B-Splines and NURBS Week 5, Lecture 9 CS 430/585 Computer Graphics I B-Splines an NURBS Week 5, Lecture 9 Davi Breen, William Regli an Maxim Peysakhov Geometric an Intelligent Computing Laboratory Department of Computer Science Drexel University

More information

Divide-and-Conquer Algorithms

Divide-and-Conquer Algorithms Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:

More information

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA Chapter 1 : BioMath: Transformation of Graphs Use the results in part (a) to identify the vertex of the parabola. c. Find a vertical line on your graph paper so that when you fold the paper, the left portion

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Lecture 0: Reivew of some basic material

Lecture 0: Reivew of some basic material Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles 2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of

More information

arxiv: v2 [math.co] 5 Jun 2018

arxiv: v2 [math.co] 5 Jun 2018 Some useful lemmas on the ege Szege inex arxiv:1805.06578v [math.co] 5 Jun 018 Shengjie He 1 1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China Abstract The ege Szege inex

More information

Part II. Graph Theory. Year

Part II. Graph Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,

More information

Considering bounds for approximation of 2 M to 3 N

Considering bounds for approximation of 2 M to 3 N Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for

More information

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.

More information

Learning Subproblem Complexities in Distributed Branch and Bound

Learning Subproblem Complexities in Distributed Branch and Bound Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University

More information

LECTURE 13, THURSDAY APRIL 1, 2004

LECTURE 13, THURSDAY APRIL 1, 2004 LECTURE 13, THURSDAY APRIL 1, 2004 FRANZ LEMMERMEYER 1. Parametrizing Curves of Genus 0 As a special case of the theorem that curves of genus 0, in particular those with the maximal number of double points,

More information

Holy Halved Heaquarters Riddler

Holy Halved Heaquarters Riddler Holy Halve Heaquarters Riler Anonymous Philosopher June 206 Laser Larry threatens to imminently zap Riler Heaquarters (which is of regular pentagonal shape with no courtyar or other funny business) with

More information

CONSTRUCTION AND ANALYSIS OF INVERSIONS IN S 2 AND H 2. Arunima Ray. Final Paper, MATH 399. Spring 2008 ABSTRACT

CONSTRUCTION AND ANALYSIS OF INVERSIONS IN S 2 AND H 2. Arunima Ray. Final Paper, MATH 399. Spring 2008 ABSTRACT CONSTUCTION AN ANALYSIS OF INVESIONS IN S AN H Arunima ay Final Paper, MATH 399 Spring 008 ASTACT The construction use to otain inversions in two-imensional Eucliean space was moifie an applie to otain

More information

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting

More information

An Introduction to Belyi Surfaces

An Introduction to Belyi Surfaces An Introduction to Belyi Surfaces Matthew Stevenson December 16, 2013 We outline the basic theory of Belyi surfaces, up to Belyi s theorem (1979, [1]), which characterizes these spaces as precisely those

More information

Module13:Interference-I Lecture 13: Interference-I

Module13:Interference-I Lecture 13: Interference-I Moule3:Interference-I Lecture 3: Interference-I Consier a situation where we superpose two waves. Naively, we woul expect the intensity (energy ensity or flux) of the resultant to be the sum of the iniviual

More information

Hw 4 Due Feb 22. D(fg) x y z (

Hw 4 Due Feb 22. D(fg) x y z ( Hw 4 Due Feb 22 2.2 Exercise 7,8,10,12,15,18,28,35,36,46 2.3 Exercise 3,11,39,40,47(b) 2.4 Exercise 6,7 Use both the direct method and product rule to calculate where f(x, y, z) = 3x, g(x, y, z) = ( 1

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING

PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PAMELA RUSSELL ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. Birchall an Teor prove that

More information

Algebra II: Review Exercises

Algebra II: Review Exercises : Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory

More information

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1

More information

6 Computing Derivatives the Quick and Easy Way

6 Computing Derivatives the Quick and Easy Way Jay Daigle Occiental College Mat 4: Calculus Experience 6 Computing Derivatives te Quick an Easy Way In te previous section we talke about wat te erivative is, an we compute several examples, an ten we

More information

On a Method of Finding Homoclinic and Heteroclinic Orbits in. Multidimensional Dynamical Systems

On a Method of Finding Homoclinic and Heteroclinic Orbits in. Multidimensional Dynamical Systems Applie Mathematics & Information Sciences 4(3) (), 383 394 An International Journal c Diie W Publishing Corporation, U. S. A. On a Metho of Fining Homoclinic an Heteroclinic Orbits in Multiimensional Dynamical

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

(a) Find the equation of the plane that passes through the points P, Q, and R.

(a) Find the equation of the plane that passes through the points P, Q, and R. Math 040 Miterm Exam 1 Spring 014 S o l u t i o n s 1 For given points P (, 0, 1), Q(, 1, 0), R(3, 1, 0) an S(,, 0) (a) Fin the equation of the plane that passes through the points P, Q, an R P Q = 0,

More information

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs

More information

DISCRETE MATHEMATICS

DISCRETE MATHEMATICS DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Integers and Mathematical Induction

Integers and Mathematical Induction IT Program, NTUT, Fall 07 Integers and Mathematical Induction Chuan-Ming Liu Computer Science and Information Engineering National Taipei University of Technology TAIWAN 1 Learning Objectives Learn about

More information

THE DOLD-KAN CORRESPONDENCE

THE DOLD-KAN CORRESPONDENCE THE DOLD-KAN CORRESPONDENCE 1. Simplicial sets We shall now introduce the notion of a simplicial set, which will be a presheaf on a suitable category. It turns out that simplicial sets provide a (purely

More information

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In

More information

Optimal Oblivious Path Selection on the Mesh

Optimal Oblivious Path Selection on the Mesh Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

Pantographic polygons

Pantographic polygons 203 Pantographic polygons John Miller and Emanuel Strzelecki Abstract Necessary and sufficient conditions are given for a polygon to be pantographic. The property is held by all regular polygons and by

More information

A Versatile Model-Based Visibility Measure for Geometric Primitives

A Versatile Model-Based Visibility Measure for Geometric Primitives A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Lab work #8. Congestion control

Lab work #8. Congestion control TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño

More information

COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS

COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS PALLAVI DANI, EMILY STARK AND ANNE THOMAS Abstract. We give explicit necessary and sufficient conditions for

More information

ON SWELL COLORED COMPLETE GRAPHS

ON SWELL COLORED COMPLETE GRAPHS Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

Lecture 11 COVERING SPACES

Lecture 11 COVERING SPACES Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest

More information

Resolutions of the pair design, or 1-factorisations of complete graphs. 1 Introduction. 2 Further constructions

Resolutions of the pair design, or 1-factorisations of complete graphs. 1 Introduction. 2 Further constructions Resolutions of the pair design, or 1-factorisations of complete graphs 1 Introduction A resolution of a block design is a partition of the blocks of the design into parallel classes, each of which forms

More information

Design of Policy-Aware Differentially Private Algorithms

Design of Policy-Aware Differentially Private Algorithms Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft

More information

Montana City School GRADE 5

Montana City School GRADE 5 Montana City School GRADE 5 Montana Standard 1: Students engage in the mathematical processes of problem solving and reasoning, estimation, communication, connections and applications, and using appropriate

More information

11. Differentiating inverse functions.

11. Differentiating inverse functions. . Differentiating inverse functions. The General Case: Fin y x when y f x. Since f y x an we regar y as being a function of x, we ifferentiate both sies of the equation f y x with respect to x using the

More information

Rational functions, like rational numbers, will involve a fraction. We will discuss rational functions in the form:

Rational functions, like rational numbers, will involve a fraction. We will discuss rational functions in the form: Name: Date: Period: Chapter 2: Polynomial and Rational Functions Topic 6: Rational Functions & Their Graphs Rational functions, like rational numbers, will involve a fraction. We will discuss rational

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information

Integrated Algebra 2 and Trigonometry. Quarter 1

Integrated Algebra 2 and Trigonometry. Quarter 1 Quarter 1 I: Functions: Composition I.1 (A.42) Composition of linear functions f(g(x)). f(x) + g(x). I.2 (A.42) Composition of linear and quadratic functions II: Functions: Quadratic II.1 Parabola The

More information

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure

More information

MOTION IDENTIFICATION OF PLANAR FREE-FORM OBJECTS

MOTION IDENTIFICATION OF PLANAR FREE-FORM OBJECTS MOTION IDENTIFICATION OF PLANAR FREE-FORM OBJECTS Mustafa Unel Faculty of Engineering an Natural Sciences Sabanci University Orhanli-Tuzla 34956, Istanbul, Turkey email: munel@sabanciuniv.eu ABSTRACT It

More information

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm NASA/CR-1998-208733 ICASE Report No. 98-45 Parallel Directionally Split Solver Base on Reformulation of Pipeline Thomas Algorithm A. Povitsky ICASE, Hampton, Virginia Institute for Computer Applications

More information

Covalence sequences of planar vertex-homogeneous maps

Covalence sequences of planar vertex-homogeneous maps Discrete Mathematics 307 (2007) 599 614 www.elsevier.com/locate/isc Covalence sequences of planar vertex-homogeneous maps Jana Siagiová a, Mar E. Watins b a Department of Mathematics, Slova University

More information