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:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20180518T141500
DTEND;TZID=Europe/Paris:20180518T154500
DTSTAMP:20260405T112621
CREATED:20180518T121500Z
LAST-MODIFIED:20211104T110741Z
UID:8461-1526652900-1526658300@www.math.ens.psl.eu
SUMMARY:Isotrivial Mordell-Lang and finite automata
DESCRIPTION:About fifteen years ago\, Thomas Scanlon and I gave a description of sets that arise as the intersection of a subvariety with a finitely generated subgroup inside a semiabelian variety over a finite field. Inspired by later work of Derksen on the positive characteristic Skolem-Mahler-Lech theorem\, which turns out to be a special case\, Jason Bell and I have recently recast those results in terms of finite automata. I will report on this work\, as well as on the work-in-progress it has engendered on an effective version of the isotrivial Mordell-Lang theorem.
URL:https://www.math.ens.psl.eu/evenement/isotrivial-mordell-lang-and-finite-automata/
LOCATION:Jussieu salle 101 couloir 15-16 (1er étage)4 place Jussieu
CATEGORIES:Séminaire Géométrie et théorie des modèles
END:VEVENT
END:VCALENDAR