The Graduate Seminar ("Seminario Dottorato" in Italian) started in 2006. It runs about twice per month, usually on Wednesday afternoon, except in Summer. Seminars are usually given by PhD students and PostDocs of the Department of Mathematics, but occasionally also by Senior Researchers. It is assumed that each Student of the Doctoral School will give a talk in the Seminar during his/her doctoral studies.
The Graduate Seminar is a double-aimed activity. On the one hand, speakers have the opportunity to think how to communicate their researches to a public of mathematically well-educated but not specialist people, by preserving both understandability and the flavour of a research report. On the other hand, people in the audience enjoy a rare opportunity to get an accessible-but-precise idea of what's going on in areas of mathematics that they might not know very well.
All speakers are required to prepare a short report on the the topic of their talk, which are collected in a booklet at the end of the year.
List of 2018-2019 Seminars
(Click on title for abstract)
- [21 November 2018] Yan HU (Padova, Dip. Mat.) “Congruent numbers, Heegner method and BSD conjecture"
- [3 October 2018] Nicola Gastaldon (Padova, Dip. Mat., and Trans-Cel, Albignasego) "Exact and Meta-Heuristic Approach for Vehicle Routing Problems"
[5 December 2018] Paolo Luzzini (Padova, Dip. Mat.) “Regular domain perturbation problems"
Abstracts of 2018-2019 Seminars
Yan Hu, Congruent numbers, Heegner method and BSD conjecture
Abstract. The “Congruent number problem” is an old unsolved major problem in number theory. In this seminar we provide a brief introduction to it. We will start from the original version of the problem, and lots of objects will be introduced during the talk. If time permits, some current progresses relateted to the BSD conjecture will also be described.
Nicola Gastaldon, Exact and Meta-Heuristic Approach for Vehicle Routing Problems
Abstract. The Vehicle Routing Problem (VRP) includes a wide class of problems studied in Operations Research and relevant from both theoretical and practical perspectives. In its basic formulation, the problem is to find a set of routes for a given fleet of vehicles through a set of locations, so that each location is visited by exactly one vehicle and the total travel cost is minimized. Such problem is often enriched with many attributes rising from real-world applications, such as capacity constraints, pickup and delivery operations, time windows, etc. VRP belongs to the class of combinatorial optimization problems, and it is very hard to solve efficiently and researchers have developed many exact and (meta-)heuristic algorithms. The former takes advantage of the structure of the mathematical model to obtain a speedup through decomposition methods. The latter exploits heuristic techniques to obtain solutions that trade off quality and computational burden, such as evolutionary algorithms and neighborhood search routines. In our research, we consider the VRP arising at Trans-Cel, a freight transportation company based in Padova. We devised a Tabu Search heuristic implementing different neighborhood search policies, and now embedded in the tool supporting the operation manager at Trans-Cel. The algorithm runs in an acceptable amount of time both in static and dynamic settings, and the quality of the solutions is assessed through comparison with results obtained by a Column Generation algorithm that solves a mathematical programming formulation of the problem. Current research aims at developing data-driven techniques that exploit the information available from the company's repositories to support stochastic transportation demand arising in real time.
Paolo Luzzini, Regular domain perturbation problems
Abstract. The study of the dependence of functionals related to partial differential equations and of quantities of physical relevance upon smooth domain perturbations is a classical topic and has been carried out by several authors. In this talk we will give an introductory overview about regular domain perturbation problems. We will provide concrete examples, highlight the motivations and the possible applications, and present an outline of some new results obtained in collaboration with P. Musolino and R. Pukhtaievych.