BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260324T121500
DTEND;TZID=America/Los_Angeles:20260324T131000
DTSTAMP:20260505T144830
CREATED:20260209T235439Z
LAST-MODIFIED:20260226T211019Z
UID:3991-1774354500-1774357800@colleges.claremont.edu
SUMMARY:Computing certificates for complete positivity (Achill Schürmann\, University of Rostock)
DESCRIPTION:A key problem in computer proofs based on solutions from copositive optimization\, is checking whether or not a given quadratic form is completely positive or not. In this talk we describe the first known algorithm for arbitrary rational input. It is based on a suitable adaption of Voronoi’s Algorithm and the underlying theory from positive definite to copositive quadratic forms. We observe several similarities with the classical theory\, but also some differences\, in particular for three and more variables. A key element and currently the main bottleneck in our algorithm is an adapted shortest vector computation\, asking for all nonnegative integer vectors attaining the copositive minimum of a given copositive quadratic form. \n(based on joint work with Valentin Dannenberg\, Alexander Oertel\, Mathieu Dutour Sikiric and Frank Vallentin)
URL:https://colleges.claremont.edu/ccms/event/antc-talk-achill-schurmann-university-of-rostock/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR