BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Missouri State University/Calendar of Events//EN
CALSCALE:GREGORIAN
X-WR-TIMEZONE:America/Chicago
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:75066212-bcec-4fb1-a1b0-f2b581516d24.205403@calendar.missouristate.edu
CREATED:20200127T160851Z
LAST-MODIFIED:20200127T160851Z
LOCATION:Cheek Hall 202
SUMMARY:Mathematics Colloquium: Geometric Averaging Operators and Point Co
 nfigurations
DESCRIPTION:Finding and understanding patterns in data sets is of signific
 ant importance in many applications.  One example of a simple pattern is 
 the distance between data points\, which can be thought of as a 2-point c
 onfiguration.  Two classic questions\, the Erdos distinct distance proble
 m\, which asks about the least number of distinct distances determined by
  N points in the plane\, and its continuous analog\, the Falconer distanc
 e problem\, explore that simple pattern.  When studying the continuous an
 alogues geometric averaging operators\, such as the spherical averaging o
 perator\, arise naturally.  Questions similar to the Erdos distinct dista
 nce problem and the Falconer distance problem can also be posed for more 
 complicated patterns such as triangles\, which can be viewed as 3-point c
 onfigurations.  In this talk Dr. Palsson will give a brief introduction t
 o the motivating point configuration questions and then report on some no
 vel geometric averaging operators and their mapping properties. 
X-ALT-DESC;FMTTYPE=text/html:&lt;html&gt;&lt;head&gt;&lt;title&gt;&lt;/title&gt;&lt;/head&gt;&lt;body&gt;&lt;p&gt;Fi
 nding and understanding patterns in data sets is of significant importanc
 e in many applications.&amp;nbsp\; One example of a simple pattern is the dis
 tance between data points\, which can be thought of as a 2-point configur
 ation.&amp;nbsp\; Two classic questions\, the Erdos distinct distance problem
 \, which asks about the least number of distinct distances determined by 
 N points in the plane\, and its continuous analog\, the Falconer distance
  problem\, explore that simple pattern.&amp;nbsp\; When studying the continuo
 us analogues geometric averaging operators\, such as the spherical averag
 ing operator\, arise naturally.&amp;nbsp\; Questions similar to the Erdos dis
 tinct distance problem and the Falconer distance problem can also be pose
 d for more complicated patterns such as triangles\, which can be viewed a
 s 3-point configurations.&amp;nbsp\; In this talk Dr. Palsson will give a bri
 ef introduction to the motivating point configuration questions and then 
 report on some novel geometric averaging operators and their mapping prop
 erties.&amp;nbsp\;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;
DTSTART;TZID=America/Chicago:20200128T153000
DTEND;TZID=America/Chicago:20200128T163000
SEQUENCE:0
URL:https://math.missouristate.edu/
CATEGORIES:Current Students,Faculty,Staff
END:VEVENT
END:VCALENDAR