Radical Solutions of First Order Autonomous Algebraic Ordinary Differential Equations

Size: px
Start display at page:

Download "Radical Solutions of First Order Autonomous Algebraic Ordinary Differential Equations"

Transcription

1 Radical Solutions of First Order Autonomous Algeraic Ordinary Differential Equations Georg Grasegger Johannes Kepler University Linz Doctoral Program Computational Mathematics 4040 Linz, Austria ABSTRACT We present a procedure for solving autonomous algeraic ordinary differential equations AODEs of first order. This method covers the known case of rational solutions and depends crucially on the use of radical parametrizations for algeraic curves. We can prove that certain classes of AODEs permit a radical solution, which can e determined algorithmically. However, this approach is not limited to rational and radical solutions of AODEs. Categories and Suject Descriptors G..7 [Mathematics of computing]: Ordinary differential equations; I.. [Computing methodologies]: Symolic and algeraic manipulation General Terms Algorithms, Theory Keywords Algeraic ordinary differential equations, algeraic curves, radical parametrizations. INTRODUCTION We consider autonomous first order algeraic ordinary differential equations F y, y = 0 and use parametrizations of curves for solving them. Huert [8] already studied solutions of AODEs of the form F x, y, y = 0. She gives a method for finding a asis of the general solution of the equation y computing a Gröner asis of the prime differential ideal of the general component. The solutions, however, are given implicitly. Later Feng and Gao [, 3] started using parametrizations for solving first order autonomous AODEs, i. e. F y, y = 0. They provide an algorithm to actually find Supported y the Austrian Science Fund FWF: W4- N5, project DK Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distriuted for profit or commercial advantage and that copies ear this notice and the full citation on the first page. Copyrights for components of this work owned y others than ACM must e honored. Astracting with credit is permitted. To copy otherwise, or repulish, to post on servers or to redistriute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. ISSAC 4, July 5, 04, Koe, Japan. Copyright 04 ACM /4/07...$ all rational solutions of such AODEs with coefficients in Q y using rational parametrizations of the algeraic curve F y, z = 0. The key fact they are proving is that any rational solution of the AODE gives a proper parametrization of the corresponding algeraic curve. On the other hand, if a proper parametrization of the algeraic curve fulfills some requirements, Feng and Gao can generate a rational solution of the AODE. From the rational solution it is then possile to create a rational general solution y shifting the variale y a constant. Finally Feng and Gao derive an algorithm to compute a rational solution of an AODE, if it exists. By using this approach we can take advantage of the well known theory of algeraic curves and rational parametrizations see for instance [, 3]. Recently Ngô and Winkler [, 4, 3] worked on generalizing the algorithm of Feng and Gao. They considered nonautonomous AODEs F x, y, y = 0. Instead of algeraic curves as in the autonomous case, algeraic surfaces play a role there. For an algorithm to find rational parametrizations of surfaces see [7]. Using a rational parametrization of the surface Ngô and Winkler derive a special kind of system of differential equations. There exist solution methods for these so called associated systems. From a rational solution of such a system they find a rational general solution of the original differential equation in the generic case. Aroca, Cano, Feng and Gao give in [] a necessary and sufficient condition for an autonomous AODE to have an algeraic solution. They also provide a polynomial time algorithm to find such a solution if it exists. This solution, however, is implicit whereas here we try a different approach to find explicit solutions. Furthermore Huang, Ngô and Winkler continue their work and consider higher order equations. A first result can e found in [7]. A generalization of Ngô and Winkler [4] to trivariate systems of ODEs can e found in [5, 6]. Ngô, Sendra and Winkler [, 0] also consider classification of AODEs, i. e. they look for transformations of AODEs which keep the associated system invariant. In this work we stick to the case of first order autonomous AODEs ut try to extend the results to radical solutions using radical parametrizations see Section 3.. We do so y investigating a procedure which can e specified to the rational case see Section 3.. In contrast to the rational case we will not give a complete algorithm ut rather a procedure which in the favorale case yields a result. If a result is computed then it will e a solution of the AODE. On the other hand the procedure might fail and then we cannot draw any conclusion on the solvaility of the AODE.

