La scuola 12TH SEMANTIC WEB SUMMER SCHOOL – SSSW 2016 si terrà a Bertinoro (Bologna) dal 17 al 23 luglio 2016. Maggiori informazioni in questa pagina web.
Mar 182016
Ott 032015
Prof. Sebastian Heller (University of Tubingen)
November 17-18, 16-18 hr., Palazzo delle Scienze
Contact Stefano Montaldo for more information.
Abstract:
In these lectures I will talk about constant mean curvature (CMC) surfaces of higher genus in space forms from the integrable systems point of view. CMC surfaces are characterized by the harmonicity of their Gauss map and hence deliver an associated family of CMC surfaces (with periods). After recalling the general gauge theoretic description of CMC surfaces and their associated families, I will explain the recent spectral curve approach to CMC surfaces of higher genus. I will introduce a flow on the spectral data which turns out to be a powerful tool for a detailed study of the moduli space of CMC surfaces. Finally, I will report about numerical experiments and about the visualization of CMC surfaces. These lectures are partially based on joint work with Lynn Heller and Nicholas Schmitt.
Apr 252015
Plan of the course
- Lezione 1 (martedì 5 maggio 17-19) Strutture complesse e forme simplettiche.
- Lezione 2 (mercoledì 6 maggio 17-19) Metriche a curvature costante su varietà reali e superfici di Riemann.
- Lezione 3 (giovedì 7 maggio 17-19) Varieta’ Kahleriane: coomologia, fibrati lineari, classi di Chern e curvatura.
- Lezione 4 (venerdì 8 maggio 17-19) Varieta’ Kahleriane di Einstein. ddbar-Lemma e Congeture di Calabi. Teorema di Yau (con cenni di dimostrazione).
Apr 022015
The course will be held on May 5, 7, 19, 21. Contact Matteo Sommacal or Francesco Demontis for more information.
Apr 022015
The course will be held on May 4, 6, 8, 11, 13, 15. Contact Antonio Iannizzotto for more information.
Feb 232015
The schedule of the course has been further modified:
- February 10, 11, 12, 13, hr. 10.00-12.00
- March 11, 12, 13, 23, 24, 25 hr. 17.00-19.00
The lectures will take place at the Palazzo delle Scienze. in room B.
Feb 222015
The course will start on March 17. Information about the program and the scheduling of the course can be found in the program.
Lug 232014
The announcement for the selection procedure for admission to the XXX cycle of the PhD courses has been published here:
Deadline for the on-line registration: september 12, 2014, h 12.00.
Deadline for the submission of the documentation: september 15, 2014, h 12.00.
Deadline for the upload of documentation (non-italian candidates): september 12, 2014, h 12.00.
Presentation of the PhD school on Mathematics and Computer Science
Giu 102014
Upcoming Seminar Flow Unfolding of Multi-clock Nets June 18, 14.30 (Lab 5) Palazzo delle Scienze - Cagliari Giovanni Casu Dipartimento di Matematica e Informatica - University of Cagliari Abstract. Unfoldings of nets are often related to event structures: each execution of a net can be viewed as a configuration in the associated event structure. This allows for a clear characterization of dependencies and the conflicts betweenoccurrences of transitions in the net. This relation is somehow lost if more compact representations of the executions of nets are considered, e.g. in trellises or merged processes of multi-clock nets. This talk aims to expose the work "Flow Unfolding of Multi-clock Nets" which will be presented in the Petri Nets 2014 conference. In this talk we introduce an unfolding, called flow unfolding, that turns out to be related to flow event structures, hence dependencies and conflict are still represented. Furthermore, this unfolding gives also a more compact representation of the executions of a multi-clock net, similarly to what approaches like trellises or merged processes do. |
Mag 162014
Upcoming Seminar Coinduction Up-To for Non Deterministic Automata May 21, 11.00 (Aula F) Palazzo delle Scienze - Cagliari Filippo Bonchi Ecole Normale Supérieure de Lyon - France Abstract. In this talk, I will introduce the Coinduction proof principle and its enhancements by mean of up-to techniques. I will introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Such technique can be effectively implemented in an algorithm that exponentially improves the state of the art. |