Fall 2014 Randomized Algorithms Oct 8, Lecture 3
|
|
- Junior Whitehead
- 6 years ago
- Views:
Transcription
1 Fall 204 Randomized Algoithms Oct 8, 204 Lectue 3 Pof. Fiedich Eisenband Scibes: Floian Tamè In this lectue we will be concened with linea pogamming, in paticula Clakson s Las Vegas algoithm []. The main esult is an expected polytime eduction fom an LP in dimension d with n constaints to O(n) LPs in dimension d with O(d 2 ) constaints. In a second pat, we intoduce bounds on the diamete of a polyheda, a topic which we will view in moe detail in the next lectue. Finally, we discuss the smallest enclosing disk poblem as an application of Clakson s algoithm. Linea Pogamming We conside the taditional fomulation of linea pogamming in d dimensions with n constaints as max c > x, x2r d subject to Ax apple b. Thoughout this lectue, we will make the following assumptions: A 2 R n d has full ank. Thee exists a basis B {,...,n}, B = d such that A B is non singula and x = A B b B is optimal (x has d tight constaints). The optimal solution x is unique (note that this can always be achieved by slightly petubing the objective function). Clakson s Algoithm We begin with a vey useful lemma. We emind that a multiset is a set in which membes may appea moe than once. We denote the cadinality of a multiset H by. By H, we denote the collection of all sub-multisets of H of cadinality. Fo a set (o multiset) U of constaints, let x U be the optimal solution (if it exists) of the LP esticted to the constaints in U. Lemma (Sampling Lemma) Let G be a set of constaints and H be a multiset of constaints of dimension d. Let R 2 H be picked unifomly at andom. Let V R = {h 2 H : x G[R violates h}. Then, E [ V R ] apple d +.
2 Poof We have E [ V R ]= P (h, R) = ( R2( H ) ) V R. Define the chaacteistic function ( if x G[R violates h 0 othewise. We get E [ V R ]= R2( H ) = h2h\r Q2( +) H h2q (h, R) (h, Q h), whee the last equality holds since picking constaints and then an additional constaint fom H is equivalent to picking + constaints fom H and then one constaint out of these. Fix a basis B of G [ Q. Suppose that the chosen constaint h is violated by x G[(Q h) (and thus = ). Then, it follows that h has to be pat of the basis B. Since B = d, wehave = fo at most d constaints. Thus, E [ V R ]= Q2( H +) d = d + = d. + We can now pesent the Clakson(2) algoithm. The Clakson() algoithm will be discussed in the next lectue. Algoithm Clakson(2) Input: A multiset H containing the n constaints of the LP Output: The solution x to the LP : Set =6 d 2 2: epeat 3: Pick R 2 H unifomly at andom 4: Compute x R and V R = {h 2 H : x R violates h} 5: if V R apple then 6: H = H + V R (double the occuence of each h 2 V R in H. 7: end if 8: until V R = ; 9: etun x R 2
3 Analysis of Clakson(2) Fist of all, note that we educe the poblem of solving ou LP with n constaints to the poblem of solving LPs with =6 d 2 = O(d 2 ) constaints (line 4). We thus still need to show that the whole pocedue is epeated O(n) times. We analyse the pobability that the if statement (line 5) is satisfied. By the Sampling Lemma, we have E[ V R ] apple d 6d2 6d 2 + Thus, using Makov s inequality, we get apple P V R apple apple = P V R > apple 6d. = P [ V R > 2 E[ V R ]] {z } apple 2 2. We now bound the numbe of successful iteations, whee the if statement is satisfied (and thus V R apple ). Note that fom the pevious esult, we may then bound the expected numbe of iteations (and thus the expected numbe of LPs to solve) by twice the numbe of successful iteations. Lemma 2 The numbe of successful iteations is O(d log(n)). Poof Let B H be the basis fo the optimal solution x of the LP (note that B is a sub-multiset of H so it may contain a constaint moe than once). Let µ i (B) denote the cadinality of B afte iteation i. By definition of the basis, we have µ 0 (B) =d. Note that if x R doesn t violate any constaint of the basis, then it is an optimal solution to the LP. Fo all but the last iteation, we have V R 6= ;, meaning that x R is not the oveall-optimal solution, and thus V R contains at least one constaint of B. Thus, at each iteation, at least one basis constaint has its numbe of occuences doubled in H. We thus get that µ i d (B) 2 i d 2 i. Now conside how the cadinality of H gows. We have µ 0 (H) =. On a successful iteation, we add V R apple constaints to H. Thus, µ i+ (H) apple µ i (H) + µ i(h) =(+ )µ i(h). Afte i d iteations, we have µ i d (H) apple ( + )i d apple e i 3. Finally, note that the multiset B is always a sub-multiset of H. Afte d i iteations, we thus must have 2 i apple n e i 3, and theefoe i = O(log(n)). We theefoe get that the numbe of successful iteations is O(d log(n)). Since the pobability of an iteation being successful is geate than 2 we expect to have at most 2 O(d log(n)) = O(d log(n)) iteations. Clakson s algoithm thus educes an LP in d dimensions with n constaints to an expected O(d log(n)) LPs with O(d 2 ) constaints in expected polynomial time. 3
4 A note about unbounded LPs To deal with LPs that might be unbounded, we can fix a box of 2 d constaints, thus constaining the optimal solutions inside this box. In the analysis, these 2 d constaints ae added to the oiginal set G defined in the Sampling Lemma, which we have consideed to be empty in the above analysis. Open poblem: bounding the diamete of a polyhedon Conside a polyhedon in d dimensions defined by P = x 2 R d : Ax apple b, whee A 2 R n d. We make the assumption that P is non-degeneate, meaning that each vetex of the polyhedon is defined by d tight constaints. Fo a vetex x of P, we define the basis B x as the set of d tight constaints defining x. Two vetices x and y ae neighbous if B x \ B y = d (the two vetices only di e in one tight constaint). Definition 3 Fo a polyhedon P, conside the gaph G on vetices of P obtained by inseting edges between neighbouing vetices. The diamete of P is the lagest shotest-path distance (in numbe of edges) between any two vetices in G. Definition 4 Let constaints. d,n be the lagest diamete of a polyhedon P R d with n Theoem 5 ([2, 3, 4]) d,n apple n log(d)+. Conjectue 6 Thee exists a function f such that which does not depend on n). d,n = O(n) f(d) (fo a f Smallest enclosing disk Conside a set of n points in R 2 and the task of finding the smallest disk enclosing all of these points. Fist of all, we discuss how we may convince ouselves that a given cicle is indeed the smallest enclosing disk. Fo a given cicle, take all the points appeaing on the bounday of the cicle. Now, if the cente of the cicle is not inside of the convex hull of these points, it is easy to see that we may shift the cente of the cicle towads the convex hull and shink it since it now englobes all the points which peviously wee on its bounday. One can actually find that a disk is the smallest enclosing disk if it contains all points and one of the following two conditions is satisfied In [4], Kalai and Kleitman povide an uppe bound of n log(d)+2.thetighteboundwas shown by Kalai [3] and Eisenband et al. [2]. 4
5 Thee exist 3 points on the bounday of the disk such that the cente of the disk lies in the convex hull of the thee points. Thee ae 2 points on the bounday such that the cente of the disk is thei midpoint. We can veify that the Clakson(2) algoithm we descibed can be used to find the smallest enclosing disk in expected O(n log n) time. Indeed, in each iteation we pick a set R of 6 d 2 = 24 points, find a smallest enclosing disk on R, check which emaining points fall outside of the disk and double thei weight. By a simila analysis as fo the LP, we can show that the numbe of iteations is O(log n) and that each iteation takes time O(n) (finding the optimal disk on R can be done in constant time since R has constant size; checking which points fall outside the disk can be done in O(n) time though some cleve manipulation of copies of points in the multiset). Refeences [] Kenneth L. Clakson. Las vegas algoithms fo linea and intege pogamming when the dimension is small. J. ACM, 42(2): , Mach 995. [2] Fiedich Eisenband, Nicolai Hähnle, and Thomas Rothvoß. Diamete of polyheda: Limits of abstaction. In Poceedings of the Twenty-fifth Annual Symposium on Computational Geomety, SCG 09, pages , New Yok, NY, USA, ACM. [3] Gil Kalai. Linea pogamming, the simplex algoithm and simple polytopes. Math. Pogamming, 79:27 233, 997. [4] Gil Kalai and Daniel J Kleitman. A quasi-polynomial bound fo the diamete of gaphs of polyheda. Bulletin of the Ameican Mathematical Society, 26(2):35 36,
15.081J/6.251J Introduction to Mathematical Programming. Lecture 6: The Simplex Method II
15081J/6251J Intoduction to Mathematical Pogamming ectue 6: The Simplex Method II 1 Outline Revised Simplex method Slide 1 The full tableau implementation Anticycling 2 Revised Simplex Initial data: A,
More informationThe Chromatic Villainy of Complete Multipartite Graphs
Rocheste Institute of Technology RIT Schola Wos Theses Thesis/Dissetation Collections 8--08 The Chomatic Villainy of Complete Multipatite Gaphs Anna Raleigh an9@it.edu Follow this and additional wos at:
More informationMethod for Approximating Irrational Numbers
Method fo Appoximating Iational Numbes Eic Reichwein Depatment of Physics Univesity of Califonia, Santa Cuz June 6, 0 Abstact I will put foth an algoithm fo poducing inceasingly accuate ational appoximations
More informationLecture 18: Graph Isomorphisms
INFR11102: Computational Complexity 22/11/2018 Lectue: Heng Guo Lectue 18: Gaph Isomophisms 1 An Athu-Melin potocol fo GNI Last time we gave a simple inteactive potocol fo GNI with pivate coins. We will
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationQuasi-Randomness and the Distribution of Copies of a Fixed Graph
Quasi-Randomness and the Distibution of Copies of a Fixed Gaph Asaf Shapia Abstact We show that if a gaph G has the popety that all subsets of vetices of size n/4 contain the coect numbe of tiangles one
More informationA Bijective Approach to the Permutational Power of a Priority Queue
A Bijective Appoach to the Pemutational Powe of a Pioity Queue Ia M. Gessel Kuang-Yeh Wang Depatment of Mathematics Bandeis Univesity Waltham, MA 02254-9110 Abstact A pioity queue tansfoms an input pemutation
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Mach 6, 013 Abstact To study how balanced o unbalanced a maximal intesecting
More information6 Matrix Concentration Bounds
6 Matix Concentation Bounds Concentation bounds ae inequalities that bound pobabilities of deviations by a andom vaiable fom some value, often its mean. Infomally, they show the pobability that a andom
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationAn upper bound on the number of high-dimensional permutations
An uppe bound on the numbe of high-dimensional pemutations Nathan Linial Zu Luia Abstact What is the highe-dimensional analog of a pemutation? If we think of a pemutation as given by a pemutation matix,
More informationC/CS/Phys C191 Shor s order (period) finding algorithm and factoring 11/12/14 Fall 2014 Lecture 22
C/CS/Phys C9 Sho s ode (peiod) finding algoithm and factoing /2/4 Fall 204 Lectue 22 With a fast algoithm fo the uantum Fouie Tansfom in hand, it is clea that many useful applications should be possible.
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationCOLLAPSING WALLS THEOREM
COLLAPSING WALLS THEOREM IGOR PAK AND ROM PINCHASI Abstact. Let P R 3 be a pyamid with the base a convex polygon Q. We show that when othe faces ae collapsed (otated aound the edges onto the plane spanned
More informationMultiple Criteria Secretary Problem: A New Approach
J. Stat. Appl. Po. 3, o., 9-38 (04 9 Jounal of Statistics Applications & Pobability An Intenational Jounal http://dx.doi.og/0.785/jsap/0303 Multiple Citeia Secetay Poblem: A ew Appoach Alaka Padhye, and
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Septembe 5, 011 Abstact To study how balanced o unbalanced a maximal intesecting
More informationEncapsulation theory: radial encapsulation. Edmund Kirwan *
Encapsulation theoy: adial encapsulation. Edmund Kiwan * www.edmundkiwan.com Abstact This pape intoduces the concept of adial encapsulation, wheeby dependencies ae constained to act fom subsets towads
More informationThe Archimedean Circles of Schoch and Woo
Foum Geometicoum Volume 4 (2004) 27 34. FRUM GEM ISSN 1534-1178 The Achimedean Cicles of Schoch and Woo Hioshi kumua and Masayuki Watanabe Abstact. We genealize the Achimedean cicles in an abelos (shoemake
More information1 Explicit Explore or Exploit (E 3 ) Algorithm
2.997 Decision-Making in Lage-Scale Systems Mach 3 MIT, Sping 2004 Handout #2 Lectue Note 9 Explicit Exploe o Exploit (E 3 ) Algoithm Last lectue, we studied the Q-leaning algoithm: [ ] Q t+ (x t, a t
More informationThe Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr
The Congestion of n-cube Layout on a Rectangula Gid S.L. Bezukov J.D. Chavez y L.H. Hape z M. Rottge U.-P. Schoede Abstact We conside the poblem of embedding the n-dimensional cube into a ectangula gid
More informationSUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Discussiones Mathematicae Gaph Theoy 39 (019) 567 573 doi:10.7151/dmgt.096 SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER Lutz Volkmann
More informationProbablistically Checkable Proofs
Lectue 12 Pobablistically Checkable Poofs May 13, 2004 Lectue: Paul Beame Notes: Chis Re 12.1 Pobablisitically Checkable Poofs Oveview We know that IP = PSPACE. This means thee is an inteactive potocol
More informationFractional Zero Forcing via Three-color Forcing Games
Factional Zeo Focing via Thee-colo Focing Games Leslie Hogben Kevin F. Palmowski David E. Robeson Michael Young May 13, 2015 Abstact An -fold analogue of the positive semidefinite zeo focing pocess that
More informationIntroduction Common Divisors. Discrete Mathematics Andrei Bulatov
Intoduction Common Divisos Discete Mathematics Andei Bulatov Discete Mathematics Common Divisos 3- Pevious Lectue Integes Division, popeties of divisibility The division algoithm Repesentation of numbes
More informationQIP Course 10: Quantum Factorization Algorithm (Part 3)
QIP Couse 10: Quantum Factoization Algoithm (Pat 3 Ryutaoh Matsumoto Nagoya Univesity, Japan Send you comments to yutaoh.matsumoto@nagoya-u.jp Septembe 2018 @ Tokyo Tech. Matsumoto (Nagoya U. QIP Couse
More information10/04/18. P [P(x)] 1 negl(n).
Mastemath, Sping 208 Into to Lattice lgs & Cypto Lectue 0 0/04/8 Lectues: D. Dadush, L. Ducas Scibe: K. de Boe Intoduction In this lectue, we will teat two main pats. Duing the fist pat we continue the
More informationNumerical approximation to ζ(2n+1)
Illinois Wesleyan Univesity Fom the SelectedWoks of Tian-Xiao He 6 Numeical appoximation to ζ(n+1) Tian-Xiao He, Illinois Wesleyan Univesity Michael J. Dancs Available at: https://woks.bepess.com/tian_xiao_he/6/
More informationSurveillance Points in High Dimensional Spaces
Société de Calcul Mathématique SA Tools fo decision help since 995 Suveillance Points in High Dimensional Spaces by Benad Beauzamy Januay 06 Abstact Let us conside any compute softwae, elying upon a lage
More informationA solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
A solution to a poblem of Günbaum and Motzkin and of Edős and Pudy about bichomatic configuations of points in the plane Rom Pinchasi July 29, 2012 Abstact Let P be a set of n blue points in the plane,
More informationON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},
ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION E. J. IONASCU and A. A. STANCU Abstact. We ae inteested in constucting concete independent events in puely atomic pobability
More informationCentral Coverage Bayes Prediction Intervals for the Generalized Pareto Distribution
Statistics Reseach Lettes Vol. Iss., Novembe Cental Coveage Bayes Pediction Intevals fo the Genealized Paeto Distibution Gyan Pakash Depatment of Community Medicine S. N. Medical College, Aga, U. P., India
More informationRelating Branching Program Size and. Formula Size over the Full Binary Basis. FB Informatik, LS II, Univ. Dortmund, Dortmund, Germany
Relating Banching Pogam Size and omula Size ove the ull Binay Basis Matin Saueho y Ingo Wegene y Ralph Wechne z y B Infomatik, LS II, Univ. Dotmund, 44 Dotmund, Gemany z ankfut, Gemany sauehof/wegene@ls.cs.uni-dotmund.de
More informationOutput-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Output-Sensitive Algoithms fo Computing Neaest-Neighbou Decision Boundaies David Bemne 1, Eik Demaine 2, Jeff Eickson 3, John Iacono 4, Stefan Langeman 5, Pat Moin 6, and Godfied Toussaint 7 1 Faculty
More information3.1 Random variables
3 Chapte III Random Vaiables 3 Random vaiables A sample space S may be difficult to descibe if the elements of S ae not numbes discuss how we can use a ule by which an element s of S may be associated
More informationAnalysis of simple branching trees with TI-92
Analysis of simple banching tees with TI-9 Dušan Pagon, Univesity of Maibo, Slovenia Abstact. In the complex plane we stat at the cente of the coodinate system with a vetical segment of the length one
More informationOn the Structure of Linear Programs with Overlapping Cardinality Constraints
On the Stuctue of Linea Pogams with Ovelapping Cadinality Constaints Tobias Fische and Mac E. Pfetsch Depatment of Mathematics, TU Damstadt, Gemany tfische,pfetsch}@mathematik.tu-damstadt.de Januay 25,
More informationEQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS
EQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS ATHULA GUNAWARDENA AND ROBERT R MEYER Abstact A d-dimensional gid gaph G is the gaph on a finite subset in the intege lattice Z d in
More informationSection 8.2 Polar Coordinates
Section 8. Pola Coodinates 467 Section 8. Pola Coodinates The coodinate system we ae most familia with is called the Catesian coodinate system, a ectangula plane divided into fou quadants by the hoizontal
More informationHOW TO TEACH THE FUNDAMENTALS OF INFORMATION SCIENCE, CODING, DECODING AND NUMBER SYSTEMS?
6th INTERNATIONAL MULTIDISCIPLINARY CONFERENCE HOW TO TEACH THE FUNDAMENTALS OF INFORMATION SCIENCE, CODING, DECODING AND NUMBER SYSTEMS? Cecília Sitkuné Göömbei College of Nyíegyháza Hungay Abstact: The
More information(n 1)n(n + 1)(n + 2) + 1 = (n 1)(n + 2)n(n + 1) + 1 = ( (n 2 + n 1) 1 )( (n 2 + n 1) + 1 ) + 1 = (n 2 + n 1) 2.
Paabola Volume 5, Issue (017) Solutions 151 1540 Q151 Take any fou consecutive whole numbes, multiply them togethe and add 1. Make a conjectue and pove it! The esulting numbe can, fo instance, be expessed
More informationAn intersection theorem for four sets
An intesection theoem fo fou sets Dhuv Mubayi Novembe 22, 2006 Abstact Fix integes n, 4 and let F denote a family of -sets of an n-element set Suppose that fo evey fou distinct A, B, C, D F with A B C
More informationLecture 28: Convergence of Random Variables and Related Theorems
EE50: Pobability Foundations fo Electical Enginees July-Novembe 205 Lectue 28: Convegence of Random Vaiables and Related Theoems Lectue:. Kishna Jagannathan Scibe: Gopal, Sudhasan, Ajay, Swamy, Kolla An
More informationON SPARSELY SCHEMMEL TOTIENT NUMBERS. Colin Defant 1 Department of Mathematics, University of Florida, Gainesville, Florida
#A8 INTEGERS 5 (205) ON SPARSEL SCHEMMEL TOTIENT NUMBERS Colin Defant Depatment of Mathematics, Univesity of Floida, Gainesville, Floida cdefant@ufl.edu Received: 7/30/4, Revised: 2/23/4, Accepted: 4/26/5,
More informationEncapsulation theory: the transformation equations of absolute information hiding.
1 Encapsulation theoy: the tansfomation equations of absolute infomation hiding. Edmund Kiwan * www.edmundkiwan.com Abstact This pape descibes how the potential coupling of a set vaies as the set is tansfomed,
More informationA Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
A Simple Sampling Lemma: Analysis and Applications in Geometic Optimization Bend Gätne and Emo Welzl Apil 2, 2001 Abstact andom sampling is an efficient method to deal with constained optimization poblems
More informationKOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS
Jounal of Applied Analysis Vol. 14, No. 1 2008), pp. 43 52 KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS L. KOCZAN and P. ZAPRAWA Received Mach 12, 2007 and, in evised fom,
More informationChapter 3: Theory of Modular Arithmetic 38
Chapte 3: Theoy of Modula Aithmetic 38 Section D Chinese Remainde Theoem By the end of this section you will be able to pove the Chinese Remainde Theoem apply this theoem to solve simultaneous linea conguences
More informationTHE NUMBER OF TWO CONSECUTIVE SUCCESSES IN A HOPPE-PÓLYA URN
TH NUMBR OF TWO CONSCUTIV SUCCSSS IN A HOPP-PÓLYA URN LARS HOLST Depatment of Mathematics, Royal Institute of Technology S 100 44 Stocholm, Sweden -mail: lholst@math.th.se Novembe 27, 2007 Abstact In a
More informationarxiv: v1 [math.co] 4 May 2017
On The Numbe Of Unlabeled Bipatite Gaphs Abdullah Atmaca and A Yavuz Ouç axiv:7050800v [mathco] 4 May 207 Abstact This pape solves a poblem that was stated by M A Haison in 973 [] This poblem, that has
More informationSupplementary information Efficient Enumeration of Monocyclic Chemical Graphs with Given Path Frequencies
Supplementay infomation Efficient Enumeation of Monocyclic Chemical Gaphs with Given Path Fequencies Masaki Suzuki, Hioshi Nagamochi Gaduate School of Infomatics, Kyoto Univesity {m suzuki,nag}@amp.i.kyoto-u.ac.jp
More informationAuchmuty High School Mathematics Department Advanced Higher Notes Teacher Version
The Binomial Theoem Factoials Auchmuty High School Mathematics Depatment The calculations,, 6 etc. often appea in mathematics. They ae called factoials and have been given the notation n!. e.g. 6! 6!!!!!
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More informationGROWTH ESTIMATES THROUGH SCALING FOR QUASILINEAR PARTIAL DIFFERENTIAL EQUATIONS
Annales Academiæ Scientiaum Fennicæ Mathematica Volumen 32, 2007, 595 599 GROWTH ESTIMATES THROUGH SCALING FOR QUASILINEAR PARTIAL DIFFERENTIAL EQUATIONS Teo Kilpeläinen, Henik Shahgholian and Xiao Zhong
More informationA NOTE ON VERY WEAK SOLUTIONS FOR A CLASS OF NONLINEAR ELLIPTIC EQUATIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol3 15 2007, 41 45 A NOTE ON VERY WEAK SOLUTIONS FOR A CLASS OF NONLINEAR ELLIPTIC EQUATIONS LI JULING AND GAO HONGYA Abstact We pove a new a pioi estimate fo vey weak
More informationWhy Professor Richard Feynman was upset solving the Laplace equation for spherical waves? Anzor A. Khelashvili a)
Why Pofesso Richad Feynman was upset solving the Laplace equation fo spheical waves? Anzo A. Khelashvili a) Institute of High Enegy Physics, Iv. Javakhishvili Tbilisi State Univesity, Univesity St. 9,
More informationAdditive Approximation for Edge-Deletion Problems
Additive Appoximation fo Edge-Deletion Poblems Noga Alon Asaf Shapia Benny Sudakov Abstact A gaph popety is monotone if it is closed unde emoval of vetices and edges. In this pape we conside the following
More informationDouble-angle & power-reduction identities. Elementary Functions. Double-angle & power-reduction identities. Double-angle & power-reduction identities
Double-angle & powe-eduction identities Pat 5, Tigonomety Lectue 5a, Double Angle and Powe Reduction Fomulas In the pevious pesentation we developed fomulas fo cos( β) and sin( β) These fomulas lead natually
More informationThe height of minimal Hilbert bases
1 The height of minimal Hilbet bases Matin Henk and Robet Weismantel Abstact Fo an integal polyhedal cone C = pos{a 1,..., a m, a i Z d, a subset BC) C Z d is called a minimal Hilbet basis of C iff i)
More informationOn decompositions of complete multipartite graphs into the union of two even cycles
On decompositions of complete multipatite gaphs into the union of two even cycles A. Su, J. Buchanan, R. C. Bunge, S. I. El-Zanati, E. Pelttai, G. Rasmuson, E. Spaks, S. Tagais Depatment of Mathematics
More informationβ β β β β B B B B o (i) (ii) (iii)
Output-Sensitive Algoithms fo Unifom Patitions of Points Pankaj K. Agawal y Binay K. Bhattachaya z Sandeep Sen x Octobe 19, 1999 Abstact We conside the following one and two-dimensional bucketing poblems:
More informationPearson s Chi-Square Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted Histograms
Peason s Chi-Squae Test Modifications fo Compaison of Unweighted and Weighted Histogams and Two Weighted Histogams Univesity of Akueyi, Bogi, v/noduslód, IS-6 Akueyi, Iceland E-mail: nikolai@unak.is Two
More informationRANSAC for (Quasi-)Degenerate data (QDEGSAC)
RANSAC fo (Quasi-)Degeneate data (QDEGSAC) Jan-Michael Fahm and Mac Pollefeys Depatment of Compute Science, Univesity of Noth Caolina at Chapel Hill, Chapel Hill, NC 27599 {jmf, mac}@cs.unc.edu Abstact
More informationarxiv: v1 [math.co] 6 Mar 2008
An uppe bound fo the numbe of pefect matchings in gaphs Shmuel Fiedland axiv:0803.0864v [math.co] 6 Ma 2008 Depatment of Mathematics, Statistics, and Compute Science, Univesity of Illinois at Chicago Chicago,
More informationApproximation Algorithms and Hardness of the k-route Cut Problem
Appoximation Algoithms and Hadness of the k-route Cut Poblem Julia Chuzhoy Yuy Makaychev Aavindan Vijayaaghavan Yuan Zhou Decembe 14, 2011 Abstact We study the k-oute cut poblem: given an undiected edge-weighted
More informationJournal of Inequalities in Pure and Applied Mathematics
Jounal of Inequalities in Pue and Applied Mathematics COEFFICIENT INEQUALITY FOR A FUNCTION WHOSE DERIVATIVE HAS A POSITIVE REAL PART S. ABRAMOVICH, M. KLARIČIĆ BAKULA AND S. BANIĆ Depatment of Mathematics
More informationPHYS 301 HOMEWORK #10 (Optional HW)
PHYS 301 HOMEWORK #10 (Optional HW) 1. Conside the Legende diffeential equation : 1 - x 2 y'' - 2xy' + m m + 1 y = 0 Make the substitution x = cos q and show the Legende equation tansfoms into d 2 y 2
More informationTHE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX. Jaejin Lee
Koean J. Math. 23 (2015), No. 3, pp. 427 438 http://dx.doi.og/10.11568/kjm.2015.23.3.427 THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX Jaejin Lee Abstact. The Schensted algoithm fist descibed by Robinson
More informationMULTILAYER PERCEPTRONS
Last updated: Nov 26, 2012 MULTILAYER PERCEPTRONS Outline 2 Combining Linea Classifies Leaning Paametes Outline 3 Combining Linea Classifies Leaning Paametes Implementing Logical Relations 4 AND and OR
More informationONE-POINT CODES USING PLACES OF HIGHER DEGREE
ONE-POINT CODES USING PLACES OF HIGHER DEGREE GRETCHEN L. MATTHEWS AND TODD W. MICHEL DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 29634-0975 U.S.A. E-MAIL: GMATTHE@CLEMSON.EDU, TMICHEL@CLEMSON.EDU
More informationPHYS 110B - HW #7 Spring 2004, Solutions by David Pace Any referenced equations are from Griffiths Problem statements are paraphrased
PHYS 0B - HW #7 Sping 2004, Solutions by David Pace Any efeenced euations ae fom Giffiths Poblem statements ae paaphased. Poblem 0.3 fom Giffiths A point chage,, moves in a loop of adius a. At time t 0
More informationAnalytical time-optimal trajectories for an omni-directional vehicle
Analytical time-optimal tajectoies fo an omni-diectional vehicle Weifu Wang and Devin J. Balkcom Abstact We pesent the fist analytical solution method fo finding a time-optimal tajectoy between any given
More informationObtaining the size distribution of fault gouges with polydisperse bearings
Obtaining the size distibution of fault gouges with polydispese beaings Pedo G. Lind, Reza M. Baam, 2 and Hans J. Hemann 2, 3 Institute fo Computational Physics, Univesität Stuttgat, Pfaffenwalding 27,
More informationANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE
THE p-adic VALUATION OF STIRLING NUMBERS ANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE Abstact. Let p > 2 be a pime. The p-adic valuation of Stiling numbes of the
More informationTo Feel a Force Chapter 7 Static equilibrium - torque and friction
To eel a oce Chapte 7 Chapte 7: Static fiction, toque and static equilibium A. Review of foce vectos Between the eath and a small mass, gavitational foces of equal magnitude and opposite diection act on
More informationAnalytical Solutions for Confined Aquifers with non constant Pumping using Computer Algebra
Poceedings of the 006 IASME/SEAS Int. Conf. on ate Resouces, Hydaulics & Hydology, Chalkida, Geece, May -3, 006 (pp7-) Analytical Solutions fo Confined Aquifes with non constant Pumping using Compute Algeba
More informationTurán Numbers of Vertex-disjoint Cliques in r- Partite Graphs
Univesity of Wyoming Wyoming Scholas Repositoy Honos Theses AY 16/17 Undegaduate Honos Theses Sping 5-1-017 Tuán Numbes of Vetex-disjoint Cliques in - Patite Gaphs Anna Schenfisch Univesity of Wyoming,
More informationDeterministic vs Non-deterministic Graph Property Testing
Deteministic vs Non-deteministic Gaph Popety Testing Lio Gishboline Asaf Shapia Abstact A gaph popety P is said to be testable if one can check whethe a gaph is close o fa fom satisfying P using few andom
More informationDuality between Statical and Kinematical Engineering Systems
Pape 00, Civil-Comp Ltd., Stiling, Scotland Poceedings of the Sixth Intenational Confeence on Computational Stuctues Technology, B.H.V. Topping and Z. Bittna (Editos), Civil-Comp Pess, Stiling, Scotland.
More informationAQI: Advanced Quantum Information Lecture 2 (Module 4): Order finding and factoring algorithms February 20, 2013
AQI: Advanced Quantum Infomation Lectue 2 (Module 4): Ode finding and factoing algoithms Febuay 20, 203 Lectue: D. Mak Tame (email: m.tame@impeial.ac.uk) Intoduction In the last lectue we looked at the
More informationOn the integration of the equations of hydrodynamics
Uebe die Integation de hydodynamischen Gleichungen J f eine u angew Math 56 (859) -0 On the integation of the equations of hydodynamics (By A Clebsch at Calsuhe) Tanslated by D H Delphenich In a pevious
More informationGraphs of Sine and Cosine Functions
Gaphs of Sine and Cosine Functions In pevious sections, we defined the tigonometic o cicula functions in tems of the movement of a point aound the cicumfeence of a unit cicle, o the angle fomed by the
More information16 Modeling a Language by a Markov Process
K. Pommeening, Language Statistics 80 16 Modeling a Language by a Makov Pocess Fo deiving theoetical esults a common model of language is the intepetation of texts as esults of Makov pocesses. This model
More informationMA557/MA578/CS557. Lecture 14. Prof. Tim Warburton. Spring
MA557/MA578/CS557 Lectue 4 Sping 3 Pof. Tim Wabuton timwa@math.unm.edu Matlab Notes To ceate a symbolic vaiable (say theta) use the command: theta = sym( theta ); Example manipulation: Matlab cont To evaluate
More information15 Solving the Laplace equation by Fourier method
5 Solving the Laplace equation by Fouie method I aleady intoduced two o thee dimensional heat equation, when I deived it, ecall that it taes the fom u t = α 2 u + F, (5.) whee u: [0, ) D R, D R is the
More informationApplication of homotopy perturbation method to the Navier-Stokes equations in cylindrical coordinates
Computational Ecology and Softwae 5 5(): 9-5 Aticle Application of homotopy petubation method to the Navie-Stokes equations in cylindical coodinates H. A. Wahab Anwa Jamal Saia Bhatti Muhammad Naeem Muhammad
More informationTemporal-Difference Learning
.997 Decision-Making in Lage-Scale Systems Mach 17 MIT, Sping 004 Handout #17 Lectue Note 13 1 Tempoal-Diffeence Leaning We now conside the poblem of computing an appopiate paamete, so that, given an appoximation
More informationPhysics 2A Chapter 10 - Moment of Inertia Fall 2018
Physics Chapte 0 - oment of netia Fall 08 The moment of inetia of a otating object is a measue of its otational inetia in the same way that the mass of an object is a measue of its inetia fo linea motion.
More informationGroup Connectivity of 3-Edge-Connected Chordal Graphs
Gaphs and Combinatoics (2000) 16 : 165±176 Gaphs and Combinatoics ( Spinge-Velag 2000 Goup Connectivity of 3-Edge-Connected Chodal Gaphs Hong-Jian Lai Depatment of Mathematics, West Viginia Univesity,
More informationCOMPUTATIONS OF ELECTROMAGNETIC FIELDS RADIATED FROM COMPLEX LIGHTNING CHANNELS
Pogess In Electomagnetics Reseach, PIER 73, 93 105, 2007 COMPUTATIONS OF ELECTROMAGNETIC FIELDS RADIATED FROM COMPLEX LIGHTNING CHANNELS T.-X. Song, Y.-H. Liu, and J.-M. Xiong School of Mechanical Engineeing
More informationHigh Dimensional Clustering with r-nets
High Dimensional Clusteing with -nets Geogia Avaikioti, Alain Ryse, Yuyi Wang, Roge Wattenhofe ETH Zuich, Switzeland {zetava,ayse,yuwang,wattenhofe}@ethz.ch Abstact Clusteing, a fundamental task in data
More informationApproximation Algorithms and Hardness of the k-route Cut Problem
Appoximation Algoithms and Hadness of the k-route Cut Poblem Julia Chuzhoy Yuy Makaychev Aavindan Vijayaaghavan Yuan Zhou July 10, 2011 Abstact We study the k-oute cut poblem: given an undiected edge-weighted
More informationThe Millikan Experiment: Determining the Elementary Charge
LAB EXERCISE 7.5.1 7.5 The Elementay Chage (p. 374) Can you think of a method that could be used to suggest that an elementay chage exists? Figue 1 Robet Millikan (1868 1953) m + q V b The Millikan Expeiment:
More informationPhysics 107 TUTORIAL ASSIGNMENT #8
Physics 07 TUTORIAL ASSIGNMENT #8 Cutnell & Johnson, 7 th edition Chapte 8: Poblems 5,, 3, 39, 76 Chapte 9: Poblems 9, 0, 4, 5, 6 Chapte 8 5 Inteactive Solution 8.5 povides a model fo solving this type
More informationUpward order-preserving 8-grid-drawings of binary trees
CCCG 207, Ottawa, Ontaio, July 26 28, 207 Upwad ode-peseving 8-gid-dawings of binay tees Theese Biedl Abstact This pape concens upwad ode-peseving staightline dawings of binay tees with the additional
More informationr cos, and y r sin with the origin of coordinate system located at
Lectue 3-3 Kinematics of Rotation Duing ou peious lectues we hae consideed diffeent examples of motion in one and seeal dimensions. But in each case the moing object was consideed as a paticle-like object,
More informationA generalization of the Bernstein polynomials
A genealization of the Benstein polynomials Halil Ouç and Geoge M Phillips Mathematical Institute, Univesity of St Andews, Noth Haugh, St Andews, Fife KY16 9SS, Scotland Dedicated to Philip J Davis This
More informationarxiv:physics/ v2 [physics.soc-ph] 11 Mar 2005
Heide Balance in Human Netwoks P. Gawoński and K. Ku lakowski axiv:physics/5385v2 [physics.soc-ph] 11 Ma 25 Depatment of Applied Compute Science, Faculty of Physics and Applied Compute Science, AGH Univesity
More informationResearch Article On Alzer and Qiu s Conjecture for Complete Elliptic Integral and Inverse Hyperbolic Tangent Function
Abstact and Applied Analysis Volume 011, Aticle ID 697547, 7 pages doi:10.1155/011/697547 Reseach Aticle On Alze and Qiu s Conjectue fo Complete Elliptic Integal and Invese Hypebolic Tangent Function Yu-Ming
More informationApproximation Algorithms and Hardness of the k-route Cut Problem
Appoximation Algoithms and Hadness of the k-route Cut Poblem Julia Chuzhoy Yuy Makaychev Aavindan Vijayaaghavan Yuan Zhou Novembe 26, 2011 Abstact We study the k-oute cut poblem: given an undiected edge-weighted
More informationChapter 5 Linear Equations: Basic Theory and Practice
Chapte 5 inea Equations: Basic Theoy and actice In this chapte and the next, we ae inteested in the linea algebaic equation AX = b, (5-1) whee A is an m n matix, X is an n 1 vecto to be solved fo, and
More information