2 Having computed a single non-trivial solution yx we can get a general solution yx+c for a constant c as shown in []. In Section 3.3 we give examples of non-radical solutions that can e found y the given procedure. Finally in Section 3.4 we look for advantages of the procedure and compare it to existing algorithms.. PRELIMINARIES In the following we descrie the necessary notations and definitions from differential algera and algeraic geometry. Throughout the paper let K e a field of characteristic zero and K its algeraic closure.. Solutions of AODEs Consider the field of rational functions Kx. We will write for the usual derivative d. Then Kx is a differential field. We call Kx{y} the ring of differential poly- dx nomials. The elements of this ring are polynomials in y and its derivatives, i. e. Kx{y} = Kx[y, y, y,...]. An algeraic ordinary differential equation AODE is of the form F x, y, y,..., y n = 0 where F Kx{y} and F is also a polynomial in x. The AODE is called autonomous if F K{y}, i. e. if the coefficients of F do not depend on the variale of differentiation x. For a given AODE we are interested in deciding whether it has rational or radical solutions and, in the affirmative case, determining all of them. Hence, we look for general solutions which are defined as follows. Let Σ e a prime differential ideal in Kx{y}. Then we call η a generic zero of Σ if for any differential polynomial P we have P η = 0 P Σ. Such an η exists in a suitale extension field. Let F e an irreducile differential polynomial of order n. Then {F }, the radical differential ideal generated y F, can e decomposed into two parts. There is one component F where the separant also vanishes. This part represents y n the singular solutions. The component we are interested in is the one where the separant does not vanish. It is a prime differential ideal Σ F := {F } : F and represents the general component see for instance Ritt [6]. A generic zero of y n Σ F is called a general solution of F = 0. We say it is a rational general solution if it is of the form y = a kx k +...+a x+a 0 mx m x+ 0, where the a i and i are constants in some field extension of K. Here we consider only first order AODEs. For solving a differential equation F y, y = 0 we will look at the corresponding curve F y, z = 0 where we replace the derivative of y y a transcendental variale z.. Algeraic Curves An algeraic curve C is a one-dimensional algeraic variety in the affine plane A over a field K, i. e. a zero set of a square-free ivariate non-constant polynomial f K[x, y], C = { a, A fa, = 0 }. We call the polynomial f the defining polynomial. An important aspect of algeraic curves is their parametrizaility. Consider an irreducile plane algeraic curve defined y an irreducile polynomial f. A tuple of rational functions Pt = rt, st is called a rational parametrization of the curve if frt, st = 0 and not oth rt and st are constant. A parametrization can e considered as a map P : A C from the affine line A onto the curve C. By ause of notation we also call this map a parametrization. Later we will see other kinds of parametrizations. We call a parametrization P proper if it is a irational map or in other words if for almost every point x, y on the curve we find exactly one t such that Pt = x, y. In the procedure we will assume that the input is a radical parametrization. The research area of radical parametrizations is rather new. Sendra and Sevilla [9] recently pulished a paper on parametrizations of curves using radical expressions. In this paper Sendra and Sevilla define the notion of radical parametrization and they provide algorithms to find such parametrizations in certain cases which include ut are not restricted to curves of genus less or equal 4. Every rational parametrization will e a radical one ut oviously not the other way round. Further considerations of radical parametrizations can e found in Schicho and Sevilla [8] and Harrison [4]. There is also a paper on radical parametrization of surfaces y Sendra and Sevilla [0]. Nevertheless, for the eginning we will restrict to the case of first order autonomous equations and hence to algeraic curves. Definition. Let K e an algeraically closed field of characteristic zero. A field extension K L is called a radical field extension iff L is the splitting field of a polynomial of the form x k a K[x], where k is a positive integer and a 0. A tower of radical field extensions of K is a finite sequence of fields K = K 0 K K... K m such that for all i {,..., m}, the extension K i K i is radical. A field E is a radical extension field of K iff there is a tower of radical field extensions of K with E as its last element. A polynomial hx K[x] is solvale y radicals over K iff there is a radical extension field of K containing the splitting field of h. Let now C e an affine plane curve over K defined y an irreducile polynomial fx, y. According to [9], C is parametrizale y radicals iff there is a radical extension field E of Kt and a pair rt, st E \ K such that frt, st = 0. Then the pair rt, st is called a radical parametrization of the curve C. We call a function fx over K a radical function if there is a radical extension field of Kx containing fx. Hence, a radical solution of an AODE is a solution that is a radical function. A radical general solution is a general solution which is radical. Computing radical parametrizations as in [9] goes ack to solving algeraic equations of degree less or equal four. Depending on the degree we might therefore get more than one solution to such an equation. Each solution yields one ranch of a parametrization. Therefore, we use the notation a n for any n-th root of a. In fact we do not need to restrict to rational or radical parametrizations. More generally a parametrization of f is a generic zero of the the prime ideal generated y f in the sense of van der Waerden []. 3. A PROCEDURE FOR SOLVING FIRST ORDER AUTONOMOUS AODES Let F y, y = 0 e an autonomous AODE. We consider the corresponding algeraic curve F y, z = 0. Then oviously P yt := yt, y t for a non-trivial, i. e. non-

3 constant solution y of the AODE is a parametrization of F not necessarily rational or radical. For an aritrary parametrization Pt = rt, st we define A Pt := st. If it is clear which parametrization r t is considered, we might also write A. Suppose we are given any parametrization P of F and we want to find a solution of the AODE. We assume the parametrization is of the form P gt = rt, st = ygt, y gt where g and y are unknown. This assumption is motivated y the fact that in the rational case each proper parametrization can e otained from any other proper one y a linear rational transformation of the variale. If we can find g and especially its inverse function we also find y. For our given P g we can compute A Pg and furthermore we have A Pg t = y gt d ygt = y gt g ty gt = g t. dt Hence, y reformulation we get an expression for the unknown g : g t = A Pg t. Using integration and inverse functions the procedure continues as follows gt = g tdt = A Pg t dt, yx = rg x. Kamke [9] already mentions such a procedure where he restricts to continuously differential functions r and s which satisfy F rt, st = 0. However, he does not mention where to get these functions from. In general g is not a ijective function. Hence, when we talk aout an inverse function we actually mean one ranch of a multivalued inverse. Each ranch inverse will give us a solution to the differential equation. We might add any constant c to the solution of the indefinite integral. Assume gt is a solution of the integral and g its inverse. Then also ḡt = gt + c is a solution and ḡ t = g t c. We know that if yx is a solution of the AODE, so is yx + c. Hence, we may postpone the introduction of c to the end of the procedure. We summarize the procedure for the case of radical parametrizations and solutions Procedure. Input: an autonomous AODE defined y F y, y = 0 and a radical parametrization Pt = rt, st of the corresponding curve. Output: a general solution y of F or fail.. Compute A Pt = st r t.. Compute gt = A P t dt. 3. Compute g. 4. If g is not radical return fail, else return rg x + c. The procedure finds a solution if we can compute the integral and the inverse function. On the other hand it does not give us any clue on the existence of a solution in case either part does not work. Neither do we know whether we found all solutions. 3. Rational solutions Feng and Gao [] found an algorithm for computing all rational general solutions of an autonomous first order AODE. They use the fact that yx, y x is a proper rational parametrization. The main part of their algorithm says that there is a rational general solution if and only if for any proper rational parametrization Pt = rt, st we have that A Pt = q Q or A Pt = at with a, Q. The solutions therefore are rqx + c or r respectively. ax+c We will show now that the algorithm accords with our procedure. Assume we are given an AODE with a proper parametrization Pt = rt, st. Assume further that A Pt = q Q or A Pt = at. Then we get from the procedure A Pt = q, A Pt = at, g t = q, g t = at, gt = t q + c, gt = at + c, g t = qt c, g t = + at c. at c We see that rg t is exactly what Feng and Gao found aside from the sign of c. As mentioned aove, our procedure does not give an answer to whether the AODE has a rational solution in case A is not of this special form. It might, however, find non rational solutions for some AODEs. Nevertheless, Feng and Gao [] already proved that there is a rational general solution if and only if A is of the special form mentioned aove and all rational general solutions can e found y the algorithm. 3. Radical solutions Now we extend our set of possile parametrizations and also the set, in which we are looking for solutions, to functions including radical expressions. We will see that the procedure yields information aout solvaility in some cases. Theorem. Let Pt = rt, st e a radical parametrization of the curve F y, z = 0. Assume A Pt = a+t n for some n Q \ {}, a 0. Then rhx, with hx = + n ax + c n, is a radical general solution of the AODE F y, y = 0. Proof. From the procedure we get g t = A P t = a + t, n gt = g + t n tdt = a n, g t = + n at n. Then yx = rg x is a solution of F. Let hx = g x + c for some constant c. Then rhx is a general solution of F. The algorithm of Feng and Gao is therefore a special case of this one with n = 0 or n = using rational parametrizations. In exactly these two cases g is a rational function. Furthermore, Feng and Gao [] showed that all rational solutions can e found like this, assuming the usage of a rational parametrization. The existence of a rational parametrization is of course necessary to find a rational solution.

