BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv5.16.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Events for LORIA
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20231006T140000
DTEND;TZID=Europe/Paris:20231006T160000
DTSTAMP:20231004T230332
CREATED:20230918T110719Z
LAST-MODIFIED:20230918T110754Z
UID:23040-1696600800-1696608000@www.loria.fr
SUMMARY:PhD Defense: Djamel Eddine Amir (Mocqua)
DESCRIPTION:Djamel Eddine Amir (Mocqua) will defend his thesis\, entitled “Computability of Topological Spaces”\, on Friday\, October 6 at 2pm in room C005. \nAbstract:\nThe main objective of this thesis is to examine the concept of “computable type” and enhance our overall understanding of this notion\, as well as provide techniques for verifying or disproving this property. A compact metrizable space is said to have computable type if any semicomputable homeomorphic copy of that space is actually computable. This study builds upon the work of Miller\, who demonstrated that finite-dimensional spheres have computable type\, and Iljazović and other authors\, who extended this property to various spaces\, including compact manifolds.\nTo begin\, we establish the equivalence between two distinct definitions of computable type present in the literature\, involving metric spaces and Hausdorff spaces\, respectively. We contend that the stronger\, relativized version of computable type exhibits more favorable properties and lends itself well to topological analysis. Consequently\, we derive characterizations of ” strong computable type “ in purely topological terms as well as the descriptive complexity of topological invariants.\n\nIt naturally leads to our second objective\, is to the study of the expressive power of topological invariants of low descriptive complexity and their ability to differentiate between spaces. Specifically\, we investigate two families of low descriptive complexity topological invariants that capture the extensibility and null-homotopy of continuous functions. Using this framework\, we revisit previous findings on computable type and discover new insights. Notably\, we identify the complexity of the finite topological graph separation problem.\nLastly\, our third objective revolves around applying homology theory to study what we term the ” surjection property “ which characterizes the computable type property. For instance\, we prove that a finite simplicial complex has (strong) computable type if and only if the star at each vertex satisfies the surjection property. Furthermore\, the reduction to homology implies that the computable type property is decidable\, for finite simplicial complexes of dimension at most 4.\nJury\nPhD Advisors: \n\nMathieu HOYRUP\, INRIA\, Nancy\nEmmanuel JEANDEL\, Université de Lorraine\, Nancy\n\nReviewers: \n\nOlivier BOURNEZ\, École Polytechnique\, LIX\, Paris\nVasco BRATTKA\, University of the Bundeswehr Munich\, Germany & University of Cape Town\, South Africa\n\nExaminers: \n\nNathalie AUBRUN\, CNRS\, Paris\nLaurent BIENVENU\, CNRS\, Bordeaux\nMonique TEILLAUD\, INRIA\, Nancy\n\nInvited members: \n\nPierre GUILLON\, CNRS\, Marseille\n\n\nTweet
URL:https://www.loria.fr/event/phd-defense-djamel-eddine-amir-mocqua/
LOCATION:C005
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR