An Optimal Bound for Sum of Square Roots of Special Type of Integers
|
|
- Jennifer McCarthy
- 5 years ago
- Views:
Transcription
1 The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp An Optal Bound for Su of Square Roots of Specal Type of Integers Janbo Qan 1 Cao An Wang 2, 1 Departent of Coputer Scence, Unversty of Waterloo, Ontaro, Canada 2 Departent of Coputer Scence, Meoral Unversty of Newfoundland, St. John s, Newfoundland, Canada A1B 3X5 Abstract The su of square roots of ntegers proble s to fnd the nu nonzero dfference between two sus of square roots of ntegers. Let rn, k denote the nu nonzero postve value: k 1 a k 1 b, where a and b are postve ntegers not larger than nteger n. We prove by an explct constructon that rn,k On 2k+ 3 2 for fxed k and any n. Our result ples that n order to copare two sus of k square roots of ntegers wth at ost d dgts per nteger, one ght need precson of as any as 2k 3 d dgts. We also prove that ths bound s optal 2 for a wde range of ntegers,.e., rn,k Θn 2k+ 3 2 for fxed k and for those ntegers n the for of n 2k 1 2n k 1 2n , where n s any nteger satsfed the above for and s any nteger n range [0,2k 1]. 1 Introducton In order to fnd the optal soluton n an optzaton probles, one frequently needs to copare the values of two arthetc expressons. Each arthetc expresson represents a possble choce. Ths s actually slar to evaluate branch condtons n a coputer progra. As a consequence of ncorrect result, a coputaton ay follow an ncorrect path. Ths ay lead to catastrophc errors. For exaple n operatons research, n order to desgn an effcent dspatch schee for a tax copany n a cty, one needs to copare the lengths of dfferent routes, whch s a geoetrc proble. In the real of geoetrc coputatons, a route s a polygonal path. Moreover, paths are usually represented by sus of square roots of ntegers, where vertces are represented by nteger coordnates. It s ustfed snce n practce, nteger coordnates of ponts are wdely used n the pleentaton of geoetrc algorths. In order to quckly deterne the longer one of two such polygonal paths, one natural way s to copute the nuercally. The correctness of ths coputaton reles on the correct precson needed for dentfyng the dfference. In coplexty aspect, the Ths work s supported by NSERC grant OPG Correspondent author. E-al: wang@cs.un.ca
2 An Optal Bound for Su of Square Roots of Specal Type of Integers 207 sgnfcance of ths proble was ndcated by Davd Eppsten [2]: A aor bottleneck n provng NP-copleteness for geoetrc probles s a satch between the real-nuber and Turng achne odels of coputaton: one s good for geoetrc algorths but bad for reductons, and the other vce versa. Specfcally, t s not known on Turng achnes how to quckly copare a su of dstances square roots of ntegers wth an nteger or other slar sus, so even decson versons of easy probles such as the nu spannng tree are not known to be n NP. Therefore, ths becoes a fundaental open proble n coputatonal geoetry [1]. The proble can be expressed n nuber-theoretc ters: what s the sallest nonzero nuber that s the dfference of two sus of k roots of ntegers not larger than soe bound n? More precsely, fnd tght lower and upper bounds on rn,k, the nu postve value of k 1 a k 1 where a and b are ntegers not larger than n. Exaples [1] are: b, r20, , r20, Hstorcally speakng, the proble was forally posed by Joseph O Rourke n 1981 [3], but t s lkely an older proble snce Ronald Graha had dscussed t n soe publc lectures before. The proble s now ncluded n The Open Probles Proect" as Proble 33: Su of Square Roots [1]. Of partcular portance s whether lg 1 s bounded above by a polynoal rn,k n k and lgn. If ths stateent s true, then we can copare two sus of square roots of ntegers n polynoal te. Note that even though lg 1 s not bounded rn,k by a polynoal n k and lgn, there ay stll exst polynoal-te algorths to copare such two sus by other eans. A lower bound s pled through root-separaton bounds [4]. When k s fxed, the bound s that rn,k Ωn k 2. To the authors best knowledge, the only known upper bound s On k+ 1 2 for fxed k due to Ronald Graha [2], as an applcaton of Prouhet-Tarry-Escott proble n nuber theory. 2 Our Results Our dea for constructng ths On 2k+ 3 2 bound s based on the Taylor expanson, but we avod usng the soluton of Prouhet-Tarry-Escott proble, whch s hard to solve tself. We can prove the followng results.
3 208 The Sxth Internatonal Syposu on Operatons Research and Its Applcatons Lea 1. Let 1 and n be ntegers. We have that 1 n 2 3!! + <, 2 n 1 2 where 2 3!! we regard 1!! as 1. Proof. Frst we prove the followng recursve equalty for k 1, usng cobnatoral dentty 1 1 : Let s, 1 for ntegers 1 and 0. s,k 1 k k k k 1 k bnoal expanson l k 1 k 1 l0 l l let l 1 k 1 k l l l0 l k 1 k 1 s 1,. Now we prove oe cobnatoral denttes: 1 for 0 1, we have s, s regarded as 1; 2 s, 1!. For 1, we prove t by nducton on. When 0, s,0 1 s exactly the bnoal expanson of 1 1, thus 1 holds for 1. We assue that s, 0 holds for 0 k 1 and k, then for k and k + 1 by the recursve equalty above we have k 1 k 1 s,k s 1, 0. Ths proves 1. Also by the recursve equalty above: 1 s, 1 s 1, s 1, 1.
4 An Optal Bound for Su of Square Roots of Specal Type of Integers 209 Fro ths and the fact that s1,1 1 we have s, 1!. Thus 2 s also proved. For the proof of Lea 1, let f n 1 1 n + n n. Our dea s to prove that n ts Tayloror Maclaurn expanson of 1/n, all coeffcents of the frst 1 ters are zero. Functon 1 + x can be expanded by Taylor s forula as: 1 + x x x x !! !! x 1 2 3!! + 1 2!! 2 3!! 1 x 2 3!! + 1 ξ, 2!! 2!! where 0 < ξ < x, 2 3!! and 2!! For 0, let c denote the coeffcent of the -th ter n the Taylor expanson of 1 + x,.e. c 1 2 3!!. Let M > n be soe constant so that 0. 2!! M n By Taylor s forula we can expand f n as f n 1 1 c 1 1 c n n + c s, 1 n + c s, M c 1! M. Thus we obtan 1 n + n f n n c! M < c! n c M 1 1 c M ξ!2 3!! 2 3!!. 2!!n n 1 2
5 210 The Sxth Internatonal Syposu on Operatons Research and Its Applcatons Usng Lea 1, we can prove the followng theore. Theore 2. 1 n + On for fxed 1. In Theore 1, let 2k 1, we have 2k 1 2k 1 1 n + k 1 2k 1 n + 2 k 1 2 On 2k k n By the defnton of rn,k and let a 2k 1 2n + 2 and b 2 2k 1 2n n 1 and note n On, we obtan the an result n ths paper: Theore 3. rn,k On 2k+ 3 2 for fxed k 1. Note that the requreent that nteger a and b are not larger than n s satsfed as long as k s fxed and s n range [0,2k 1], and n s satsfed that a 2k 1 2n and b 2k 1 2n One ght wonder whether the upper bound of Theore 2 can be proved by a ore sophstcated type of lnear cobnaton n for of x n + a. The followng theore shows that such an proveent s possble, whch also ples that ths bound s the best possble for the proble wth the above entoned specfc type of ntegers. Theore 4. Let 1 be a fxed nteger, and let x 0,x 1,...,x and a 0,a 1,...,a be real nubers such that a a for 0. Let gn x n + a. Then gn on on f and only f x 0 for 0. Proof. The If part s trval. Now we prove the Only If part. Assue that gn x n + a on + 1 2, we shall show x 0 for 0. As n the proof of Lea 1, for 0, let c denote the coeffcent of the -th ter n the Taylor seres of 1 + x,.e. 1 + x c x + Ox +1. We now can express gn/ n as Taylor expanson of a /n to ts -th ter: gn n x 1 + a n x c a n 1 + O n +1
6 An Optal Bound for Su of Square Roots of Specal Type of Integers 211 c x a 1 n + O 1 n +1 By the assupton that gn on + 1 2, or equvalently gn/ n on, we have that x a 0 for 0. We can regard the as a group of + 1 equatons for varables x 0,x 1,...,x, they have a non-zero soluton f and only f the coeffcent deternant a 0, s zero. But ths s possble snce a 0, s exactly the Vanderonde Deternant of a 0,a 1,...,a, t s zero f and only f a a for soe 0. If a a for soe 0, then gn cannot be bounded above by on + 1 2, a contradcton. Thus all x ust be zero. References [1] Erk D. Deane, Joseph S. B. Mtchell and Joseph O Rourke. The Open Probles Proect, Proble 33: Su of Square Roots. ~orourke/topp/p33.htl. [2] Usenet newsgroup sc.ath 25 Dec 90. What s the nu nonzero dfference between two sus of square roots of ntegers? edu/~eppsten/unkyard/sall-dst.htl. [3] Joseph O Rourke. Advanced proble Aer. Math. Monthly, 8810, 769, [4] C. Burnkel, R. Flescher, K. Mehlhorn and S. Schrra. A strong and easly coputable separaton bound for arthetc expressons nvolvng radcals. Algorthca, 271, 87 99, [5] Dana Anglun and Sarah Esenstat. How close can a + b be to an nteger? Manuscrpt n ftp://ftp.cs.yale.edu/pub/tr/tr1279.pdf.
Least Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationA Proof of a Conjecture for the Number of Ramified Coverings of the Sphere by the Torus
Journal of Cobnatoral Theory, Seres A 88, 4658 (999) Artcle ID jcta99999, avalable onlne at httpwwwdealbraryco on A Proof of a Conjecture for the Nuber of Rafed Coverngs of the Sphere by the Torus I P
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationMultiplicative Functions and Möbius Inversion Formula
Multplcatve Functons and Möbus Inverson Forula Zvezdelna Stanova Bereley Math Crcle Drector Mlls College and UC Bereley 1. Multplcatve Functons. Overvew Defnton 1. A functon f : N C s sad to be arthetc.
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More information= m 1. sin π( ai z ) )
EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION John Beeee Unversty of Alaska Anchorage July 0 199 The Gauss-Legendre ultplcaton forula for the gaa functon s
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationFORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS
U.P.B. Sc. Bull., Seres A, Vol. 77, Iss. 4, 015 ISSN 13-707 FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS Erah KILIÇ 1, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ3 Recently
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationIntegral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions
Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationOn Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1
Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de
More informationLimit Cycle Bifurcations in a Class of Cubic System near a Nilpotent Center *
Appled Mateatcs 77-777 ttp://dxdoorg/6/a75 Publsed Onlne July (ttp://wwwscrporg/journal/a) Lt Cycle Bfurcatons n a Class of Cubc Syste near a Nlpotent Center * Jao Jang Departent of Mateatcs Sanga Marte
More informationOn an identity for the cycle indices of rooted tree automorphism groups
On an dentty for the cycle ndces of rooted tree autoorphs groups Stephan G Wagner Insttut für Analyss und Coputatonal Nuber Theory Technsche Unverstät Graz Steyrergasse 30, 800 Graz, Austra wagner@fnanzathtugrazat
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationCollaborative Filtering Recommendation Algorithm
Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More information4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation
4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationSINCE the 1990s, chaotic cryptography has attracted more
1 On the Securty of the Y-Tan-Sew Chaotc Cpher Shujun L, Guanrong Chen, Fellow, IEEE and Xuanqn Mou Abstract Ths paper presents a coprehensve analyss on the securty of the Y-Tan-Sew chaotc cpher proposed
More informationBy M. O'Neill,* I. G. Sinclairf and Francis J. Smith
52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled
More informationTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Te and Space Coplexty Reducton of a Cryptanalyss Algorth Mohaad Ghasezadeh Electrcal and Coputer Engneerng Departent, Yazd Unversty, Yazd, Iran.ghasezadeh@yazdun.ac.r Receved: /4/6; Accepted: /5/4 Pages:
More informationLECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA
LECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA As we have seen, 1. Taylor s expanson on Le group, Y ] a(y ). So f G s an abelan group, then c(g) : G G s the entty ap for all g G. As a consequence, a()
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationRecap: the SVM problem
Machne Learnng 0-70/5-78 78 Fall 0 Advanced topcs n Ma-Margn Margn Learnng Erc Xng Lecture 0 Noveber 0 Erc Xng @ CMU 006-00 Recap: the SVM proble We solve the follong constraned opt proble: a s.t. J 0
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationChapter One Mixture of Ideal Gases
herodynacs II AA Chapter One Mxture of Ideal Gases. Coposton of a Gas Mxture: Mass and Mole Fractons o deterne the propertes of a xture, we need to now the coposton of the xture as well as the propertes
More informationSpecial Relativity and Riemannian Geometry. Department of Mathematical Sciences
Tutoral Letter 06//018 Specal Relatvty and Reannan Geoetry APM3713 Seester Departent of Matheatcal Scences IMPORTANT INFORMATION: Ths tutoral letter contans the solutons to Assgnent 06. BAR CODE Learn
More informationApproximate Technique for Solving Class of Fractional Variational Problems
Appled Matheatcs, 5, 6, 837-846 Publshed Onlne May 5 n ScRes. http://www.scrp.org/journal/a http://dx.do.org/.436/a.5.6578 Approxate Technque for Solvng Class of Fractonal Varatonal Probles Ead M. Soloua,,
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More information1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)
EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationTowards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF(2 k )
Towards strong securty n ebedded and pervasve systes: energy and area optzed seral polynoal ultplers n GF( k ) Zoya Dyka, Peter Langendoerfer, Frank Vater and Steffen Peter IHP, I Technologepark 5, D-53
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationHandling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload
PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationTHE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York
#A8 INTEGERS 8 (8) THE ADJACENCY-PELL-HURWITZ NUMBERS Josh Hller Departent of Matheatcs and Coputer Scence Adelp Unversty New York johller@adelphedu Yeş Aküzü Faculty of Scence and Letters Kafkas Unversty
More informationMachine Learning. What is a good Decision Boundary? Support Vector Machines
Machne Learnng 0-70/5 70/5-78 78 Sprng 200 Support Vector Machnes Erc Xng Lecture 7 March 5 200 Readng: Chap. 6&7 C.B book and lsted papers Erc Xng @ CMU 2006-200 What s a good Decson Boundar? Consder
More informationarxiv: v1 [math.ac] 23 Oct 2018
arxv:181010055v1 [athac] 23 Oct 2018 Explct Bo-Söderberg theory of deals fro a graph soorphs reducton Alexander Engströ Laura Jakobsson Mlo Orlch October 25, 2018 Abstract In the orgns of coplexty theory
More informationLecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15.
Lecture Caera Models Caera Calbraton rofessor Slvo Savarese Coputatonal Vson and Geoetry Lab Slvo Savarese Lecture - - Jan- 5 Lecture Caera Models Caera Calbraton Recap of caera odels Caera calbraton proble
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationModified parallel multisplitting iterative methods for non-hermitian positive definite systems
Adv Coput ath DOI 0.007/s0444-0-9262-8 odfed parallel ultsplttng teratve ethods for non-hertan postve defnte systes Chuan-Long Wang Guo-Yan eng Xue-Rong Yong Receved: Septeber 20 / Accepted: 4 Noveber
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationRevision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax
.9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationPARTITIONS WITH PARTS IN A FINITE SET
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 28, Nuber 5, Pages 269 273 S 0002-9939(0005606-9 Artcle electroncally publshe on February 7, 2000 PARTITIONS WITH PARTS IN A FINITE SET MELVYN B.
More informationRobust Algorithms for Preemptive Scheduling
DOI 0.007/s00453-0-978-3 Robust Algorths for Preeptve Schedulng Leah Epsten Asaf Levn Receved: 4 March 0 / Accepted: 9 Noveber 0 Sprnger Scence+Busness Meda New York 0 Abstract Preeptve schedulng probles
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationEXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD
www.arpapress.co/volues/vol16issue/ijrras_16 10.pdf EXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD Chengbo Tan & Qnghua Feng * School of Scence, Shandong
More informationFUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE
he 3 rd Internatonal Conference on Quanttatve ethods ISBN 979-989 Used n Econoc and Busness. June 6-8, 00 FUZZY ODEL FOR FORECASING INERES RAE OF BANK INDONESIA CERIFICAE Agus aan Abad, Subanar, Wdodo
More informationFinal Exam Solutions, 1998
58.439 Fnal Exa Solutons, 1998 roble 1 art a: Equlbru eans that the therodynac potental of a consttuent s the sae everywhere n a syste. An exaple s the Nernst potental. If the potental across a ebrane
More informationCOMP th April, 2007 Clement Pang
COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationSolving 2D-BKDV Equation by a Sub-ODE Method
Internatonal Conference on Coputer Technology and Scence (ICCTS ) IPCSIT vol 47 () () IACSIT Press Sngapore DOI: 7763/IPCSITV4756 Solvng D-BKDV Equaton by a Sub-ODE Method Bn Zheng + School of Scence Shandong
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationA Radon-Nikodym Theorem for Completely Positive Maps
A Radon-Nody Theore for Copletely Postve Maps V P Belavn School of Matheatcal Scences, Unversty of Nottngha, Nottngha NG7 RD E-al: vpb@aths.nott.ac.u and P Staszews Insttute of Physcs, Ncholas Coperncus
More informationGeneral Permanence Conditions for Nonlinear Difference Equations of Higher Order
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 213, 496 510 1997 ARTICLE NO. AY975553 General Peranence Condtons for Nonlnear Dfference Equatons of Hgher Order Hassan Sedaghat* Departent of Matheatcal
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationConditionalization for Interval Probabilities
Condtonalzaton for Interval robabltes Alex Dekhtyar Judy Goldsth Abstract Condtonalzaton,.e., coputaton of a condtonal probablty dstrbuton gven a jont probablty dstrbuton of two or ore rando varables s
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationSeries Expansion for L p Hardy Inequalities
Seres Expanson for L p Hardy Inequaltes G. BARBATIS, S.FILIPPAS, & A. TERTIKAS ABSTRACT. We consder a general class of sharp L p Hardy nequaltes n R N nvolvng dstance fro a surface of general codenson
More informationThe Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value
Appl. Math. Inf. Sc. 6 No. 3 745-750 (0) 745 Appled Matheatcs & Inforaton Scences An Internatonal Journal The Non-equdstant New Inforaton Optzng MGM(n) Based on a Step by Step Optu Constructng Background
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationCSE 252C: Computer Vision III
CSE 252C: Computer Vson III Lecturer: Serge Belonge Scrbe: Catherne Wah LECTURE 15 Kernel Machnes 15.1. Kernels We wll study two methods based on a specal knd of functon k(x, y) called a kernel: Kernel
More informationOn the Construction of Polar Codes
On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.
More informationPolynomial Barrier Method for Solving Linear Programming Problems
Internatonal Journal o Engneerng & echnology IJE-IJENS Vol: No: 45 Polynoal Barrer Method or Solvng Lnear Prograng Probles Parwad Moengn, Meber, IAENG Abstract In ths wor, we study a class o polynoal ordereven
More informationOn the Construction of Polar Codes
On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.
More informationSolutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationSupplementary Notes for Chapter 9 Mixture Thermodynamics
Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects
More information