4 However, in the procedure we might use a radical parametrization of the same curve which is not rational and we can still find a rational solution. In Theorem n = is excluded ecause in this case the function g contains a logarithm and its inverse an exponential term. Example. The equation y 5 y = 0 gives rise to the radical parametrization, with corresponding At = t t 5/ t. We can compute gt = t3/ and g t = 3 /3 t / Hence, /3 is a solution of the AODE. x+c /3 As a corollary of Theorem we get the following statement for AODEs where the parametrization yields another form of A. Corollary. Let F y, y = 0 e an autonomous AODE. Assume we have a radical parametrization Pt = rt, st of the corresponding curve F y, z = 0 and assume At = a+t k n kt k with k Q. Then F has a radical solution. Proof. By transforming the parametrization y ft = t /k to the radical parametrization Pt = rft, sft we compute A Pt = t sft Aft = rft f t = a + t k k n kt k k t k k k = a + t n, which can e solved y Theorem. = a + ftk n kft k f t In the rational situation there were exactly two possile cases for A in order to guarantee a rational solution. Here, in contrast, there are more possile forms for A. In the following we will see another rather simple form of A which might occur. In this case we do not know immediately whether or not the procedure will lead to a solution. Theorem. Let Pt = rt, st e a radical parametrization of the curve F y, z = 0. Assume At = atn for +t m some a, Q\{0} and m, n Q with m n and n. Then the AODE F y, y = 0 has a radical solution if the equation m n + h n n h m n+ + n m n + at = 0 has a non-zero radical solution for h = ht. solution of the AODE is then rhx + c. Proof. The procedure yields A general g t = A = + tm Pt at, n gt = g tdt = a t n n + t m. + m n The inverse of g can e found y solving the equation a ht n n + htm = t + m n for ht. By a reformulation and the assumptions for m and n this is equivalent to. In case we have n = or m = n the integral is not radical. Example. For the AODE y 5 y + y 8 y = 0 we compute the radical parametrization Pt =, t 3 with cor- t t 8 responding At = t5. Then equation has a solution, +t 8 e. g. t + 4t /4. Hence, we get the solution of the AODE: x + c /4. 4x + c It remains to show when is solvale y radicals i. e. when gt in the proof of Theorem has an inverse which is expressile y radicals. The following theorem due to Ritt [5] will help us to do so. Theorem 3. A polynomial g has an inverse expressile y radicals if and only if it can e decomposed into linear polynomials, power polynomials x n for n N, Cheyshev polynomials and degree 4 polynomials. Certainly also polynomials of degree and 3 are invertile y radicals ut it can e shown, that Theorem 3 applies to them. We will show now that a certain polynomial is not decomposale into non-linear factors. Theorem 4. Let gt = C t α + C t β K[t] where K is a field of characteristic zero, C, C K \ {0}, α, β N, gcdα, β = and β > α > 0 and β > 4. Assume g = fh for some polynomials f and h. Then deg f = or deg h =. Proof. Assume gt = fht with f = n i=0 aixi and h = m k=0 kx k and a n 0, m 0, m, n >. In case 0 0 it follows that gt = f ht where ft = f 0 + t and ht = ht 0. Hence, without loss of generality we can assume that 0 = 0 and therefore also a 0 = 0. We denote the coefficient of a polynomial g of order k y coef k g. Let now τ {,..., m} such that τ 0 and l = 0 for all l {,..., τ }. Similarly let π {,..., n} such that a π 0 and a l = 0 for all l {,..., π }. This implies that coef l g = 0 for all l {,..., τπ } and coef τπg = a π π τ 0. Hence, α = τπ. Assume now that π < n. Then α = τπ < mn + l and therefore 0 = coef mn +l g = coef mn +l = na n n m l + ε E m n a n jx j j=τ n ε l+,..., ε m a n m j=l+ for all l {τ,..., m } where ε = ε l+,..., ε m and { } m m E = ε ε k = n, kε k = mn + l. k=l+ k=l+ This yields, that 0 = coef mn g = na n n m m, hence, m = 0. By induction it follows that l = 0 for all l {τ,..., m } which contradicts τ 0. Therefore, τ = m or π = n. But then we have m α and m β or n α and n β which contradicts gcdα, β = since m, n. ε j j

5 Let us now consider the function gt = a t n n + t m + m n from the proof of Theorem. In general g is not a polynomial. Our aim is to find a radical function h with a radical inverse such that ḡ = gh is a polynomial. Then g has a radical inverse if and only if ḡ has a radical inverse. Assume that n = z d and m n+ = z d with z, z Z, d, d N such that gcdz, d = gcdz, d =. Then gt = ḡht where ht = t d d and ḡt = t n a n + t m n + m n with exponents n = nd d, m = m n+d d and d = d d gcdz d, z d. Hence, m, n are integers with gcd m, n =. The function h has an inverse expressile y radicals. If m n +, n are positive integers, then also m, n are positive. On the other hand if n m, n N we get a polynomial y a decomposition with ft = t. If not oth n and m are positive and not oth are negative ut m + n 4, computing the inverse function of ḡ is the same as solving an equation of degree less or equal 4, which can e done y radicals. We summarize this discussion using Theorem 3 and 4 as follows. Corollary. The function g from the proof of Theorem, gt = a t n n + t m, + m n has an inverse expressile y radicals in the following cases where we use the notation from aove: = 0, m, n N and max m, n 4, m, n N and max m, n 4, m, n N and m + n 4, m, n N and m + n 4. It has no inverse expressile y radicals in the cases m, n N and max m, n > 4, m, n N and max m, n > 4. Proof. In the cases where m and n have the same sign and m + n > 4 the function ḡ as discussed aove fulfills the requirements of Theorem 4. Hence, if ḡ = f f either f or f is of degree one. It is not difficult to show, that the other one can neither e a power polynomial nor a Cheyshev polynomial. Hence, y the Theorem of Ritt ḡ has no radical inverse. The case where = 0 is ovious. In all the other cases mentioned in the Theorem and not discussed so far we end up in solving an algeraic equation of degree less or equal four and hence, there is a radical inverse. Hence, in some cases we are ale to decide the solvaility of an AODE with properties as in Theorem. Nevertheless, the procedure is not complete, since even Corollary does not cover all possile cases for m and n. d 3.3 Non-Radical solutions So far we were looking for rational and radical solutions of AODEs. However, the procedure is not restricted to the radical case ut might also solve some AODEs with nonradical solutions as we can see in the following examples where trigonometric and exponential solutions are found. Example 3. Consider the equation y 3 + y + y = 0. The corresponding curve has the parametrization P t = t, t t. We get At = + t and hence, gt = arctant. The inverse function is g t = tan t and thus, yx = tan x+c is a solution. Example 4. Consider the AODE y + y + yy + y = 0. We get the rational parametrization, t. +t +t With At = t + t we compute gt = logt + log + t and hence g t =, which leads to the +e t/ solution e x+c + e x+c/. These examples show that we can find non-radical solutions even with rational parametrizations. 3.4 Comparison In many ooks on differential equations we can find a method for transforming an autonomous ODE of any order F y, y,..., y n = 0 to an equation of lower order y sustituting uy = y see for instance [4, 9]. For the case of first order ODEs this method yields a solution. It turns out that this method is somehow related to our procedure. The method does the following: Sustitute uy = y, Solve F y, uy = 0 for uy, Solve dy = x for y. uy These computations are a special case of our general procedure where a specific form of parametrization is used, i. e. Pt = t, st. We will now give some arguments concerning the possiilities and enefits of the general procedure. Since in the procedure any radical parametrization can e used we might take advantage of picking a good one as we will see in the following example. Example 5. We consider the AODE y yy 7 and find a parametrization of the form t, st: t3 + 8 /3 588t t, t /6 Neither Mathematica 8 nor Maple 6 can solve the corresponding integral explicitly and hence, the procedure stops. Furthermore, neither of them is capale of solving the differential equation in explicit form y the uilt in functions for solving ODEs. Nevertheless, we can input another parametrization to our procedure. An ovious one to try next is 7 + t6 rt, st =, t. 49t

