BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook 9.0 MIMEDIR//EN
METHOD:PUBLISH
SCALE:GREGORIAN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20161117T154000
DTEND:20161117T163000
LOCATION:North Hall 276
UID:6D6027E9-1D4D-4D8C-8811-8EBF4FF19569@cms.calvin.edu
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:A frame is a possibly redundant collection of vectors ffigi2I that span ann-dimensional inner product space. A tight frame is a generalization of an or-thonomal basis. A frame ffigi2I is said to be scalable if there exist nonnegativescalars fcigi2I such that fcifigi2I is a tight frame. In this talk we will discussthe combinatorial structure of frames and their decomposition into tight or scal-able subsets using partially-ordered sets. We will dene the factor poset of aframe and address the inverse factor poset problem.=0D=0ARefreshments precede the talk at 3:30 p.m., in NH 282.=0D=0A
SUMMARY;ENCODING=QUOTED-PRINTABLE:Mathematics and Statistics Colloquium
PRIORITY:1
END:VEVENT
END:VCALENDAR