BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Département de mathématiques et applications - ECPv6.2.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Département de mathématiques et applications
X-ORIGINAL-URL:https://www.math.ens.psl.eu
X-WR-CALDESC:évènements pour Département de mathématiques et applications
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20220222T160000
DTEND;TZID=Europe/Paris:20220222T173000
DTSTAMP:20260406T115045
CREATED:20220214T184113Z
LAST-MODIFIED:20220214T184113Z
UID:15214-1645545600-1645551000@www.math.ens.psl.eu
SUMMARY:NIPn fields part 2: random hypergraphs and NIPn CHIPS transfer
DESCRIPTION:A core question in the model theory of fields is to understand how combinatorial patterns and algebraic properties interact. The study of NIPn fields\, which can’t express the edge relation of random n-hypergraph\, is linked to henselianity. In this talk\, we use Chernikov and Hils conditions to obtain transfer in some situations\, that is\, under some algebraic assumptions\, it is enough to know that the residue field of a henselian valued field is NIPn in order to known that it is itself NIPn\, and we discuss consequences on hypothetical strictly NIPn fields.
URL:https://www.math.ens.psl.eu/evenement/nipn-fields-part-2-random-hypergraphs-and-nipn-chips-transfer/
LOCATION:salle 1016 Sophie Germain
CATEGORIES:Théorie des Modèles et Groupes
END:VEVENT
END:VCALENDAR