6 It turns out that here we get gt = 4t3. Its inverse t 3 47 can e computed g t = /3 47t t. Applying g x + c to rt we get the solution 7 47x + c x + c 64 yx = 47x + c 7 / x + c 49 4 The procedure might find a radical solution of an AODE y using a rational parametrization as we have seen in Example and 5. As long as we are looking for rational solutions only, the corresponding curve has to have genus zero. Now we can also solve some examples where the genus of the corresponding curve is higher than zero and hence there is no rational parametrization. The AODE in Example 6 elow corresponds to a curve with genus. Example 6. Consider the AODE y 3 4y 5 + 4y 7 y 8y y + 8y 4 y + 8yy = 0. We compute a parametrization and get t, 4 + 4t + t 4 t 4t 4t 4 t 6 6t 4 + 6t 8 + 8t 0 + t as one of the ranches. The procedure yields t 4 + 4t + t 4 At = 4t 4t 4 t 6 6t 4 + 6t 8 + 8t 0 + t, gt = t4 + t 6 + t 4 + t 4 + 4t + t 4, 4t + t 4 g + t t =, + t + c + x yx =. + c + x Again Mathematica 8 cannot compute a solution in reasonale time and Maple 6 only computes constant and implicit ones. 4. CONCLUSION We have introduced a procedure for solving autonomous first order ordinary differential equations. The procedure works in a given class of expressions if we can compute a certain integral and an inverse function in this class. In case of looking for rational solutions it does exactly what was known efore. Furthermore, we have found some cases in which we find radical solutions. However, these cases are not yet complete and hence, this part is suject to further investigation. In case the procedure works, we have one or more solutions of the AODE. So far we do not know, whether we have all. Neither do we know anything aout solvaility of the AODE if the procedure does not work. We have seen that the choice of parametrization makes a difference. The influence of the choice of parametrization on the solvaility of the integration and inversion prolem is also a topic for further investigation. 5. ACKNOWLEDGMENTS The author cordially thanks Franz Winkler and J. Rafael Sendra for their valuale support during this work. 6. REFERENCES [] J. M. Aroca, J. Cano, R. Feng, and X.-S. Gao. Algeraic General Solutions of Algeraic Ordinary Differential Equations. In M. Kauers, editor, Proceedings of the 005 international symposium on symolic and algeraic computation ISSAC, Beijing, China, pages 9 36, New York, 005. ACM Press. [] R. Feng and X.-S. Gao. Rational General Solutions of Algeraic Ordinary Differential Equations. In J. Gutierrez, editor, Proceedings of the 004 international symposium on symolic and algeraic computation ISSAC, pages 55 6, New York, 004. ACM Press. [3] R. Feng and X.-S. Gao. A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs. Journal of Symolic Computation, 47:739 76, 006. [4] M. Harrison. Explicit solution y radicals, gonal maps and plane models of algeraic curves of genus 5 or 6. Journal of Symolic Computation, 5:3, 03. [5] Y. Huang, L. X. C. Ngô, and F. Winkler. Rational General Solutions of Trivariate Rational Systems of Autonomous ODEs. In Proceedings of the Fourth International Conference on Mathematical Aspects of Computer and Information Sciences MACIS 0, pages 93 00, 0. [6] Y. Huang, L. X. C. Ngô, and F. Winkler. Rational General Solutions of Trivariate Rational Differential Systems. Mathematics in Computer Science, 64:36 374, 0. [7] Y. Huang, L. X. C. Ngô, and F. Winkler. Rational General Solutions of Higher Order Algeraic ODEs. Journal of Systems Science and Complexity, 6:6 80, 03. [8] E. Huert. The General Solution of an Ordinary Differential Equation. In Y. Lakshman, editor, Proceedings of the 996 international symposium on symolic and algeraic computation ISSAC, pages 89 95, New York, 996. ACM Press. [9] E. Kamke. Differentialgleichungen: Lösungsmethoden und Lösungen. B. G. Teuner, Stuttgart, 997. [0] L. X. C. Ngô, J. R. Sendra, and F. Winkler. Birational Transformations on Algeraic Ordinary Differential Equations. Technical Report 8, RISC Report Series, Johannes Kepler University Linz, Austria, 0. [] L. X. C. Ngô, J. R. Sendra, and F. Winkler. Classification of algeraic ODEs with respect to rational solvaility. In Computational Algeraic and Analytic Geometry, volume 57 of Contemporary Mathematics, pages American Mathematical Society, Providence, RI, 0. [] L. X. C. Ngô and F. Winkler. Rational general solutions of first order non-autonomous parametrizale ODEs. Journal of Symolic Computation, 45:46 44, 00. [3] L. X. C. Ngô and F. Winkler. Rational general solutions of parametrizale AODEs. Pulicationes Mathematicae Derecen, 793 4: , 0. [4] L. X. C. Ngô and F. Winkler. Rational general solutions of planar rational systems of autonomous odes. Journal of Symolic Computation,

