<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="schedule.xsl"?>
<!DOCTYPE course [
<!ELEMENT course (lecture+)>
<!ELEMENT lecture (date?,nextLect*,(lecturer)*,((lectureNo,lectureTitle)|noLecture)+,description*,construction*,chapter*,homework*,solutions*)>
<!ELEMENT lecturer (lectName,url)>
<!ELEMENT construction (graphic?,description?)>
<!ELEMENT chapter (chapterName?,chapterNo,chapterTitle,url?,description?,construction?)>
<!ELEMENT homework (homeworkNo,description?,construction?,url?)>
<!ELEMENT solutions (description?,construction?,url?)>
<!ELEMENT nextLect (#PCDATA)>
<!ELEMENT date (#PCDATA)>
<!ELEMENT lectName (#PCDATA)>
<!ELEMENT url EMPTY>
<!ELEMENT lectureNo (#PCDATA)>
<!ELEMENT lectureTitle (#PCDATA)>
<!ELEMENT noLecture (#PCDATA)>
<!ELEMENT description (#PCDATA)>
<!ELEMENT chapterName (#PCDATA)>
<!ELEMENT chapterNo (#PCDATA)>
<!ELEMENT chapterTitle (#PCDATA)>
<!ELEMENT homeworkNo (#PCDATA)>
<!ELEMENT graphic EMPTY>
<!ATTLIST url href CDATA #IMPLIED>
<!ATTLIST graphic source CDATA #REQUIRED>
<!ENTITY ChaosBookOrg "http://chaosbook.org/">
<!--<!NOTATION gif SYSTEM "image/gif">-->
<!NOTATION gif PUBLIC "gif viewer">
]>
<course>

  <lecture>
    <date>August 19</date>
    <lecturer>
      <lectName>Predrag Cvitanović</lectName>
      <url href="http://chaosbook.org/~predrag" />
    </lecturer>
    <lectureNo>1.</lectureNo>
    <lectureTitle>Things fall apart</lectureTitle>
      <description>
A brief history of motion in time.
      </description>
    <chapter>
      <chapterName>intro</chapterName>
      <chapterNo>Chapter 1</chapterNo>
      <chapterTitle>Overture</chapterTitle>
      <url href="http://www.scribd.com/full/4997353?access_key=key-20hx7dsemtlvtth17qz4" />
      <description>
Read quickly all of it - do not worry if there are stretches that you do not
understand yet.
The rest is optional reading:
      </description>
    </chapter>
    <chapter>
      <chapterName>appendHist</chapterName>
      <chapterNo>Appendix A</chapterNo>
      <chapterTitle>Brief history of chaos</chapterTitle>
      <url href="http://www.scribd.com/full/4936016?access_key=key-vh8knniagfaqwiepa41" />
      <description>
ChaosBook.org version12.1, Aug 22 2008: 
iPaper version (let me know if you prefer PDF files)
      </description>
    </chapter>
    <chapter>
      <chapterName>introOverheads</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/intro.pdf" />
    </chapter>
  </lecture>

  <lecture>
    <date>August 21</date>
    <lectureNo>2.</lectureNo>
    <lectureTitle>Trajectories</lectureTitle>
      <description>
We start out by a recapitulation of the basic notions of
dynamics. Our aim is narrow; keep the exposition focused on
prerequsites to the applications to be developed in this text.
I assume that you are familiar with the dynamics on the level
of introductory texts such as Strogatz, and concentrate here on
developing intuition about what a dynamical system can do.
      </description>
    <chapter>
      <chapterName>flows</chapterName>
      <chapterNo>Chapter 2</chapterNo>
      <chapterTitle>Flows</chapterTitle>
      <url href="http://www.scribd.com/full/4997689?access_key=key-2ggrxj5ktjqjqb73r45f" />
    </chapter>
    <chapter>
      <chapterName>flowsOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/flows.pdf" />
    </chapter>
    <homework>
      <homeworkNo>
homework #1: </homeworkNo>
      <description> exercises 
(1.1),
(2.1), (2.7), and (2.8), optional (2.10)
          - due Tue 
Aug 26
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 1 exercises]</description>
      <url href="solutions/soluIntro.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 2 exercises]</description>
      <url href="solutions/soluFlows.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>August 26</date>
    <lectureNo>3.</lectureNo>
    <lectureTitle>Flow visualized as an iterated mapping</lectureTitle>
      <description>
Discrete time
dynamical systems arise naturally by either strobing the flow at fixed time intervals
(we will not do that here),
or recording the coordinates of the flow
when a special event happens (the Poincare section method, key insight for
much that is to follow).
      </description>
    <chapter>
      <chapterName>maps</chapterName>
      <chapterNo>Chapter 3</chapterNo>
      <chapterTitle>Discrete time dynamics</chapterTitle>
      <url href="http://www.scribd.com/full/4997699?access_key=key-2cfl17iy3tn7kaac9xak" />
    </chapter>
    <chapter>
      <chapterName>mapsOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/maps.pdf" />
    </chapter>
  </lecture>
  
  <lecture>
    <date>August 28</date>
    <lectureNo>4.</lectureNo>
    <lectureTitle>There goes the neighborhood</lectureTitle>
      <description>
So far
we have concentrated on description of the trajectory
of a single initial point.
Our next task is to define and determine the size of a
neighborhood, and describe the local geometry of
the neighborhood by studying the linearized flow.
What matters are the expanding directions. The repercussion
are far-reaching:
As long as the number of unstable directions is finite,
the same theory applies to finite-dimensional ODEs, 
Hamiltonian flows, and dissipative, volume contracting
infinite-dimensional PDEs.
      </description>
    <chapter>
      <chapterName>stability</chapterName>
      <chapterNo>Chapter 4</chapterNo>
      <chapterTitle>Local stability</chapterTitle>
      <url href="http://www.scribd.com/full/4997707?access_key=key-263u4hc4zxzb9i0cenc6" />
      <description>
ChaosBook.org version12.1, Aug 22 2008: skip sect. 4.5.1
      </description>
    </chapter>
    <chapter>
      <chapterName>stabilityOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/stability.pdf" />
    </chapter>
    <chapter>
      <chapterName>invariants</chapterName>
      <chapterNo>Chapter 5</chapterNo>
      <chapterTitle>Cycle stability</chapterTitle>
      <url href="http://www.scribd.com/full/4997718?access_key=key-rislxsq09vkvuzk1u30" />
      <description>
Read quickly through it, skip sect. 5.3. Skipped in the lectures, but will 
need some of the definitions in what follows.
      </description>
    </chapter>
    <chapter>
      <chapterName>conjug</chapterName>
      <chapterNo>Chapter 6</chapterNo>
      <chapterTitle>Get straight</chapterTitle>
      <url href="http://www.scribd.com/full/4997735?access_key=key-1tl1lkmrwx6cbt3za7k3" />
      <description>
Advanced material, most of it safely skipped. Read at least sect. 6.6, and,
if you have had trouble with integrating helium dynamics, sect 6.3. Skipped in the lectures.
      </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #2: </homeworkNo>
      <description> exercises 
(3.1), (3.5), (4.1), and (4.3), optional (3.6) and (4.4)
          - due Tue 
Sep 2
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 4 exercises]</description>
      <url href="solutions/soluStability.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>September 1</date>
    <noLecture>Labor Day</noLecture>
  </lecture>

  <lecture>
    <date>September 2</date>
    <lectureNo>5.</lectureNo>
    <lectureTitle>Pinball wizzard</lectureTitle>
      <description>
The dynamics
that we have the best intuitive grasp on
is the dynamics of billiards.
For billiards, discrete time is altogether natural;
a particle moving through a  billiard
suffers a sequence of instantaneous kicks,
and executes simple motion in between, so
there is no need to contrive a Poincare section.
      </description>
    <chapter>
      <chapterName>newton</chapterName>
      <chapterNo>Chapter 7</chapterNo>
      <chapterTitle>Hamiltonian dynamics</chapterTitle>
      <url href="http://www.scribd.com/full/4997750?access_key=key-yt1jrqice0cfkb2v5ms" />
      <description>
Read cursorily through sects. 7.1 and 7.2. In this course we will focus on far-from-equilibrium dissipative systems
(rather than energy-conserving systems typical of quantum-mechanical applications), so this
is not material of importance for what follows.
      </description>
    </chapter>
    <chapter>
      <chapterName>billiards</chapterName>
      <chapterNo>Chapter 8</chapterNo>
      <chapterTitle>Billiards</chapterTitle>
      <url href="http://www.scribd.com/full/4997762?access_key=key-1ih7yrrmrz1gownzlxq0" />
      <description>
Read all of it. The 3-disk pinball illustrates some of the key 
concepts for what follows; invariance under discrete symmetries, symbolic dynamics.
 Optional: download some simulations from ChaosBook.org/extras, 
or write your own simulator. 
      </description>
    </chapter>
    <chapter>
      <chapterName>billiardsOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/billiards.pdf" />
    </chapter>
  </lecture>

  <lecture>
    <date>September 4</date>
    <lecturer>
      <lectName>Evangelos Siminos</lectName>
      <url href="http://www.cns.gatech.edu/~siminos/index.html" />
    </lecturer>
    <lectureNo>6.</lectureNo>
    <lectureTitle>Group theory - a brief introduction</lectureTitle>
      <description>
Combinatorics cannot be tought. But we will make a brave attempt.
      </description>
    <chapter>
      <chapterName>discrete</chapterName>
      <chapterNo>Chapter 9</chapterNo>
      <chapterTitle>World in a mirror</chapterTitle>
      <url href="http://chaosbook.org/chapters/discrete.pdf" />
      <description>
Study section 9.1. (make sure the date in the page footers is Sep 3 2008
or later, otherwise download from here the current version of the chapter)
      </description>
    </chapter>
    <chapter>
      <chapterName>discreteOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>E. Siminos notes</chapterTitle>
      <url href="lect6.pdf" />
    </chapter>
    <homework>
      <homeworkNo>
homework #3: </homeworkNo>
      <description> exercises 
9.2, 9.3, 9.4, 9.5 (a)-(e)
          - due Tue 
Sep 9
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 9 exercises]</description>
      <url href="solutions/soluDiscrete.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>September 9</date>
    <lecturer>
      <lectName>Evangelos Siminos</lectName>
      <url href="http://www.cns.gatech.edu/~siminos/index.html" />
    </lecturer>
    <lectureNo>7.</lectureNo>
    <lectureTitle>Discrete symmetries of dynamics</lectureTitle>
      <description>
Dynamical systems
often come equipped with discrete symmetries, such as the
reflection symmetries of various potentials, and
they simplify the dynamics in a
rather beautiful way:
If dynamics is invariant under a set of
discrete symmetries,  the state space is
tiled by a set of symmetry-related tiles,
and the dynamics can be reduced to dynamics
within one such tile, the fundamental domain.
Read sections 9.2 and 9.3.
      </description>
  </lecture>

  <lecture>
    <date>September 11</date>
    <lecturer>
      <lectName>Evangelos Siminos</lectName>
      <url href="http://www.cns.gatech.edu/~siminos/index.html" />
    </lecturer>
    <lectureNo>8.</lectureNo>
    <lectureTitle>Continuous symmetries of dynamics</lectureTitle>
      <description>
If the symmetry is continuous, the interesting dynamics unfolds on a
lower-dimensional ``quotiented'' system, with
``ignorable" coordinates eliminated (but not forgotten).
The families of symmetry-related full state space cycles
are replaced by fewer and often much shorter
``relative" cycles, and
the notion of a prime periodic orbit has to be reexamined:
it is replaced by the notion of
a ``relative'' periodic orbit, the shortest segment 
that tiles the cycle under the action of the group.
Furthermore,  the group operations that relate
distinct tiles do double duty as letters of an
alphabet which
assigns symbolic itineraries to trajectories.
Read sections 9.4 and 9.5 if Vaggelis covers the continuous
symmetries, skip if the lecture stops at 
the fundamental domain discussion.
      </description>
    <chapter>
      <chapterName>discreteOverh</chapterName>
      <chapterNo>lecture</chapterNo>
      <chapterTitle>overheads</chapterTitle>
      <url href="http://chaosbook.org/overheads/chapters/discrete.pdf" />
    </chapter>
    <homework>
      <homeworkNo>
homework #4: </homeworkNo>
      <description> exercises 
(9.7), (9.8) and (9.12), optional (9.13) 
          - due Tue 
Sep 16
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 9 exercises]</description>
      <url href="solutions/soluDiscrete.pdf" />
    </solutions>
   </lecture>

  <lecture>
    <date>September 16</date>
    <lectureNo>9.</lectureNo>
    <lectureTitle>Symbolic dynamics</lectureTitle>
    <chapter>
      <chapterName>knead</chapterName>
      <chapterNo>Chapter 10</chapterNo>
      <chapterTitle>Qualitative dynamics, for pedestrians</chapterTitle>
      <url href="http://chaosbook.org/chapters/knead.pdf" />
      <description>
(version 12.3, Sep 30 2008)
Qualitative properties of
a flow partition the state space in a topologically invariant way. 
The topological dynamics is incoded
by means of transition matrices/Markov graphs.
      </description>
    </chapter>
  </lecture>

  <lecture>
    <date>September 18</date>
    <lectureNo>10.</lectureNo>
    <lectureTitle>Kneading theory</lectureTitle>
    <chapter>
      <chapterName>smale</chapterName>
      <chapterNo>Chapter 11</chapterNo>
      <chapterTitle>Qualitative dynamics, for cyclists</chapterTitle>
      <url href="http://chaosbook.org/chapters/smale.pdf" />
      <description>
Skip section 11.5. 
      </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #5: </homeworkNo>
      <description> exercises 
10.4, 10.6, 3.2; optional 10.5, 11.7
          - due Tue 
Sep 23
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 10 exercises]</description>
      <url href="solutions/soluKnead.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 11 exercises]</description>
      <url href="solutions/soluSmale.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>September 23</date>
    <lectureNo>11.</lectureNo>
    <lectureTitle>Finding cycles</lectureTitle>
    <chapter>
      <chapterName>cycles</chapterName>
      <chapterNo>Chapter 12</chapterNo>
      <chapterTitle>Fixed points, and how to get them </chapterTitle>
      <url href="http://chaosbook.org/chapters/cycles.pdf" />
	  <description>
	    (version 12.3.1, Oct 6 2008; includes a sketch of chapter `12a' on transition graphs)
	  </description>
    </chapter>
  </lecture>
 
  <lecture>
    <date>September 25</date>
    <lectureNo>12.</lectureNo>
    <lectureTitle>Finding cycles</lectureTitle>
  </lecture>

  <lecture>
    <date>September 30</date>
    <lectureNo>13.</lectureNo>
    <lectureTitle>Finding cycles</lectureTitle>
    <homework>
      <homeworkNo>
homework #6: </homeworkNo>
      <description> exercises 
10.8, 12.13, 12.7; optional 12.12
          - due Tue 
Oct 7 
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 12 exercises]</description>
      <url href="solutions/soluCycles.pdf" />
    </solutions>
	    <solutions>
      <description>[solutions from the class]</description>
      <url href="solutions/solutions6.pdf" />
    </solutions>

  </lecture>

  <lecture>
    <date>October 2</date>
    <lectureNo>14.</lectureNo>
    <lectureTitle>Counting</lectureTitle>
    <chapter>
      <chapterName>counting</chapterName>
      <chapterNo>Chapter 13</chapterNo>
      <chapterTitle>Counting</chapterTitle>
      <url href="http://chaosbook.org/chapters/count.pdf" />
	  <description>
		Read all of it.
	    (version 12.3.1, Oct 6 2008)
	  </description>
    </chapter>
  </lecture>

  <lecture>
    <date>October 7</date>
    <lectureNo>15.</lectureNo>
    <lectureTitle>Transporting densities</lectureTitle>
    <chapter>
      <chapterName>measure</chapterName>
      <chapterNo>Chapter 14</chapterNo>
      <chapterTitle>Transporting densities</chapterTitle>
      <url href="http://chaosbook.org/chapters/measure.pdf" />
	  <description>
	     Skip sect. 14.6.
	    (version 12.3.1, Oct 6 2008)
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #7: </homeworkNo>
      <description> exercises 
13.1, 14.1, 14.3, 14.10, 15.4; optional 13.6, 13.14, 14.5, 14.7
          - due Thu 
Oct 16 
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 13 exercises]</description>
      <url href="solutions/soluCount.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 14 exercises]</description>
      <url href="solutions/soluMeasure.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>October 9</date>
    <lectureNo>16.</lectureNo>
    <lectureTitle>Averaging</lectureTitle>
    <chapter>
      <chapterName>average</chapterName>
      <chapterNo>Chapter 15</chapterNo>
      <chapterTitle>Averaging</chapterTitle>
      <url href="http://chaosbook.org/chapters/average.pdf" />
	  <description>
		Read all of it.
	    (version 12.3.3, Nov 10 2008)
	  </description>
    </chapter>
  </lecture>

  <lecture>
    <date>October 11-14</date>
    <noLecture>fall break</noLecture>
  </lecture>

  <lecture>
    <date>October 16</date>
    <lectureNo>17.</lectureNo>
    <lectureTitle>Lyapunov exponents</lectureTitle>
      <description>
First we trash them as stupid, then we nevertheless define them.
      </description>
  </lecture>

  <lecture>
    <date>October 21</date>
    <lectureNo>18.</lectureNo>
    <lectureTitle>Trace formulas</lectureTitle>
    <chapter>
      <chapterName>trace</chapterName>
      <chapterNo>Chapter 16</chapterNo>
      <chapterTitle>Trace formulas</chapterTitle>
      <url href="http://chaosbook.org/chapters/trace.pdf" />
	  <description>
		Read all of it.
	    (version 12.3.3, Nov 10 2008)
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
projects #1: </homeworkNo>
      <description>
If you are going to write up the project in LaTeX 
(and not in blog/svn format),
 download the template from  ChaosBook.org/projects/
      </description>
<url href="http://chaosbook.org/projects/index.shtml" />
    </homework>
  </lecture>

  <lecture>
    <date>October 23</date>
    <lectureNo>19.</lectureNo>
    <lectureTitle>Spectral determinants</lectureTitle>
    <chapter>
      <chapterName>det</chapterName>
      <chapterNo>Chapter 17</chapterNo>
      <chapterTitle>Spectral determinants</chapterTitle>
      <url href="http://chaosbook.org/chapters/det.pdf" />
	  <description>
	     Skip sects. 17.5 and 17.6.
	    (version 12.3.3, Nov 10 2008)
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #8: </homeworkNo>
      <description> exercises 
15.1, 15.4; optional 17.10 (use version 12.3.3, Nov 10 2008)
          - due Tue 
Oct 28 
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 15 exercises]</description>
      <url href="solutions/soluAver.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 17 exercises]</description>
      <url href="solutions/soluDet.pdf" />
    </solutions>
    <homework>
      <homeworkNo>
projects #2: </homeworkNo>
      <description>
Email me a brief description of your project: title,
your name, names of advisors (professors, other students) who
might help with their advice, an abstract (of any length, as *.txt
or *.pdf file), perhaps also a paper that you will base your project on.
This will be ethernalized on the ChaosBook.org/projects homepage, where you can
see descriptions of earlier projects
          - due Tue 
Oct 28 
      </description>
<url href="http://chaosbook.org/projects/index.shtml" />
    </homework>
  </lecture>

  <lecture>
    <date>October 28</date>
    <lectureNo>20.</lectureNo>
    <lectureTitle>Cycle expansions</lectureTitle>
    <chapter>
      <chapterName>recycle</chapterName>
      <chapterNo>Chapter 18</chapterNo>
      <chapterTitle>Cycle expansions</chapterTitle>
      <url href="http://chaosbook.org/chapters/recycle.pdf" />
	  <description>
	     Skip sect. 18.6.
	    (version 12.3.3, Nov 10 2008)
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
J. Newman: Mathematica periodic orbits routines</homeworkNo>
<url href="http://chaosbook.org/projects/Newman" />
    </homework>
    <homework>
      <homeworkNo>
A. Basu: Matlab periodic orbits routines</homeworkNo>
<url href="http://chaosbook.org/projects/index.shtml#Basu" />
    </homework>
  </lecture>

  <lecture>
    <date>October 29 - November 11</date>
    <noLecture>spring registration</noLecture>
  </lecture>

  <lecture>
    <date>October 30</date>
    <lectureNo>21.</lectureNo>
    <lectureTitle>Cycle expansions</lectureTitle>
    <homework>
      <homeworkNo>
homework #8 again: </homeworkNo>
      <description> make sure that
your programs for finding periodic orbits (Henon and/or Rossler) work
          - due Thu 
Nov 6 
      </description>
    </homework>
  </lecture>

  <lecture>
    <date>November 4</date>
    <lectureNo>22.</lectureNo>
    <lectureTitle>Cycle expansions - heuristscs</lectureTitle>
    <chapter>
      <chapterName>getused</chapterName>
      <chapterNo>Chapter 20</chapterNo>
      <chapterTitle>Why cycle?</chapterTitle>
      <url href="http://chaosbook.org/chapters/getused.pdf" />
	  <description>
	     Skip sects. 20.4 and 20.5.
	    (version 12.3.3, Nov 10 2008)
	  </description>
    </chapter>
  </lecture>

  <lecture>
    <date>November 6</date>
    <lectureNo>23.</lectureNo>
    <lectureTitle>Why does it work?</lectureTitle>
    <chapter>
      <chapterName>converg</chapterName>
      <chapterNo>Chapter 21</chapterNo>
      <chapterTitle>Why does it work?</chapterTitle>
      <url href="http://chaosbook.org/chapters/converg.pdf" />
	  <description>
	    Some of the mathematical ideas that underpin trace formulas.
		Read only sect. 21.1, skim the rest.
	  </description>
    </chapter>
  </lecture>

  <lecture>
    <date>November 11</date>
    <lectureNo>24.</lectureNo>
    <lectureTitle>Why doesn't it work?</lectureTitle>
    <chapter>
      <chapterName>inter</chapterName>
      <chapterNo>Chapter 23</chapterNo>
      <chapterTitle>Intermittency</chapterTitle>
      <url href="http://chaosbook.org/chapters/inter.pdf" />
	  <description>
	    Everything that we have done so far hinges on exponential 
		separation of nearby trajectories. What happens if we get stuck 
		close to the border of interable, regular motion?
		Read sects. 23.1 to 23.2.3, skim the rest.
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #9: </homeworkNo>
      <description> exercises 
18.14, 20.2, 23.3; optional 21.3
          - due Tue 
Nov 18 
      </description>
    </homework>
    <solutions>
      <description>[solutions to chap. 18 exercises]</description>
      <url href="solutions/soluRecyc.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 20 exercises]</description>
      <url href="solutions/soluGetused.pdf" />
    </solutions>
    <solutions>
      <description>[solutions to chap. 21 exercises]</description>
      <url href="solutions/soluConverg.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>November 13</date>
    <lectureNo>25.</lectureNo>
    <lectureTitle>Deterministic diffusion</lectureTitle>
    <chapter>
      <chapterName>diffusion</chapterName>
      <chapterNo>Chapter 24</chapterNo>
      <chapterTitle>Deterministic diffusion</chapterTitle>
      <url href="http://chaosbook.org/chapters/diffusion.pdf" />
	  <description>
	  Fundation of statistical mechanics illuminated.
		Read sects. 24.1 to 24.2, skim the rest.
	  </description>
    </chapter>
    <homework>
      <homeworkNo>projects update:</homeworkNo>
      <description>
discussion session
	  </description>
      <url href="lectProj.txt" />
    </homework>
  </lecture>

  <lecture>
    <date>November 18</date>
    <lectureNo>26.</lectureNo>
    <lectureTitle>Deterministic diffusion</lectureTitle>
  </lecture>

  <lecture>
    <date>November 20</date>
    <lectureNo>27.</lectureNo>
    <lectureTitle>Deterministic diffusion</lectureTitle>
  </lecture>

  <lecture>
    <date>November 25</date>
    <lectureNo>28.</lectureNo>
    <lectureTitle>Projects discussion session</lectureTitle>
  </lecture>

  <lecture>
    <date>November 27</date>
    <noLecture>thanksgiving</noLecture>
  </lecture>

  <lecture>
    <date>December 2</date>
    <lectureNo>29.</lectureNo>
    <lectureTitle>Much noise about nothing</lectureTitle>
    <chapter>
      <chapterName>noise</chapterName>
      <chapterNo>Chapter 26</chapterNo>
      <chapterTitle>Noise</chapterTitle>
      <url href="http://chaosbook.org/chapters/noise.pdf" />
	  <description>
		We derive the continuity equation for purely deterministic, noiseless
flow, and then incorporate noise in stages: diffusion equation, Langevin equation,
Fokker-Planck equation, Hamilton-Jacobi formulation, stochastic path integrals.
	  </description>
    </chapter>
    <homework>
      <homeworkNo>
homework #10: </homeworkNo>
      <description> exercises 
26.1, 26.2 and 26.3
          - not due in this course [work them out anyway, Gaussians will serve you well later on]
      </description>
    </homework>
  </lecture>

  <lecture>
    <date>December 4</date>
    <lectureNo>30.</lectureNo>
    <lectureTitle>Turbulence</lectureTitle>
    <homework>
      <homeworkNo>projects update:</homeworkNo>
      <description>
discussion session
	  </description>
      <url href="lectProj.txt" />
    </homework>
	<solutions>
      <description>[notes]</description>
      <url href="final.html" />
    </solutions>
  </lecture>

  <lecture>
    <date>December 5</date>
    <noLecture>GT classes end
	</noLecture>
  </lecture>

  <lecture>
    <date>December 9</date>
    <noLecture>10:50 term project due, Predrag's office
	</noLecture>
  </lecture>
  
    <lecture>
    <date>to December 13</date>
    <noLecture>Course opinion survey</noLecture>
	<solutions>
      <description>CETL web link</description>
      <url href="https://gtwebapps.gatech.edu/cfprod/cios_new/student_login.cfm?message=Please+enter+your+GT+Account+and+password" />
    </solutions>
  </lecture>
    
  <lecture>
    <date>December 15</date>
    <noLecture>GT grades due at noon
	</noLecture>
  </lecture>
  
  <lecture>
    <date>December 22</date>
    <noLecture>have good holidays!
	</noLecture>
    <construction>
      <graphic source="figs/underconstr.gif" />
      <description>
The rest has yet to be worked out.
      </description>
    </construction>
	<solutions>
      <description>solutions to the final exam</description>
    <construction>
      <description>
to be posted:
      </description>
    </construction>
      <url href="solutions/final.pdf" />
    </solutions>
  </lecture>

  <lecture>
    <date>December 30 - January 9</date>
    <noLecture>spring registration</noLecture>
  </lecture>

</course>
