DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
|
|
- Phoebe Curtis
- 5 years ago
- Views:
Transcription
1 DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x), Q(x), R(x) such that P (x) = h Q(x) + R(x), with eg h =. Uner some conitions h, Q, R are unique, an Q is the approximate -root of P. Moreover we give an algorithm to compute such a ecomposition. We apply these results to ecie whether a polynomial in one or several variables is ecomposable or not. 1. Introuction Let A be an integral omain (i.e. a unitary commutative ring without zero ivisors). Our main result is: Theorem 1. Let P A[x] be a monic polynomial. Let such that is a ivisor of eg P an is invertible in A. There exist h, Q, R A[x] such that P (x) = h Q(x) + R(x) with the conitions that (i) h, Q are monic; (ii) eg h =, coeff(h, x 1 ) = 0, eg R < eg P eg P ; (iii) R(x) = i r ix i with (eg Q i r i = 0). Moreover such h, Q, R are unique. The previous theorem has a formulation similar to the Eucliian ivision; but here Q is not given (only its egree is fixe); there is a natural Q (that we will compute, see Corollary ) associate to P an. Notice also that the ecomposition P (x) = h Q(x) + R(x) is not the Q-aic ecomposition, since the coefficients before the powers Q i (x) belong to A an not to A[x]. Date: October 16, Mathematics Subject Classification. 13B5. Key wors an phrases. Decomposable an inecomposable polynomials in one or several variables. 1
2 ARNAUD BODIN Example. Let P (x) = x 6 + 6x 5 + 6x + 1 Q[x]. If = 6 we fin the following ecomposition P (x) = h Q(x) + R(x) with h(x) = x 6 15x 4 +40x 3 45x +30x 10, Q(x) = x+1 an R(x) = 0. If = 3 we have h(x) = x , Q(x) = x + x 4 an R(x) = 40x 3 90x. If = we get h(x) = x 75, Q(x) = 4 x3 + 3x 9x + 7 an R(x) = x + 55x. Theorem 1 will be of special interest when then ring A is itself a polynomial ring. For instance at the en of the paper we give an example of a ecomposition of a polynomial in two variables P (x, y) A[x] for A = K[y]. The polynomial Q that appears in the ecomposition has alreay been introuce in a rather ifferent context. We enote by P the approximate -root of P. It is the polynomial such that ( P ) approximate P in a best way, that is to say P ( P ) has smallest possible egree. The precise efinition will be given in section, but we alreay notice the following: Corollary. Q = P We apply these results to another situation. Let A = K be a fiel an. P K[x] is sai to be -ecomposable in K[x] if there exist h, Q K[x], with eg h = such that P (x) = h Q(x). Corollary 3. Let A = K be a fiel. Suppose that char K oes not ivie. P is -ecomposable in K[x] if an only if R = 0 in the ecomposition of Theorem 1. In particular, if P is -ecomposable, then P = h Q with Q = P. After the first version of this paper, M. Aya an G. Chèze communicate us some references so that we can picture a part of history of the subject. Approximate roots appeare (for = ) in some work of E.D. Rainville [9] to fin polynomial solutions of some Riccati type ifferential equations. An approximate root was seen as the polynomial part of the expansion of P (x) 1 into ecreasing powers of x. The use of approximate roots culminate with S.S. Abhyankar an T.T. Moh who prove the so-calle Abhyankar-Moh-Suzuki theorem in [1] an []. For the latest subject we refer the reaer to an excellent expository article of P. Popescu-Pampu [8]. On the other han Ritt s ecompostion theorems (see [10] for example) have le to several practical algorithms to
3 DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS 3 ecompose polynomials in one variable into the form P (x) = h Q(x): for example D. Kozen an S. Lanau in [6] give an algorithm (refine in [5]) that computes a ecomposition in polynomial time. Unification of both subjects starts with P.R. Lazov an A.F. Bearon ([7], [3]) for polynomials in one variable over complex numbers: they notice that the polynomial Q is in fact the approximate -root of P. We efine approximate roots in section an prove uniqueness of the ecomposition of Theorem 1. Then in section 3 we prove the existence of such ecomposition an give an algorithm to compute it. Finally in section 4 we apply these results to ecomposable polynomials in one variable an in section 5 to ecomposable polynomials in several variables.. Approximate roots an proof of the uniqueness The approximate roots of a polynomial are efine by the following property, [1], [8, Proposition 3.1]. Proposition 4. Let P A[x] a monic polynomial an such that is a ivisor of eg P an is invertible in A. There exists a unique monic polynomial Q A[x] such that: eg(p Q ) < eg P eg P. We call Q the approximate -root of P an enote it by P. Let us recall the proof from [8]. Proof. Write P (x) = x n + a 1 x n 1 + a x n a n an we search an equation for Q(x) = x n +b 1 x n 1 +b x n + +bn. We want eg(p Q ) < eg P eg P, that is to say, the coefficients of x n, x n 1,..., x n n in P Q equal zero. By expaning Q we get the following system of equations: a 1 = b 1 a = b + ( ) b 1 (S). a k = b k + c i1...i k 1 b i 1 1 b i k 1 k 1, 1 k n i 1 +i + +(k 1)i k 1 =k where the coefficients c i1...i k 1 are the multinomial coefficients efine by the following formula: ( )! c i1...i k 1 = = i 1,..., i k 1 i 1! i k 1!( i 1 i k 1 )!.
4 4 ARNAUD BODIN The system (S) being a triangular system, we can inuctively compute the b i for i = 1,,..., n: b 1 = a 1, b = a ( )b 1,... Hence the system (S) amits one an only one solution b 1, b,..., b n. Notice that we nee to be invertible in A to compute b i. Moreover b i epens only on the first coefficients a 1, a,..., a n of P. Proposition 4 enables us to prove Corollary : by conition (ii) of Theorem 1 we know that eg(p Q ) < eg P eg P so that Q is the approximate -root of P. Another way to compute P is to use iterations of Tschirnhausen transformation, see [1] or [8, Proposition 6.3]. We en this section by proving uniqueness of the ecomposition of Theorem 1. Proof. Q is the approximate -root of P so is unique (see Proposition 4 above). In orer to prove the uniqueness of h an R, we argue by contraiction. Suppose h Q + R = h Q + R with R R ; set r i x i to be the highest monomial of R(x) R (x). From one han x i is a monomial of R or R, hence eg Q i by conition (iii) of Theorem 1. From the equality (h h) Q = R R we euce that i = eg(r R ) is a multiple of eg Q ; that yiels a contraiction. Therefore R = R, hence h = h. 3. Algorithm an proof of the existence Here is an algorithm to compute the ecomposition of Theorem 1. Algorithm 5. Input. P A[x], eg P. Output. h, Q, R A[x] such that P = h Q + R. 1st step. Compute Q = P by solving the triangular system (S) of Proposition 4. Set h 1 (x) = x, R 1 (x) = 0. n step. Compute P = P Q = P h 1 (Q) R 1. Look for its highest monomial a i x i. If eg Q i then set h (x) = h 1 (x) + a i x i eg Q, R = R 1. If eg Q i then R (x) = R 1 (x) + a i x i, h = h 1. 3th step. Set P 3 = P h (Q) R, look for its highest monomial a i x i, Final step. P n = P h n 1 (Q) R n 1 = 0 yiels the ecomposition P = h Q + R with h = h n 1 an R = R n 1. The algorithm terminates because the egree of the P i ecreases at each step. It yiels a ecomposition P = h Q + R that verifies all
5 DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS 5 the conitions of Theorem 1: in the secon step of the algorithm, an ue to Proposition 4 we know that i < eg P eg P. That implies coeff(h, x 1 ) = 0 an eg R < eg P eg P. Therefore at the en coeff(h, x 1 ) = 0. Of course the algorithm proves the existence of the ecomposition in Theorem Decomposable polynomials in one variable Let K be a fiel an. P K[x] is sai to be -ecomposable in K[x] if there exist h, Q K[x], with eg h = such that P (x) = h Q(x). We refer to [4] for references an recent results on ecomposable polynomials in one an several variables. Proposition 6. Let A = K be a fiel whose characteristic oes not ivie. A monic polynomial P is -ecomposable in K[x] if an only if R = 0 in the ecomposition P = h Q + R. In view of Algorithm 5 we also get an algorithm to ecie whether a polynomial is ecomposable or not an in the positive case give its ecomposition. Proof. If R = 0 then P is -ecomposable. Conversly if P is - ecomposable, then there exist h, Q K[x] such that P = h(q). As P is monic we can suppose h, Q monic. Moreover, up to a linear change of coorinates x x + α, we can suppose that coeff(h, x 1 ) = 0. Therefore P = h(q) is a ecomposition that verifies the conitions of Theorem 1. Remark. Let P (x) = x n + a 1 x n a n, we first consier a 1,..., a n as ineterminates (i.e. P is seen as an element of K(a 1,..., a n )[x]). The coefficients of h(x), Q(x) an R(x) = r 0 x k +r 1 x k 1 + +r k (compute by Proposition 4, the system (S) an Algorithm 5) are polynomials in the a i, in particular r i = r i (a 1,..., a n ) K[a 1,..., a n ], i = 0,..., k. Now we consier a 1,..., a n K as specializations of a 1,..., a n an enote by P the specialization of P at a 1,..., a n. Then, by Proposition 6, P is -ecomposable in K[x] if an only if r i (a 1,..., a n) = 0 for all i = 0,..., k. It expresses the set of -ecomposable monic polynomials of egree n as an affine algebraic variety. We give explicit equations in the following example. Example. Let K be a fiel of characteristic ifferent from. Let P (x) = x 6 +a 1 x 5 +a x 4 +a 3 x 3 +a 4 x +a 5 x+a 6 be a monic polynomial of egree 6 in K[x] (the a i K being ineterminates). Let =. We first look for
6 6 ARNAUD BODIN the approximate -root of P (x). P (x) = Q(x) = x 3 +b 1 x +b x +b 3. In view of the triangular system (S) we get b 1 = a 1, b = a b 1, b 3 = a 3 b 1 b. Once we have compute Q, we get h(x) = x + a 6 b 3. Therefore R(x) = (a 4 b 1 b 3 b )x + (a 5 b b 3 )x. Now P (x) is -ecomposable in K[x] if an only if R(x) = 0 in K[x] that is to say if an only if (a 1,..., a 6 ) satifies the polynomial system of equations in a 1,..., a 5 : { a 4 b 1 b 3 b = 0, a 5 b b 3 = Decomposable polynomials in several variables Again K is a fiel an. Set n. P K[x 1,..., x n ] is sai to be -ecomposable in K[x 1,..., x n ] if there exist Q K[x 1,..., x n ], an h K[t] with eg h =, such that P (x 1,..., x n ) = h Q(x 1,..., x n ). Proposition 7. Let A = K[x,..., x n ], P A[x 1 ] = K[x 1,..., x n ] monic in x 1. Fix that ivies eg x1 P, such that char K oes not ivie. P is -ecomposable in K[x 1,..., x n ] if an only if the ecomposition P = h Q + R of Theorem 1 in A[x 1 ] verifies R = 0 an h K[t] (instea of h K[t, x,..., x n ]). Proof. If P amits a ecomposition as in Theorem 1 with R = 0 an h K[t] then P = h Q is -ecomposable. Conversly if P is -ecomposable in K[x 1,..., x n ] then P = h Q with h K[t], Q K[x 1,..., x n ]. As P is monic in x 1 we may suppose that h is monic an Q is monic in x 1. We can also suppose coeff(h, t 1 ) = 0. Therefore h, Q an R := 0 verify the conitions of Theorem 1 in A[x]. As such a ecomposition is unique, it ens the proof. Example. Set A = K[y] an let P (x) = x 6 + a 1 x 5 + a x 4 + a 3 x 3 + a 4 x + a 5 x + a 6 be a monic polynomial of egree 6 in A[x] = K[x, y], with coefficients a i = a i (y) A = K[y]. In the example of section 4 we have compute the ecomposition P = h Q + R for = an set b 1 = a 1, b = a b 1, b 3 = a 3 b 1 b. We foun h(t) = t +a 6 b 3 A[t]
7 DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS 7 an R(x) = (a 4 b 1 b 3 b )x +(a 5 b b 3 )x A[x]. By Proposition 7 above, we get that P is -ecomposable in K[x, y] if an only a 6 b 3 K, a 4 b 1 b 3 b = 0 in K[y], a 5 b b 3 = 0 in K[y]. Each line yiels a system of polynomial equations in the coefficients a ij K of P (x, y) = a ij x i y j K[x, y]. In particular the set of -ecomposable monic polynomials of egree 6 in K[x, y] is an affine algebraic variety. References [1] S.S. Abhyankar, T.T. Moh, Newton-Puiseux expansion an generalize Tschirnhausen transformation. J. Reine Angew. Math. 60 (1973), an 61 (1973), [] S.S. Abhyankar, T.T. Moh, Embeings of the line in the plane. J. Reine Angew. Math. 76 (1975), [3] A.F. Bearon, Composition factors of polynomials. The Chuang special issue. Complex Variables Theory Appl. 43 (001), [4] A. Boin, P. Dèbes, S. Najib, Inecomposable polynomials an their spectrum. Acta Arith. 139 (009), [5] J.v.z. Gathen, Functional ecomposition of polynomials: the tame case. J. Symb. Comp. 9 (1990), [6] D. Kozen, S. Lanau, Polynomial ecomposition algorithms. J. Symb. Comp. 7 (1989), [7] P.R. Lazov, A criterion for polynomial ecomposition. Mat. Bilten 45 (1995), [8] P. Popescu-Pampu, Approximate roots. Valuation theory an its applications, Vol. II (Saskatoon, SK, 1999), Fiels Inst. Commun. 33, Amer. Math. Soc. (003), [9] E.D. Rainville, Necessary conitions for polynomial solutions of certain Riccati equations. Amer. Math. Monthly 43 (1936), [10] A. Schinzel, Polynomials with special regar to reucibility. Encyclopeia of Mathematics an its Applications, 77. Cambrige University Press, Cambrige, 000. Laboratoire Paul Painlevé, Mathématiques, Université e Lille 1, Villeneuve Ascq, France. aress: Arnau.Boin@math.univ-lille1.fr
Journal of Algebra. A class of projectively full ideals in two-dimensional Muhly local domains
Journal of Algebra 32 2009 903 9 Contents lists available at ScienceDirect Journal of Algebra wwwelseviercom/locate/jalgebra A class of projectively full ieals in two-imensional Muhly local omains aymon
More informationOn the factorization of polynomials over discrete valuation domains
DOI: 10.2478/auom-2014-0023 An. Şt. Univ. Oviius Constanţa Vol. 22(1),2014, 273 280 On the factorization of polynomials over iscrete valuation omains Doru Ştefănescu Abstract We stuy some factorization
More informationStable Polynomials over Finite Fields
Rev. Mat. Iberoam., 1 14 c European Mathematical Society Stable Polynomials over Finite Fiels Domingo Gómez-Pérez, Alejanro P. Nicolás, Alina Ostafe an Daniel Saornil Abstract. We use the theory of resultants
More informationGENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
GENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS ARNAUD BODIN Abstract. We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results
More informationOptimization Notes. Note: Any material in red you will need to have memorized verbatim (more or less) for tests, quizzes, and the final exam.
MATH 2250 Calculus I Date: October 5, 2017 Eric Perkerson Optimization Notes 1 Chapter 4 Note: Any material in re you will nee to have memorize verbatim (more or less) for tests, quizzes, an the final
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationZachary Scherr Math 503 HW 5 Due Friday, Feb 26
Zachary Scherr Math 503 HW 5 Due Friay, Feb 26 1 Reaing 1. Rea Chapter 9 of Dummit an Foote 2 Problems 1. 9.1.13 Solution: We alreay know that if R is any commutative ring, then R[x]/(x r = R for any r
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationarxiv: v1 [math-ph] 5 May 2014
DIFFERENTIAL-ALGEBRAIC SOLUTIONS OF THE HEAT EQUATION VICTOR M. BUCHSTABER, ELENA YU. NETAY arxiv:1405.0926v1 [math-ph] 5 May 2014 Abstract. In this work we introuce the notion of ifferential-algebraic
More informationHilbert functions and Betti numbers of reverse lexicographic ideals in the exterior algebra
Turk J Math 36 (2012), 366 375. c TÜBİTAK oi:10.3906/mat-1102-21 Hilbert functions an Betti numbers of reverse lexicographic ieals in the exterior algebra Marilena Crupi, Carmela Ferró Abstract Let K be
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationarxiv: v2 [math.dg] 16 Dec 2014
A ONOTONICITY FORULA AND TYPE-II SINGULARITIES FOR THE EAN CURVATURE FLOW arxiv:1312.4775v2 [math.dg] 16 Dec 2014 YONGBING ZHANG Abstract. In this paper, we introuce a monotonicity formula for the mean
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationarxiv: v2 [math.cv] 2 Mar 2018
The quaternionic Gauss-Lucas Theorem Riccaro Ghiloni Alessanro Perotti Department of Mathematics, University of Trento Via Sommarive 14, I-38123 Povo Trento, Italy riccaro.ghiloni@unitn.it, alessanro.perotti@unitn.it
More informationSolutions to Math 41 Second Exam November 4, 2010
Solutions to Math 41 Secon Exam November 4, 2010 1. (13 points) Differentiate, using the metho of your choice. (a) p(t) = ln(sec t + tan t) + log 2 (2 + t) (4 points) Using the rule for the erivative of
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationarxiv: v1 [math.ac] 3 Jan 2019
UPPER BOUND OF MULTIPLICITY IN PRIME CHARACTERISTIC DUONG THI HUONG AND PHAM HUNG QUY arxiv:1901.00849v1 [math.ac] 3 Jan 2019 Abstract. Let (R,m) be a local ring of prime characteristic p an of imension
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationExistence of equilibria in articulated bearings in presence of cavity
J. Math. Anal. Appl. 335 2007) 841 859 www.elsevier.com/locate/jmaa Existence of equilibria in articulate bearings in presence of cavity G. Buscaglia a, I. Ciuperca b, I. Hafii c,m.jai c, a Centro Atómico
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationTHE 2-SECANT VARIETIES OF THE VERONESE EMBEDDING
THE 2-SECANT VARIETIES OF THE VERONESE EMBEDDING ALEX MASSARENTI Cortona - July 4, 2012 1 Abstract. We prove that a general polynomial F k[x 0,..., x n] amits a ecomposition as sum of h = 2 powers of linear
More informationThe Non-abelian Hodge Correspondence for Non-Compact Curves
1 Section 1 Setup The Non-abelian Hoge Corresponence for Non-Compact Curves Chris Elliott May 8, 2011 1 Setup In this talk I will escribe the non-abelian Hoge theory of a non-compact curve. This was worke
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More information4.2 First Differentiation Rules; Leibniz Notation
.. FIRST DIFFERENTIATION RULES; LEIBNIZ NOTATION 307. First Differentiation Rules; Leibniz Notation In this section we erive rules which let us quickly compute the erivative function f (x) for any polynomial
More informationNILPOTENCE ORDER GROWTH OF RECURSION OPERATORS IN CHARACTERISTIC p. Contents. 1. Introduction Preliminaries 3. References
NILPOTENCE ORDER GROWTH OF RECURSION OPERATORS IN CHARACTERISTIC p ANNA MEDVEDOVSKY Abstract. We prove that the killing rate of certain egree-lowering recursion operators on a polynomial algebra over a
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationLecture notes on Witt vectors
Lecture notes on Witt vectors Lars Hesselholt The purpose of these notes is to give a self-containe introuction to Witt vectors. We cover both the classical p-typical Witt vectors of Teichmüller an Witt
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
More informationLinear Algebra- Review And Beyond. Lecture 3
Linear Algebra- Review An Beyon Lecture 3 This lecture gives a wie range of materials relate to matrix. Matrix is the core of linear algebra, an it s useful in many other fiels. 1 Matrix Matrix is the
More informationA. Incorrect! The letter t does not appear in the expression of the given integral
AP Physics C - Problem Drill 1: The Funamental Theorem of Calculus Question No. 1 of 1 Instruction: (1) Rea the problem statement an answer choices carefully () Work the problems on paper as neee (3) Question
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationTHE MONIC INTEGER TRANSFINITE DIAMETER
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578(XX)0000-0 THE MONIC INTEGER TRANSFINITE DIAMETER K. G. HARE AND C. J. SMYTH ABSTRACT. We stuy the problem of fining nonconstant monic
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationINVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN INTEGRAL OVERDETERMINATION CONDITION
Electronic Journal of Differential Equations, Vol. 216 (216), No. 138, pp. 1 7. ISSN: 172-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu INVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN
More informationEfficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Efficient Construction of Semilinear Representations of Languages Accepte by Unary NFA Zeněk Sawa Center for Applie Cybernetics, Department of Computer Science Technical University of Ostrava 17. listopau
More information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More informationAlgebra IV. Contents. Alexei Skorobogatov. December 12, 2017
Algebra IV Alexei Skorobogatov December 12, 2017 Abstract This course is an introuction to homological algebra an group cohomology. Contents 1 Moules over a ring 2 1.1 Definitions an examples.........................
More informationPeriods of quadratic twists of elliptic curves
Perios of quaratic twists of elliptic curves Vivek Pal with an appenix by Amo Agashe Abstract In this paper we prove a relation between the perio of an elliptic curve an the perio of its real an imaginary
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationRelation between the propagator matrix of geodesic deviation and the second-order derivatives of the characteristic function
Journal of Electromagnetic Waves an Applications 203 Vol. 27 No. 3 589 60 http://x.oi.org/0.080/0920507.203.808595 Relation between the propagator matrix of geoesic eviation an the secon-orer erivatives
More informationMARTIN HENK AND MAKOTO TAGAMI
LOWER BOUNDS ON THE COEFFICIENTS OF EHRHART POLYNOMIALS MARTIN HENK AND MAKOTO TAGAMI Abstract. We present lower bouns for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationUnirational Fields of Transcendence Degree One and Functional Decomposition
Unirational Fiels of Transcenence Degree One an Functional Decomposition Jaime Gutierrez, Rosario Rubio an Davi Sevilla Dept of Mathematics, Statistics an Computation University of Cantabria 39071 Santaner,
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationUNDERSTANDING INTEGRATION
UNDERSTANDING INTEGRATION Dear Reaer The concept of Integration, mathematically speaking, is the "Inverse" of the concept of result, the integration of, woul give us back the function f(). This, in a way,
More informationDIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10
DIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10 5. Levi-Civita connection From now on we are intereste in connections on the tangent bunle T X of a Riemanninam manifol (X, g). Out main result will be a construction
More informationModular composition modulo triangular sets and applications
Moular composition moulo triangular sets an applications Arien Poteaux Éric Schost arien.poteaux@lip6.fr eschost@uwo.ca : Computer Science Department, The University of Western Ontario, Lonon, ON, Canaa
More informationMEASURES WITH ZEROS IN THE INVERSE OF THEIR MOMENT MATRIX
MEASURES WITH ZEROS IN THE INVERSE OF THEIR MOMENT MATRIX J. WILLIAM HELTON, JEAN B. LASSERRE, AND MIHAI PUTINAR Abstract. We investigate an iscuss when the inverse of a multivariate truncate moment matrix
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationREPRESENTATIONS FOR THE GENERALIZED DRAZIN INVERSE IN A BANACH ALGEBRA (COMMUNICATED BY FUAD KITTANEH)
Bulletin of Mathematical Analysis an Applications ISSN: 1821-1291, UL: http://www.bmathaa.org Volume 5 Issue 1 (2013), ages 53-64 EESENTATIONS FO THE GENEALIZED DAZIN INVESE IN A BANACH ALGEBA (COMMUNICATED
More informationDistribution results on polynomials with bounded roots
Monatsh Math 208 85:689 75 https://oi.org/0.007/s00605-07-054-x Distribution results on polynomials with boune roots Peter Kirschenhofer Jörg Thuswalner Receive: 22 September 206 / Accepte: 3 April 207
More informationIRREDUCIBILITY OF HYPERSURFACES
IRREDUCIBILITY OF HYPERSURFACES ARNAUD BODIN, PIERRE DÈBES, AND SALAH NAJIB Abstract. Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationAlgebrability of the set of non-convergent Fourier series
STUDIA MATHEMATICA 75 () (2006) Algebrability of the set of non-convergent Fourier series by Richar M. Aron (Kent, OH), Davi Pérez-García (Mari) an Juan B. Seoane-Sepúlvea (Kent, OH) Abstract. We show
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More informationNEERAJ KUMAR AND K. SENTHIL KUMAR. 1. Introduction. Theorem 1 motivate us to ask the following:
NOTE ON VANISHING POWER SUMS OF ROOTS OF UNITY NEERAJ KUMAR AND K. SENTHIL KUMAR Abstract. For xe positive integers m an l, we give a complete list of integers n for which their exist mth complex roots
More informationSYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS
SYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS GEORGE A HAGEDORN AND CAROLINE LASSER Abstract We investigate the iterate Kronecker prouct of a square matrix with itself an prove an invariance
More informationSection 2.7 Derivatives of powers of functions
Section 2.7 Derivatives of powers of functions (3/19/08) Overview: In this section we iscuss the Chain Rule formula for the erivatives of composite functions that are forme by taking powers of other functions.
More informationarxiv: v1 [physics.flu-dyn] 8 May 2014
Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa
More informationThe canonical controllers and regular interconnection
Systems & Control Letters ( www.elsevier.com/locate/sysconle The canonical controllers an regular interconnection A.A. Julius a,, J.C. Willems b, M.N. Belur c, H.L. Trentelman a Department of Applie Mathematics,
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationORDINARY DIFFERENTIAL EQUATIONS AND SINGULAR INTEGRALS. Gianluca Crippa
Manuscript submitte to AIMS Journals Volume X, Number 0X, XX 200X Website: http://aimsciences.org pp. X XX ORDINARY DIFFERENTIAL EQUATIONS AND SINGULAR INTEGRALS Gianluca Crippa Departement Mathematik
More informationRules of Differentiation
LECTURE 2 Rules of Differentiation At te en of Capter 2, we finally arrive at te following efinition of te erivative of a function f f x + f x x := x 0 oing so only after an extene iscussion as wat te
More informationHomotopy colimits in model categories. Marc Stephan
Homotopy colimits in moel categories Marc Stephan July 13, 2009 1 Introuction In [1], Dwyer an Spalinski construct the so-calle homotopy pushout functor, motivate by the following observation. In the category
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationSuppressing Chemotactic Blow-Up Through a Fast Splitting Scenario on the Plane
Arch. Rational Mech. Anal. Digital Object Ientifier (DOI) https://oi.org/1.17/s25-18-1336-z Suppressing Chemotactic Blow-Up Through a Fast Splitting Scenario on the Plane Siming He & Eitan Tamor Communicate
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More information2.1 Derivatives and Rates of Change
1a 1b 2.1 Derivatives an Rates of Change Tangent Lines Example. Consier y f x x 2 0 2 x-, 0 4 y-, f(x) axes, curve C Consier a smooth curve C. A line tangent to C at a point P both intersects C at P an
More informationTHE DUCK AND THE DEVIL: CANARDS ON THE STAIRCASE
MOSCOW MATHEMATICAL JOURNAL Volume 1, Number 1, January March 2001, Pages 27 47 THE DUCK AND THE DEVIL: CANARDS ON THE STAIRCASE J. GUCKENHEIMER AND YU. ILYASHENKO Abstract. Slow-fast systems on the two-torus
More informationChapter 2. Exponential and Log functions. Contents
Chapter. Exponential an Log functions This material is in Chapter 6 of Anton Calculus. The basic iea here is mainly to a to the list of functions we know about (for calculus) an the ones we will stu all
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeare in a journal publishe by Elsevier. The attache copy is furnishe to the author for internal non-commercial research an eucation use, incluing for instruction at the authors institution
More informationError estimates for 1D asymptotic models in coaxial cables with non-homogeneous cross-section
Error estimates for 1D asymptotic moels in coaxial cables with non-homogeneous cross-section ébastien Imperiale, Patrick Joly o cite this version: ébastien Imperiale, Patrick Joly. Error estimates for
More informationAlmost Split Morphisms, Preprojective Algebras and Multiplication Maps of Maximal Rank
Syracuse University SURFACE Mathematics Faculty Scholarship Mathematics 12-30-2005 Almost Split Morphisms, Preprojective Algebras an Multiplication Maps of Maximal Rank Steven P. Diaz Syracuse University
More informationUpper and Lower Bounds on ε-approximate Degree of AND n and OR n Using Chebyshev Polynomials
Upper an Lower Bouns on ε-approximate Degree of AND n an OR n Using Chebyshev Polynomials Mrinalkanti Ghosh, Rachit Nimavat December 11, 016 1 Introuction The notion of approximate egree was first introuce
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationExam 2 Review Solutions
Exam Review Solutions 1. True or False, an explain: (a) There exists a function f with continuous secon partial erivatives such that f x (x, y) = x + y f y = x y False. If the function has continuous secon
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationSOME DIVISIBILITY PROPERTIES OF BINOMIAL AND q-binomial COEFFICIENTS
SOME DIVISIBILITY PROPERTIES OF BINOMIAL AND -BINOMIAL COEFFICIENTS Victor J. W. Guo an C. Krattenthaler 2 Department of Mathematics East China Normal University Shanghai 200062 People s Republic of China
More informationDIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 7. Geodesics and the Theorem of Gauss-Bonnet
A P Q O B DIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 7. Geoesics an the Theorem of Gauss-Bonnet 7.. Geoesics on a Surface. The goal of this section is to give an answer to the following question. Question.
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More information