Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
|
|
- Mariah Porter
- 5 years ago
- Views:
Transcription
1 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018
2 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs and DNFs Tsitin Transformation Problm Solving with SAT Rsolution 1 / 18
3 Dfinition of Propositional Logic SYNTAX (what is a formula?): Vocabulary consists of a st P of propositional variabls, usually dnotd by (subscriptd) p,q,r,... Th st of propositional formulas ovr P is dfind as: Evry propositional variabl is a formula If F is a formula, F is also a formula If F and G ar formulas, (F G) is also a formula If F and G ar formulas, (F G) is also a formula Nothing ls is a formula Formulas ar usually dnotd by (subscriptd) F,G,H,... Exampls: p p (p q) (p q) (p ( p q)) ((p q) (r q))... 2 / 18
4 Dfinition of Propositional Logic SEMANTICS (what is an intrprtation I, whn I satisfis F?): An intrprtation I ovr P is a function I : P {0,1}. val I : Formulas {0,1} is a function dfind as follows: val I (p) = I(p) val I ( F) = 1 val I (F) val I ( (F G) ) = min{val I (F),val I (G)} val I ( (F G) ) = max{val I (F),val I (G)} I satisfis F (writtn I = F) if and only if val I (F) = 1. If I = F w say that I is a modl of F or, quivalntly F is tru in I. 3 / 18
5 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) Is thr any I such that I = F? 4 / 18
6 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = Is thr any I such that I = F? 4 / 18
7 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } Is thr any I such that I = F? 4 / 18
8 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } Is thr any I such that I = F? 4 / 18
9 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } Is thr any I such that I = F? 4 / 18
10 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } = min{ I(p), max{ I(q),1 I(r)} } Is thr any I such that I = F? 4 / 18
11 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } = min{ I(p), max{ I(q),1 I(r)} } = min{ 1, max{ 0,1 1} } Is thr any I such that I = F? 4 / 18
12 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } = min{ I(p), max{ I(q),1 I(r)} } = min{ 1, max{ 0,1 1} } = 0 Is thr any I such that I = F? 4 / 18
13 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } = min{ I(p), max{ I(q),1 I(r)} } = min{ 1, max{ 0,1 1} } = 0 Is thr any I such that I = F? 4 / 18
14 Dfinition of Propositional Logic EXAMPLE: Lt F b th formula (p (q r)). Lt I b such that I(p) = I(r) = 1 and I(q) = 0. Lt us comput val I (F) (us your intuition first!) val I ((p (q r))) = min{ val I (p), val I ((q r)) } = min{ val I (p), max{ val I (q),val I ( r)} } = min{ val I (p), max{ val I (q),1 val I (r)} } = min{ I(p), max{ I(q),1 I(r)} } = min{ 1, max{ 0,1 1} } = 0 Is thr any I such that I = F? YES, I(p) = I(q) = I(r) = 1 is a possibl modl. 4 / 18
15 Dfinition of Propositional Logic EXAMPLE W hav 3 pigons and 2 hols. If ach hol can hav at most on pigon, is it possibl to plac all pigons in th hols? Vocabulary: p i,j mans i-th pigon is in j-th hol Each pigon is placd in at last on hol: (p 1,1 p 1,2 ) (p 2,1 p 2,2 ) (p 3,1 p 3,2 ) Each hol can hold at most on pigon: (p 1,1 p 2,1 ) (p 1,1 p 3,1 ) (p 2,1 p 3,1 ) (p 1,2 p 2,2 ) (p 1,2 p 3,2 ) (p 2,2 p 3,2 ) Rsulting formula has no modl 5 / 18
16 Dfinition of Propositional Logic A small syntax xtnsion: W will writ (F G) as an abbrviation for ( F G) Similarly, (F G) is an abbrviation of ((F G) (G F)) 6 / 18
17 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs and DNFs Tsitin Transformation Problm Solving with SAT Rsolution 6 / 18
18 Gnral Concpts in Logic Lt F and G b arbitrary formulas. Thn: F is satisfiabl if it has at last on modl F is unsatisfiabl (also a contradiction) if it has no modl F is a tautology if vry intrprtation is a modl of F G is a logical consqunc of F, dnotd F = G, if vry modl of F is a modl of G F and G ar logically quivalnt, dnotd F G, if F and G hav th sam modls Not that: All dfinitions ar only basd on th concpt of modl. Hnc thy ar indpndnt of th logic. 7 / 18
19 Gnral Concpts in Logic p Circuit corrsponds to formula ( p p) Formula unsatisfiabl amounts to circuit output is always 0 p Circuit corrsponds to formula ( p p) Formula is a tautology amounts to circuit output is always 1 8 / 18
20 Gnral Concpts in Logic p p q q Circuit on th lft corrsponds to formula F := (p q) Circuit on th right corrsponds to formula G := ( p q) Thy ar functionally quivalnt, i.. sam inputs produc sam output That corrsponds to saying F G Chapst / fastst / lss powr-consuming circuit is thn chosn 9 / 18
21 Gnral Concpts in Logic p r 1 q 3 4 s 2 p q in th circuit amounts to 1 (p q) 2 (r s) 3 ( 1 2 ) 4 ( 3 5 ) 5 ( 6 7 ) 6 ( p) 7 ( q) Is 1 always diffrnt from 5? = / 18
22 Rduction to SAT Assum w hav a black box SAT that givn a formula F: SAT(F) = YES iff F is satisfiabl SAT(F) = NO iff F is unsatisfiabl How to rus SAT for dtcting tautology, logical consquncs,...? F tautology iff SAT( F) = NO F = G iff SAT(F G) = NO F G iff SAT((F G) ( F G)) = NO 11 / 18
23 Rduction to SAT Assum w hav a black box SAT that givn a formula F: SAT(F) = YES iff F is satisfiabl SAT(F) = NO iff F is unsatisfiabl How to rus SAT for dtcting tautology, logical consquncs,...? F not taut. iff SAT( F) = YES F = G iff SAT(F G) = YES F G iff SAT((F G) ( F G)) = YES 11 / 18
24 Rduction to SAT Assum w hav a black box SAT that givn a formula F: SAT(F) = YES iff F is satisfiabl SAT(F) = NO iff F is unsatisfiabl How to rus SAT for dtcting tautology, logical consquncs,...? F tautology iff SAT( F) = NO F = G iff SAT(F G) = NO F G iff SAT((F G) ( F G)) = NO Hnc, a singl tool suffics: all problms can b rducd to SAT (propositional SATisfiability) Th black box SAT will b calld a SAT solvr GOAL: larn how to build a SAT solvr 11 / 18
25 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs and DNFs Tsitin Transformation Problm Solving with SAT Rsolution 11 / 18
26 CNFs and DNFs In ordr to construct our SAT solvr it will simplify our job to assum that th formula F has a givn format. A litral is a propositional variabl (p) or a ngation of on ( p) A claus is a disjunction of zro or mor litrals (l 1...l n ) Th mpty claus (zro lits.) is dnotd and is unsatisfiabl A formula is in Conjunctiv Normal Form (CNF) if it is a conjunction of zro or mor disjunctions of litrals (i.., clauss) A formula is in Disjunctiv Normal Form (DNF) if it is a disjunction of zro or mor conjunctions of litrals Exampls: p (q r) (q p r) is in CNF p (q r) (q p r) is in DNF 12 / 18
27 CNFs and DNFs Givn a formula F thr xist formulas G in CNF with F G and (G is said to b a CNF of F) H in DNF with F H (H is said to b a DNF of F) Which is th complxity of dciding whthr F is satisfiabl if F is an arbitrary formula?... if F is in CNF?... if F is in DNF? 13 / 18
28 CNFs and DNFs Givn a formula F thr xist formulas G in CNF with F G and (G is said to b a CNF of F) H in DNF with F H (H is said to b a DNF of F) Which is th complxity of dciding whthr F is satisfiabl if F is an arbitrary formula? NP-complt (Cook s Thorm)... if F is in CNF?... if F is in DNF? 13 / 18
29 CNFs and DNFs Givn a formula F thr xist formulas G in CNF with F G and (G is said to b a CNF of F) H in DNF with F H (H is said to b a DNF of F) Which is th complxity of dciding whthr F is satisfiabl if F is an arbitrary formula? NP-complt (Cook s Thorm)... if F is in CNF? NP-complt (vn if clauss hav 3 litrals!)... if F is in DNF? 13 / 18
30 CNFs and DNFs Givn a formula F thr xist formulas G in CNF with F G and (G is said to b a CNF of F) H in DNF with F H (H is said to b a DNF of F) Which is th complxity of dciding whthr F is satisfiabl if F is an arbitrary formula? NP-complt (Cook s Thorm)... if F is in CNF? NP-complt (vn if clauss hav 3 litrals!)... if F is in DNF? linar Procdur SAT(F) Input: formula F in DNF Output: YES if thr xists I such that I = F, NO othrwis 1. If th DNF is mpty thn rturn NO. Els tak a conjunction of litrals C of th DNF 2. If thr is a variabl p such that both p, p appar in C, thn C cannot b mad tru: rmov it and go to stp 1. Els dfin I to mak C tru and rturn YES. 13 / 18
31 CNFs and DNFs Ida: givn F, find a DNF of F and apply th linar-tim algorithm Why this dos not work? 14 / 18
32 CNFs and DNFs Ida: givn F, find a DNF of F and apply th linar-tim algorithm Why this dos not work? Finding a DNF of F may tak xponntial tim In fact thr ar formulas for which CNFs/DNFs hav xponntial siz 14 / 18
33 CNFs and DNFs Ida: givn F, find a DNF of F and apply th linar-tim algorithm Why this dos not work? Finding a DNF of F may tak xponntial tim In fact thr ar formulas for which CNFs/DNFs hav xponntial siz Considr xor dfind as xor(x 1 ) = x 1 and if n > 0: xor(x 1,...,x n ) = (xor(x 1,...,x n 2 ) xor(x n 2 +1,...,x n )) ( xor(x 1,...,x n 2 ) xor(x n 2 +1,...,x n )) Th siz of xor(x 1,...,x n ) is Θ(n 2 ) Cubs (conjunctions of litrals) of a DNF of xor(x 1,...,x n ) hav n litrals Any DNF of xor(x 1,...,x n ) has at last 2 n 1 cubs (on for ach of th assignmnts with an odd numbr of 1s) Any CNF of xor(x 1,...,x n ) also has an xponntial numbr of cubs 14 / 18
34 CNFs and DNFs Ida: givn F, find a DNF of F and apply th linar-tim algorithm Why this dos not work? Finding a DNF of F may tak xponntial tim In fact thr ar formulas for which CNFs/DNFs hav xponntial siz Considr xor dfind as xor(x 1 ) = x 1 and if n > 0: xor(x 1,...,x n ) = (xor(x 1,...,x n 2 ) xor(x n 2 +1,...,x n )) ( xor(x 1,...,x n 2 ) xor(x n 2 +1,...,x n )) Th siz of xor(x 1,...,x n ) is Θ(n 2 ) Cubs (conjunctions of litrals) of a DNF of xor(x 1,...,x n ) hav n litrals Any DNF of xor(x 1,...,x n ) has at last 2 n 1 cubs (on for ach of th assignmnts with an odd numbr of 1s) Any CNF of xor(x 1,...,x n ) also has an xponntial numbr of cubs Nxt w ll s a workaround 14 / 18
35 Tsitin Transformation Lt F b (p q) ( p (q r) ) ^ p q ^ p q r 15 / 18
36 Tsitin Transformation Lt F b (p q) ( p (q r) ) 1 ^ 2 3 p q ^ p q 7 r 15 / 18
37 Tsitin Transformation Lt F b (p q) ( p (q r) ) 1 1 ^ p q 3 4 p q 5 p ^ q p 6 q 7 7 r r 15 / 18
38 Tsitin Transformation Lt F b (p q) ( p (q r) ) 1 ^ p q p q 5 ^ p p q 7 6 q 7 7 r r 15 / 18
39 Tsitin Transformation Lt F b (p q) ( p (q r) ) 1 p 1 ^ q ^ p q p q p q 2 2 p 2 q p 6 q 7 7 r r 15 / 18
40 Tsitin Transformation Lt F b (p q) ( p (q r) ) p ^ q ^ p q p q 2 2 p 2 q p q p 6 q 7 r 7 r 15 / 18
41 Tsitin Transformation Variations of Tsitin transformation ar th ons usd in practic Tsitin transformation dos not produc an quivalnt CNF: for xampl, th Tsitin transformation of F = p is G = ( p) ( p), and p F G Still, CNF obtaind from F via Tsitin transformation has nic proprtis: It is quisatisfiabl to F Any modl of CNF projctd to th variabls in F givs a modl of F Any modl of F can b compltd to a modl of th CNF Can b computd in linar tim in th siz of F Hnc no modl is lost nor addd in th transformation 16 / 18
42 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs and DNFs Tsitin Transformation Problm Solving with SAT Rsolution 16 / 18
43 Problm Solving with SAT Ys + modl Problm Formula P F Solutions P = Modls F CNF SAT solvr No This is th standard flow whn solving problms with SAT Transformation from P to F is calld th ncoding into SAT Alrady sn som xampls: pigon-hol problm Othr xampls will b sn in th nxt classs CNF transformation alrady xplaind Lt us s now how to dsign fficint SAT solvrs 17 / 18
44 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs and DNFs Tsitin Transformation Problm Solving with SAT Rsolution 17 / 18
45 Rsolution Th rsolution rul is p C p D C D Rs(S) = closur of st of clauss S undr rsolution = = clauss infrrd in zro or mor stps of rsolution from S Proprtis: Rsolution is corrct: Rs(S) only contains logical consquncs Rsolution is rfutationally complt: if S is unsatisfiabl, thn Rs(S) If S is a finit st of clauss, thn Rs(S) is also finit So, givn a st of clauss S, its satisfiability can b chckd by: 1. Computing Rs(S) 2. If Rs(S) Thn UNSAT ; Els SAT 18 / 18
CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationIn the previous two chapters, we clarified what it means for a problem to be decidable or undecidable.
Chaptr 7 Computational Complxity 7.1 Th Class P In th prvious two chaptrs, w clarifid what it mans for a problm to b dcidabl or undcidabl. In principl, if a problm is dcidabl, thn thr is an algorithm (i..,
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1
More informationSCHUR S THEOREM REU SUMMER 2005
SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationGeneral Notes About 2007 AP Physics Scoring Guidelines
AP PHYSICS C: ELECTRICITY AND MAGNETISM 2007 SCORING GUIDELINES Gnral Nots About 2007 AP Physics Scoring Guidlins 1. Th solutions contain th most common mthod of solving th fr-rspons qustions and th allocation
More informationANALYSIS IN THE FREQUENCY DOMAIN
ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind
More informationUNTYPED LAMBDA CALCULUS (II)
1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationChapter 9. Computational Complexity; P and NP. In the previous two chapters, we clarified what it means for a problem to be decidable or undecidable.
Chaptr 9 Computational Complxity; P and NP 9.1 Th Class P In th prvious two chaptrs, w clarifid what it mans for a problm to b dcidabl or undcidabl. In principl, if a problm is dcidabl, thn thr is an algorithm
More informationCS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:
CS 6353 Compilr Construction, Homwork #1 1. Writ rgular xprssions for th following informally dscribd languags: a. All strings of 0 s and 1 s with th substring 01*1. Answr: (0 1)*01*1(0 1)* b. All strings
More informationStrongly Connected Components
Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationSupplementary Materials
6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More informationThus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationChapter 12. Computational Complexity; P and NP. In the previous two chapters, we clarified what it means for a problem to be decidable or undecidable.
Chaptr 12 Computational Complxity; P and NP 12.1 Th Class P In th prvious two chaptrs, w clarifid what it mans for a problm to b dcidabl or undcidabl. In principl, if a problm is dcidabl, thn thr is an
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationMATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations
MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,
More informationMCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems
MCE503: Modling and Simulation o Mchatronic Systms Discussion on Bond Graph Sign Convntions or Elctrical Systms Hanz ichtr, PhD Clvland Stat Univrsity, Dpt o Mchanical Enginring 1 Basic Assumption In a
More informationSolution of Assignment #2
olution of Assignmnt #2 Instructor: Alirza imchi Qustion #: For simplicity, assum that th distribution function of T is continuous. Th distribution function of R is: F R ( r = P( R r = P( log ( T r = P(log
More informationu 3 = u 3 (x 1, x 2, x 3 )
Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.
More informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationEconomics 201b Spring 2010 Solutions to Problem Set 3 John Zhu
Economics 20b Spring 200 Solutions to Problm St 3 John Zhu. Not in th 200 vrsion of Profssor Andrson s ctur 4 Nots, th charactrization of th firm in a Robinson Cruso conomy is that it maximizs profit ovr
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationperm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l
h 4D, 4th Rank, Antisytric nsor and th 4D Equivalnt to th Cross Product or Mor Fun with nsors!!! Richard R Shiffan Digital Graphics Assoc 8 Dunkirk Av LA, Ca 95 rrs@isidu his docunt dscribs th four dinsional
More informationAbstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1
Abstract Intrprtation 1 History On brakthrough papr Cousot & Cousot 77 (?) Inspird by Dataflow analysis Dnotational smantics Enthusiastically mbracd by th community At last th functional community... At
More informationFunction Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationNEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA
NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals
More informationFrom Elimination to Belief Propagation
School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls (10-708 Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap
More informationEquidistribution and Weyl s criterion
Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss
More informationA Propagating Wave Packet Group Velocity Dispersion
Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More informationQuasi-Classical States of the Simple Harmonic Oscillator
Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats
More informationSuperposition. Thinning
Suprposition STAT253/317 Wintr 213 Lctur 11 Yibi Huang Fbruary 1, 213 5.3 Th Poisson Procsss 5.4 Gnralizations of th Poisson Procsss Th sum of two indpndnt Poisson procsss with rspctiv rats λ 1 and λ 2,
More informationSome remarks on Kurepa s left factorial
Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More informationHydrogen Atom and One Electron Ions
Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationFinding low cost TSP and 2-matching solutions using certain half integer subtour vertices
Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,
More informationSOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.
SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,
More informationBrief Introduction to Statistical Mechanics
Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.
More informationThe van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012
Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN
Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan
More informationSlide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS
Slid DIGITAL SIGAL PROCESSIG UIT I DISCRETE TIME SIGALS AD SYSTEM Slid Rviw of discrt-tim signals & systms Signal:- A signal is dfind as any physical quantity that varis with tim, spac or any othr indpndnt
More informationA Uniform Approach to Three-Valued Semantics for µ-calculus on Abstractions of Hybrid Automata
A Uniform Approach to Thr-Valud Smantics for µ-calculus on Abstractions of Hybrid Automata (Haifa Vrification Confrnc 2008) Univrsity of Kaisrslautrn Octobr 28, 2008 Ovrviw 1. Prliminaris and 2. Gnric
More informationThe Average Sensitivity of Bounded-Depth Formulas
Th Avrag Snsitivity of Boundd-Dpth Formulas Bnjamin Rossman Univrsity of Toronto July 25, 206 Abstract W show that unboundd fan-in boolan formulas of dpth d + and siz s hav avrag snsitivity O d log sd.
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationA. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).
A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,
More informationON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park
Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction
More informationLinear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let
It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationEngineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12
Enginring Bautiful HW #1 Pag 1 of 6 5.1 Two componnts of a minicomputr hav th following joint pdf for thir usful liftims X and Y: = x(1+ x and y othrwis a. What is th probability that th liftim X of th
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationMiddle East Technical University Department of Mechanical Engineering ME 413 Introduction to Finite Element Analysis
Middl East Tchnical Univrsity Dpartmnt of Mchanical Enginring ME 43 Introduction to Finit Elmnt Analysis Chaptr 3 Computr Implmntation of D FEM Ths nots ar prpard by Dr. Cünyt Srt http://www.m.mtu.du.tr/popl/cunyt
More informationECE 344 Microwave Fundamentals
ECE 44 Microwav Fundamntals Lctur 08: Powr Dividrs and Couplrs Part Prpard By Dr. hrif Hkal 4/0/08 Microwav Dvics 4/0/08 Microwav Dvics 4/0/08 Powr Dividrs and Couplrs Powr dividrs, combinrs and dirctional
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7
More information1 Input-Output Stability
Inut-Outut Stability Inut-outut stability analysis allows us to analyz th stability of a givn syst without knowing th intrnal stat x of th syst. Bfor going forward, w hav to introduc so inut-outut athatical
More informationSeptember 23, Honors Chem Atomic structure.notebook. Atomic Structure
Atomic Structur Topics covrd Atomic structur Subatomic particls Atomic numbr Mass numbr Charg Cations Anions Isotops Avrag atomic mass Practic qustions atomic structur Sp 27 8:16 PM 1 Powr Standards/ Larning
More informationME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002
3.4 Forc Analysis of Linkas An undrstandin of forc analysis of linkas is rquird to: Dtrmin th raction forcs on pins, tc. as a consqunc of a spcifid motion (don t undrstimat th sinificanc of dynamic or
More information10. Limits involving infinity
. Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationChapter 8: Electron Configurations and Periodicity
Elctron Spin & th Pauli Exclusion Principl Chaptr 8: Elctron Configurations and Priodicity 3 quantum numbrs (n, l, ml) dfin th nrgy, siz, shap, and spatial orintation of ach atomic orbital. To xplain how
More informationFirst order differential equation Linear equation; Method of integrating factors
First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
More informationNetwork Congestion Games
Ntwork Congstion Gams Assistant Profssor Tas A&M Univrsity Collg Station, TX TX Dallas Collg Station Austin Houston Bst rout dpnds on othrs Ntwork Congstion Gams Travl tim incrass with congstion Highway
More informationy = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)
4. y = y = + 5. Find th quation of th tangnt lin for th function y = ( + ) 3 whn = 0. solution: First not that whn = 0, y = (1 + 1) 3 = 8, so th lin gos through (0, 8) and thrfor its y-intrcpt is 8. y
More informationDifferential Equations
UNIT I Diffrntial Equations.0 INTRODUCTION W li in a world of intrrlatd changing ntitis. Th locit of a falling bod changs with distanc, th position of th arth changs with tim, th ara of a circl changs
More informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More informationAlpha and beta decay equation practice
Alpha and bta dcay quation practic Introduction Alpha and bta particls may b rprsntd in quations in svral diffrnt ways. Diffrnt xam boards hav thir own prfrnc. For xampl: Alpha Bta α β alpha bta Dspit
More informationAddition of angular momentum
Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationChapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional
Chaptr 13 GMM for Linar Factor Modls in Discount Factor form GMM on th pricing rrors givs a crosssctional rgrssion h cas of xcss rturns Hors rac sting for charactristic sting for pricd factors: lambdas
More informationIntroduction to Solving Combinatorial Problems with SAT
Introduction to Solving Combinatorial Problems with SAT Javier Larrosa December 19, 2014 Overview of the session Review of Propositional Logic The Conjunctive Normal Form (CNF) Modeling and solving combinatorial
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More informationBackground: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals.
Chaptr 7 Th Hydrogn Atom Background: W hav discussd th PIB HO and th nrgy of th RR modl. In this chaptr th H-atom and atomic orbitals. * A singl particl moving undr a cntral forc adoptd from Scott Kirby
More information