BEGIN:VCALENDAR
PRODID:-//PSU Mathematics Department//Seminar iCalendar Generator//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:PMASS Colloquium
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140116T143000
DTEND;TZID=America/New_York:20140116T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20391
SUMMARY:PMASS Colloquium - Neural networks and labeled trees
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Neural networks and labeled t
rees\nSpeaker: Manfred Denker\, Penn State\nAbstract: It has been observed
in experiments that the number of active neurons in a neural network obey
s a power law: The chances of having L of them is proportional to L^{-3/2}
. I will discuss the question how this can be derived in a mathematically
rigorous way from simple assumptions. It turns out that this question is r
elated to an old theorem of Caylay (in 1889) about the number of labeled t
rees with a fixed number of vertices.\n\nThe mathematical tools used in th
e talk are taken from combinatorics (placing balls in boxes)\, binomial c
oefficients\, and analysis (differentiation).
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140130T143000
DTEND;TZID=America/New_York:20140130T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20401
SUMMARY:PMASS Colloquium - Coverings by systems of linear equations
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Coverings by systems of linea
r equations\nSpeaker: Mihran Paikian\, Penn State\nAbstract: Let V be a fi
nite dimensional vector space over a finite field. \nLet S be a subset of
V. What is the minimal number of systems of \nlinear equations such that t
he union of their solutions exactly coincides with S? \nThe motivation for
this question comes from logic and computer science. \nI will explain all
basic concepts required for understanding this problem\, and \nthen discu
ss some algebraic and geometric approaches to its solution in special case
s.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140213T143000
DTEND;TZID=America/New_York:20140213T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20403
SUMMARY:PMASS Colloquium - Billiard table as mathematician's playground
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Billiard table as mathematici
an's playground\nSpeaker: Anatole Katok\, Penn State\nAbstract: Motion of
an ideal particle ("a billiard ball") inside a bounded plane domain with t
he usual elastic reflection law `"the angle of incidence is equal to the a
ngle of reflection'' is one of the simplest mechanical problems and attemp
ts to describe this motion lead both to remarkable open problems and to c
onnections with a variety of deep mathematical theories. For example\, it
is still not known whether inside any triangle there is a periodic billi
ard motion. It is also not known whether there is twice differentiable con
vex curve such that some billiard motion inside it is dense. In this talk
I will give a very brief and elementary introduction to the beauty and
complexity of this problem that looks so deceptively simple.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140227T143000
DTEND;TZID=America/New_York:20140227T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20405
SUMMARY:PMASS Colloquium - Probability puzzles
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Probability puzzles\nSpeaker:
Victoria Sadovskaya\, Penn State\nAbstract: We will discuss several probl
ems in elementary probability \nwhere intuition may give a wrong answer wh
ile the correct one seems\, \nat first glance\, unlikely or even impossibl
e.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140306T143000
DTEND;TZID=America/New_York:20140306T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20406
SUMMARY:PMASS Colloquium - Can you hear the shape of the drum?
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Can you hear the shape of the
drum?\nSpeaker: Vadim Kaloshin\, University of Maryland\, College Park\nA
bstract Link: http://www.personal.psu.edu/sxk37/Kaloshin.pdf
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140403T143000
DTEND;TZID=America/New_York:20140403T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20410
SUMMARY:PMASS Colloquium - Grouping and rearranging terms in infinite serie
s
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: Grouping and rearranging term
s in infinite series\nSpeaker: Joe Roberts\, Penn State\nAbstract: When st
udying infinite series of real numbers\, it is tempting to expect the fami
liar properties of addition to hold\, and in some cases they do. Series t
hat converge absolutely are as well behaved as finite series --- they are
associative and commutative. However\, series that are not absolutely con
vergent have very different properties. The Riemann Rearrangement Theorem
states that any conditionally convergent series can be reordered to sum t
o any real number or to diverge (illustrating a failure of commutativity)
\, and there are divergent series for which one can choose a subsequence o
f partial sums that converge to any arbitrary real number (a failure of as
sociativity). I will give examples of these kinds of unexpected outcomes
\, eventually building to a construction due to Sierpinski of a single pow
er series whose terms can be grouped to converge uniformly to any continuo
us function on [0\,1] vanishing at 0 --- a "universal Taylor series".
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20140417T143000
DTEND;TZID=America/New_York:20140417T152000
LOCATION:MB113
URL:http://www.math.psu.edu/seminars/meeting.php?id=20557
SUMMARY:PMASS Colloquium - TBA
DESCRIPTION:Seminar: PMASS Colloquium\nTitle: TBA\nSpeaker: Jason Rute\, Pe
nn State
END:VEVENT
END:VCALENDAR