7 460:73 86, 0. [5] J. F. Ritt. On algeraic functions, which can e expressed in terms of radicals. Transactions of the American Mathematical Society, 4: 30, 94. [6] J. F. Ritt. Differential algera, volume 33 of Colloquium Pulications. American Mathematical Society, New York, 950. [7] J. Schicho. Rational Parametrization of Surfaces. Journal of Symolic Computation, 6: 9, 998. [8] J. Schicho and D. Sevilla. Effective radical parametrization of trigonal curves. In Computational Algeraic and Analytic Geometry, volume 57 of Contemporary Mathematics, pages 3. American Mathematical Society, Providence, RI, 0. [9] J. R. Sendra and D. Sevilla. Radical parametrizations of algeraic curves y adjoint curves. Journal of Symolic Computation, 469: , 0. [0] J. R. Sendra and D. Sevilla. First steps towards radical parametrization of algeraic surfaces. Computer Aided Geometric Design, 304: , 03. [] J. R. Sendra, F. Winkler, and S. Pérez-Díaz. Rational Algeraic Curves, A Computer Algera Approach, volume of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin Heidelerg, 008. [] B. L. van der Waerden. Algera, volume II. Springer-Verlag, New York, 99. [3] R. J. Walker. Algeraic curves. Reprint of the st ed. 950 y Princeton University Press. Springer-Verlag, New York - Heidelerg - Berlin, 978. [4] D. Zwillinger. Handook of Differential Equations. Academic Press, San Diego, CA, third edition, 998.

Rational and Algebraic General Solutions of First-Order Algebraic ODEs

Rational and Algebraic General Solutions of First-Order Algebraic ODEs Contents Rational and Algebraic General Solutions of First-Order Algebraic ODEs N. Thieu Vo RISC, Johannes Kepler University, Linz, Austria KSDA Seminar, The Graduate Center, CUNY, New York April 1, 2016

More information

A solution method for autonomous first-order algebraic partial differential equations in several variables

A solution method for autonomous first-order algebraic partial differential equations in several variables A solution method for autonomous first-order algebraic partial differential equations in several variables Georg Grasegger Franz Winkler DK Computational Mathematics/ RISC Johannes Kepler University Linz

More information

Computation of the Degree of Rational Maps Between Curves

Computation of the Degree of Rational Maps Between Curves Computation of the Degree of Rational Maps Between Curves J Rafael Sendra Dpto de Matemáticas Universidad de Alcalá E-28871 Madrid Spain RafaelSendra@uahes ABSTRACT The degree of a rational map measures

More information

1 Systems of Differential Equations

1 Systems of Differential Equations March, 20 7- Systems of Differential Equations Let U e an open suset of R n, I e an open interval in R and : I R n R n e a function from I R n to R n The equation ẋ = ft, x is called a first order ordinary

More information

Formal Power Series Solutions of Algebraic Ordinary Differential Equations

Formal Power Series Solutions of Algebraic Ordinary Differential Equations Formal Power Series Solutions of Algebraic Ordinary Differential Equations N. Thieu Vo Sebastian Falkensteiner Yi Zhang March 28, 2018 arxiv:1803.09646v1 [cs.sc] 26 Mar 2018 Abstract In this paper, we

More information

An Algebraic-Geometric Method for Computing Zolotarev Polynomials

An Algebraic-Geometric Method for Computing Zolotarev Polynomials An Algebraic-Geometric Method for Computing Zolotarev Polynomials Georg Grasegger N Thieu Vo March 4, 016 In this paper we study a differential equation which arises from finding Zolotarev polynomials

More information

Computations with Differential Rational Parametric Equations 1)

Computations with Differential Rational Parametric Equations 1) MM Research Preprints,23 29 No. 18, Dec. 1999. Beijing 23 Computations with Differential Rational Parametric Equations 1) Xiao-Shan Gao Institute of Systems Science Academia Sinica, Beijing, 100080 Abstract.

More information

2.4. Solving ideal problems by Gröbner bases

2.4. Solving ideal problems by Gröbner bases Computer Algebra, F.Winkler, WS 2010/11 2.4. Solving ideal problems by Gröbner bases Computation in the vector space of polynomials modulo an ideal The ring K[X] /I of polynomials modulo the ideal I is

More information

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2 Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,

More information

ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA)

ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA) ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA) General information Availale time: 2.5 hours (150 minutes).

More information

AUTOMORPHISMS OF THE AFFINE LINE OVER NON-REDUCED RINGS

AUTOMORPHISMS OF THE AFFINE LINE OVER NON-REDUCED RINGS AUTOMORPHISMS OF THE AFFINE LINE OVER NON-REDUCED RINGS TAYLOR ANDREW DUPUY Astract. The affine space A 1 B only has automorphisms of the form at + when B is a domain. In this paper we study univariate

More information

Zeroing the baseball indicator and the chirality of triples

Zeroing the baseball indicator and the chirality of triples 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.7 Zeroing the aseall indicator and the chirality of triples Christopher S. Simons and Marcus Wright Department of Mathematics

More information

Integration of Unspecified Functions and Families of Iterated Integrals

Integration of Unspecified Functions and Families of Iterated Integrals Integration of Unspecified Functions and Families of Iterated Integrals Clemens G. Raa Deutsches Elektronen-Synchrotron (DESY 15738 Zeuthen, Germany clemens.raa@desy.de ABSTRACT An algorithm for parametric

More information

Essential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March.

Essential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March. Essential Maths 1 The information in this document is the minimum assumed knowledge for students undertaking the Macquarie University Masters of Applied Finance, Graduate Diploma of Applied Finance, and

More information

ERASMUS UNIVERSITY ROTTERDAM

ERASMUS UNIVERSITY ROTTERDAM Information concerning Colloquium doctum Mathematics level 2 for International Business Administration (IBA) and International Bachelor Economics & Business Economics (IBEB) General information ERASMUS

More information

Solving Systems of Linear Equations Symbolically

Solving Systems of Linear Equations Symbolically " Solving Systems of Linear Equations Symolically Every day of the year, thousands of airline flights crisscross the United States to connect large and small cities. Each flight follows a plan filed with

More information

First Steps Towards Radical Parametrization of Algebraic Surfaces

First Steps Towards Radical Parametrization of Algebraic Surfaces First Steps Towards Radical Parametrization of Algebraic Surfaces arxiv:1206.1456v2 [cs.sc] 11 Jun 2012 J. Rafael Sendra Dep. de Matemáticas Universidad de Alcalá Alcalá de Henares, Madrid, Spain rafael.sendra@uah.es

More information

Formal Groups. Niki Myrto Mavraki

Formal Groups. Niki Myrto Mavraki Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal

More information

Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1)

Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1) Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: k Cf ( k) C k S: factor out constant f ( k) k ( f ( k) ± g( k)) k S: separate summed terms f ( k) ± k g(

More information

Math 3450 Homework Solutions

Math 3450 Homework Solutions Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the

More information

On components of vectorial permutations of F n q

On components of vectorial permutations of F n q On components of vectorial permutations of F n q Nurdagül Anbar 1, Canan Kaşıkcı 2, Alev Topuzoğlu 2 1 Johannes Kepler University, Altenbergerstrasse 69, 4040-Linz, Austria Email: nurdagulanbar2@gmail.com

More information

Math 203A - Solution Set 3

Math 203A - Solution Set 3 Math 03A - Solution Set 3 Problem 1 Which of the following algebraic sets are isomorphic: (i) A 1 (ii) Z(xy) A (iii) Z(x + y ) A (iv) Z(x y 5 ) A (v) Z(y x, z x 3 ) A Answer: We claim that (i) and (v)

More information

Chaos and Dynamical Systems

Chaos and Dynamical Systems Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,

More information

ON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE

ON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE ON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE Alessandro De Paris Università degli studi di Napoli Federico II Dipartimento di Matematica e Applicazioni R. Caccioppoli Complesso Monte

More information

Homework 7 Solutions to Selected Problems

Homework 7 Solutions to Selected Problems Homework 7 Solutions to Selected Prolems May 9, 01 1 Chapter 16, Prolem 17 Let D e an integral domain and f(x) = a n x n +... + a 0 and g(x) = m x m +... + 0 e polynomials with coecients in D, where a

More information

ON FLATNESS OF NONLINEAR IMPLICIT SYSTEMS

ON FLATNESS OF NONLINEAR IMPLICIT SYSTEMS ON FLATNESS OF NONLINEAR IMPLICIT SYSTEMS Paulo Sergio Pereira da Silva, Simone Batista Escola Politécnica da USP Av. Luciano Gualerto trav. 03, 158 05508-900 Cidade Universitária São Paulo SP BRAZIL Escola

More information

Local properties of plane algebraic curves

Local properties of plane algebraic curves Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying

More information

ALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!

ALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes! ALGEBRAIC GROUPS Disclaimer: There are millions of errors in these notes! 1. Some algebraic geometry The subject of algebraic groups depends on the interaction between algebraic geometry and group theory.

More information

Commutative Algebra and Algebraic Geometry

Commutative Algebra and Algebraic Geometry Commutative Algebra and Algebraic Geometry Lecture Notes Johannes Kepler Universität Linz Summer 2018 Prof. Franz Winkler c Copyright by F. Winkler Contents References 1. Introduction....................................................................1

More information

Math 216 Second Midterm 28 March, 2013

Math 216 Second Midterm 28 March, 2013 Math 26 Second Midterm 28 March, 23 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that

More information

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS #A INTEGERS 6 (206) STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS Elliot Catt School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, New South Wales, Australia

More information

A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.

A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n. Scientiae Mathematicae Japonicae Online, e-014, 145 15 145 A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS Masaru Nagisa Received May 19, 014 ; revised April 10, 014 Abstract. Let f be oeprator monotone

More information

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES #A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:

More information

Representation theory of SU(2), density operators, purification Michael Walter, University of Amsterdam

Representation theory of SU(2), density operators, purification Michael Walter, University of Amsterdam Symmetry and Quantum Information Feruary 6, 018 Representation theory of S(), density operators, purification Lecture 7 Michael Walter, niversity of Amsterdam Last week, we learned the asic concepts of

More information

Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation

Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation Fredrik Johansson* 1 Manuel Kauers* 1 Marc Mezzarobba* 1,2 *RISC-Linz ISSAC 2013, Boston, MA 1 Supported by the Austrian Science

More information

MAPS WHICH CONVERGE IN THE UNIFORM C 0 -NORM

MAPS WHICH CONVERGE IN THE UNIFORM C 0 -NORM PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 28, Numer, Pages 3285 329 S 2-9939()564-9 Article electronically pulished on April 28, 2 ON SEQUENCES OF C MAPS WHICH CONVERGE IN THE UNIFORM C -NORM

More information

1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS

1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS 1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing

More information

x x 1 x 2 + x 2 1 > 0. HW5. Text defines:

x x 1 x 2 + x 2 1 > 0. HW5. Text defines: Lecture 15: Last time: MVT. Special case: Rolle s Theorem (when f(a) = f(b)). Recall: Defn: Let f be defined on an interval I. f is increasing (or strictly increasing) if whenever x 1, x 2 I and x 2 >

More information

Computation of the degree of rational surface parametrizations

Computation of the degree of rational surface parametrizations Journal of Pure and Applied Algebra 193 (004) 99 11 www.elsevier.com/locate/jpaa Computation of the degree of rational surface parametrizations Sonia Perez-Daz, J. Rafael Sendra Departamento de Matematicas,

More information

A HYPERGEOMETRIC INEQUALITY

A HYPERGEOMETRIC INEQUALITY A HYPERGEOMETRIC INEQUALITY ATUL DIXIT, VICTOR H. MOLL, AND VERONIKA PILLWEIN Abstract. A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal.

More information

Properties of proper rational numbers

Properties of proper rational numbers arxiv:1109.6820v1 [math.gm] 29 Sep 2011 Properties of proper rational numers Konstantine Zelator Mathematics, Statistics, and Computer Science 212 Ben Franklin Hall Bloomsurg University of Pennsylvania

More information

Quivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006

Quivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006 Quivers Virginia, Lonardo, Tiago and Eloy UNICAMP 28 July 2006 1 Introduction This is our project Throughout this paper, k will indicate an algeraically closed field of characteristic 0 2 Quivers 21 asic

More information

Local Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments

Local Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic

More information

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS #A42 INTEGERS 14 (2014) SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS Benjamin V. Holt Department of Mathematics, Humoldt State University, Arcata, California vh6@humoldt.edu Received:

More information

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u. 5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

More information

Ideal Classes and Matrix Conjugation over F q [X]

Ideal Classes and Matrix Conjugation over F q [X] Ideal lasses and Matrix onjugation oer F q [X] hristian Berghoff, Georg-August-Uniersität Göttingen Trais Morrison, Penn State Uniersity Yujia Qiu, Ruprecht-Karls-Uniersität Heidelerg Thomas Sicking, Georg-August-Uniersität

More information

An algorithm for computing minimal bidirectional linear recurrence relations

An algorithm for computing minimal bidirectional linear recurrence relations Loughborough University Institutional Repository An algorithm for computing minimal bidirectional linear recurrence relations This item was submitted to Loughborough University's Institutional Repository

More information

MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS

MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup

More information

A short proof that O 2 is an MCFL

A short proof that O 2 is an MCFL A short proof that O 2 is an MCFL Mark-Jan Nederhof School of Computer Science University of St Andrews, UK Astract We present a new proof that O 2 is a multiple context-free language. It contrasts with

More information

Logarithms. For example:

Logarithms. For example: Math Review Summation Formulas Let >, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant ± ± g f g f ) ) )) ) S: separate summed terms C C ) 6 ) ) Computer

More information

Symbolic Summation with Single-Nested Sum Extensions

Symbolic Summation with Single-Nested Sum Extensions Symbolic Summation with Single-Nested Sum Extensions Carsten Schneider Research Institute for Symbolic Computation J. Kepler University Linz Altenberger Str. 69 A-4040 Linz, Austria Carsten.Schneider@risc.uni-linz.ac.at

More information

THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY

THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY SHINYA FUJITA AND HENRY LIU Astract The alanced decomposition numer f(g) of a graph G was introduced y Fujita and Nakamigawa [Discr Appl Math,

More information

WEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)

WEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R) PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 129, Numer 1, Pages 145 154 S 0002-9939(00)05731-2 Article electronically pulished on July 27, 2000 WEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)

More information

Summation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant

Summation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant Computer Science Dept Va Tech August 005 005 McQuain WD Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant g f g f ) ) ))

More information

Math 203, Solution Set 4.

Math 203, Solution Set 4. Math 203, Solution Set 4. Problem 1. Let V be a finite dimensional vector space and let ω Λ 2 V be such that ω ω = 0. Show that ω = v w for some vectors v, w V. Answer: It is clear that if ω = v w then

More information

Module 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers

Module 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers Module 9: Further Numers and Equations Lesson Aims The aim of this lesson is to enale you to: wor with rational and irrational numers wor with surds to rationalise the denominator when calculating interest,

More information

Lie s Symmetries of (2+1)dim PDE

Lie s Symmetries of (2+1)dim PDE International Journal of Mathematics Trends and Technology (IJMTT) - Volume 5 Numer 6 Novemer 7 Lie s Symmetries of (+)dim PDE S. Padmasekaran and S. Rajeswari Department of Mathematics Periyar University

More information

In Theorem 2.2.4, we generalized a result about field extensions to rings. Here is another variation.

In Theorem 2.2.4, we generalized a result about field extensions to rings. Here is another variation. Chapter 3 Valuation Rings The results of this chapter come into play when analyzing the behavior of a rational function defined in the neighborhood of a point on an algebraic curve. 3.1 Extension Theorems

More information

PROBLEM SET 1 SOLUTIONS 1287 = , 403 = , 78 = 13 6.

PROBLEM SET 1 SOLUTIONS 1287 = , 403 = , 78 = 13 6. Math 7 Spring 06 PROBLEM SET SOLUTIONS. (a) ( pts) Use the Euclidean algorithm to find gcd(87, 0). Solution. The Euclidean algorithm is performed as follows: 87 = 0 + 78, 0 = 78 +, 78 = 6. Hence we have

More information

CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS

CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF OTTAWA SUPERVISOR: PROFESSOR MONICA NEVINS STUDENT: DANG NGUYEN

More information

Symbolic Parametrization of Pipe and Canal Surfaces

Symbolic Parametrization of Pipe and Canal Surfaces Symbolic Parametrization of Pipe and anal Surfaces Günter Landsmann, Josef Schicho, Franz Winkler, Erik Hillgarter Research Institute for Symbolic omputation Johannes Kepler University A-44 Linz, Austria

More information

Pseudo-automata for generalized regular expressions

Pseudo-automata for generalized regular expressions Pseudo-automata for generalized regular expressions B. F. Melnikov A. A. Melnikova Astract In this paper we introduce a new formalism which is intended for representing a special extensions of finite automata.

More information

Basic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series

Basic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony

More information

Solutions to Exam 2, Math 10560

Solutions to Exam 2, Math 10560 Solutions to Exam, Math 6. Which of the following expressions gives the partial fraction decomposition of the function x + x + f(x = (x (x (x +? Solution: Notice that (x is not an irreducile factor. If

More information

Factorization in Integral Domains II

Factorization in Integral Domains II Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and

More information

SU(N) representations

SU(N) representations Appendix C SU(N) representations The group SU(N) has N 2 1 generators t a which form the asis of a Lie algera defined y the commutator relations in (A.2). The group has rank N 1 so there are N 1 Casimir

More information

Polynomial functions on subsets of non-commutative rings a link between ringsets and null-ideal sets

Polynomial functions on subsets of non-commutative rings a link between ringsets and null-ideal sets Polynomial functions on subsets of non-commutative rings a lin between ringsets and null-ideal sets Sophie Frisch 1, 1 Institut für Analysis und Zahlentheorie, Technische Universität Graz, Koperniusgasse

More information

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof)

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof) JOURNAL OF MODERN DYNAMICS VOLUME 4, NO. 4, 010, 637 691 doi: 10.3934/jmd.010.4.637 STRUCTURE OF ATTRACTORS FOR (a, )-CONTINUED FRACTION TRANSFORMATIONS SVETLANA KATOK AND ILIE UGARCOVICI (Communicated

More information

Sylvester Matrix and GCD for Several Univariate Polynomials

Sylvester Matrix and GCD for Several Univariate Polynomials Sylvester Matrix and GCD for Several Univariate Polynomials Manuela Wiesinger-Widi Doctoral Program Computational Mathematics Johannes Kepler University Linz 4040 Linz, Austria manuela.wiesinger@dk-compmath.jku.at

More information

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

More information

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Upper Bounds for Stern s Diatomic Sequence and Related Sequences Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:

More information

SUMS OF VALUES OF A RATIONAL FUNCTION. x k i

SUMS OF VALUES OF A RATIONAL FUNCTION. x k i SUMS OF VALUES OF A RATIONAL FUNCTION BJORN POONEN Abstract. Let K be a number field, and let f K(x) be a nonconstant rational function. We study the sets { n } f(x i ) : x i K {poles of f} and { n f(x

More information

1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy

1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy .. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy = f(x, y). In this section we aim to understand the solution

More information

Implementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes

Implementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes BCH Codes Wireless Information Transmission System La. Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation

More information

RED. Name: Math 290 Fall 2016 Sample Exam 3

RED. Name: Math 290 Fall 2016 Sample Exam 3 RED Name: Math 290 Fall 2016 Sample Exam 3 Note that the first 10 questions are true false. Mark A for true, B for false. Questions 11 through 20 are multiple choice. Mark the correct answer on your ule

More information

Solving Third Order Linear Differential Equations in Terms of Second Order Equations

Solving Third Order Linear Differential Equations in Terms of Second Order Equations Solving Third Order Linear Differential Equations in Terms of Second Order Equations Mark van Hoeij (Florida State University) ISSAC 2007 Talk presented by: George Labahn (University of Waterloo) Notations.

More information

Vector Spaces. EXAMPLE: Let R n be the set of all n 1 matrices. x 1 x 2. x n

Vector Spaces. EXAMPLE: Let R n be the set of all n 1 matrices. x 1 x 2. x n Vector Spaces DEFINITION: A vector space is a nonempty set V of ojects, called vectors, on which are defined two operations, called addition and multiplication y scalars (real numers), suject to the following

More information

Special Precovered Categories of Gorenstein Categories

Special Precovered Categories of Gorenstein Categories Special Precovered Categories of Gorenstein Categories Tiwei Zhao and Zhaoyong Huang Department of Mathematics, Nanjing University, Nanjing 9, Jiangsu Province, P. R. China Astract Let A e an aelian category

More information

ORDINARY DIFFERENTIAL EQUATION: Introduction and First-Order Equations. David Levermore Department of Mathematics University of Maryland

ORDINARY DIFFERENTIAL EQUATION: Introduction and First-Order Equations. David Levermore Department of Mathematics University of Maryland ORDINARY DIFFERENTIAL EQUATION: Introduction and First-Order Equations David Levermore Department of Mathematics University of Maryland 7 September 2009 Because the presentation of this material in class

More information

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions

More information

A Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs

A Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs J. Symbolic Computation (2005) 11, 1 22 A Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs Ruyong Feng and Xiao-Shan Gao Key Lab of Mathematics Mechanization,

More information

SYMBOLIC SUMMATION WITH SINGLE-NESTED SUM EXTENSIONS (EXTENDED VERSION)

SYMBOLIC SUMMATION WITH SINGLE-NESTED SUM EXTENSIONS (EXTENDED VERSION) SYMBOLIC SUMMATION WITH SINGLE-NESTED SUM EXTENSIONS (EXTENDED VERSION) CARSTEN SCHNEIDER Abstract. We present a streamlined and refined version of Karr s summation algorithm. Karr s original approach

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

Generalized Reed-Solomon Codes

Generalized Reed-Solomon Codes Chapter 5 Generalized Reed-Solomon Codes In 1960, I.S. Reed and G. Solomon introduced a family of error-correcting codes that are douly lessed. The codes and their generalizations are useful in practice,

More information

THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS. Contents

THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS. Contents THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS ALICE MARK Abstract. This paper is a simple summary of the first most basic definitions in Algebraic Geometry as they are presented in Dummit and Foote ([1]),

More information

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0 Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can

More information

Entrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4.

Entrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4. Entrance Exam, Differential Equations April, 7 (Solve exactly 6 out of the 8 problems). Consider the following initial value problem: { y + y + y cos(x y) =, y() = y. Find all the values y such that the

More information

4. Noether normalisation

4. Noether normalisation 4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,

More information

Sign the pledge. On my honor, I have neither given nor received unauthorized aid on this Exam : 11. a b c d e. 1. a b c d e. 2.

Sign the pledge. On my honor, I have neither given nor received unauthorized aid on this Exam : 11. a b c d e. 1. a b c d e. 2. Math 258 Name: Final Exam Instructor: May 7, 2 Section: Calculators are NOT allowed. Do not remove this answer page you will return the whole exam. You will be allowed 2 hours to do the test. You may leave

More information

arxiv:math/ v1 [math.sp] 27 Mar 2006

arxiv:math/ v1 [math.sp] 27 Mar 2006 SHARP BOUNDS FOR EIGENVALUES OF TRIANGLES arxiv:math/0603630v1 [math.sp] 27 Mar 2006 BART LOMIEJ SIUDEJA Astract. We prove that the first eigenvalue of the Dirichlet Laplacian for a triangle in the plane

More information

Local Parametrization and Puiseux Expansion

Local Parametrization and Puiseux Expansion Chapter 9 Local Parametrization and Puiseux Expansion Let us first give an example of what we want to do in this section. Example 9.0.1. Consider the plane algebraic curve C A (C) defined by the equation

More information

Solutions of linear ordinary differential equations in terms of special functions

Solutions of linear ordinary differential equations in terms of special functions Solutions of linear ordinary differential equations in terms of special functions Manuel Bronstein ManuelBronstein@sophiainriafr INRIA Projet Café 004, Route des Lucioles, BP 93 F-0690 Sophia Antipolis

More information

Total Ordering on Subgroups and Cosets

Total Ordering on Subgroups and Cosets Total Ordering on Subgroups and Cosets Alexander Hulpke Department of Mathematics Colorado State University 1874 Campus Delivery Fort Collins, CO 80523-1874 hulpke@math.colostate.edu Steve Linton Centre

More information

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics Lecture Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Ordinary Differential Equations for Physical Sciences and Engineering Marcel B. Finan c All Rights

More information

Bivariate difference-differential dimension polynomials and their computation in Maple

Bivariate difference-differential dimension polynomials and their computation in Maple 8 th International Conference on Applied Informatics Eger, Hungary, January 27 30, 2010. Bivariate difference-differential dimension polynomials and their computation in Maple Christian Dönch a, Franz

More information

Creating Good Equations for the Classroom: Rational, Logarithmic and Square Root aversion ""Î# 9Î#!"'

Creating Good Equations for the Classroom: Rational, Logarithmic and Square Root aversion Î# 9Î#!' Creating Good Equations for the Classroom: Rational, Logarithmic and Square Root aversion ""Î 9Î!"' Alan Roeuck Chaffey College alan.roeuck@chaffey.edu We're math teachers. We don't just solve equations,

More information

Symbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) RISC Research Institute for Symbolic Computation

Symbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) RISC Research Institute for Symbolic Computation Symbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) Franz Winkler joint with Ekaterina Shemyakova RISC Research Institute for Symbolic Computation Johannes Kepler Universität.

More information

Variety Evasive Sets

Variety Evasive Sets Variety Evasive Sets Zeev Dvir János Kollár Shachar Lovett Abstract We give an explicit construction of a large subset S F n, where F is a finite field, that has small intersection with any affine variety

More information

10 Lorentz Group and Special Relativity

10 Lorentz Group and Special Relativity Physics 129 Lecture 16 Caltech, 02/27/18 Reference: Jones, Groups, Representations, and Physics, Chapter 10. 10 Lorentz Group and Special Relativity Special relativity says, physics laws should look the

More information

UNIT 5 QUADRATIC FUNCTIONS Lesson 2: Creating and Solving Quadratic Equations in One Variable Instruction

UNIT 5 QUADRATIC FUNCTIONS Lesson 2: Creating and Solving Quadratic Equations in One Variable Instruction Lesson : Creating and Solving Quadratic Equations in One Variale Prerequisite Skills This lesson requires the use of the following skills: understanding real numers and complex numers understanding rational

More information