maths bites trento

Venue: PovoZero - Dipartimento di Matematica, via Sommarive, 14 - Povo (TN) - Aula seminari - Sala Seminari "-1"
At: 4.00 p.m.

Next appointment 

Thursday 12 December 2019

• Alessandro Fonda,  Università degli Studi di Trieste

On the higher dimensional Poinkaré-Birkhoff theorem for Hamiltonian flows

The calendar

Thursday 14 November 2019

• Michele Piana,  Università di Genova

The many scales of oncological data: a computational perspective

This talk will describe multi-scale approaches to the mathematical modeling of oncological data provided by different experimental modalities. A specific focus will be devoted to the many computational aspects concerned with the numerical reduction of these models. Applications will involve the use of hybrid imaging methods for the assessment of leukemic patients, the investigation of glucose metabolism in cancer tissues and the simulation of a specific transition in cancer cells by means of molecular interaction maps

Past events

Tuesday 29 October 2019

• Giuseppe Buttazzo,  Università di Pisa

Optimal reinforcing networks for elastic structures

We study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a connected one-dimensional structure. The problem consists in finding the optimal configuration for the stiffeners, the problem is then a shape optimization problem, where the admissible competing shapes are one-dimensional networks of prescribed length. We show the existence of an optimal solution that may present multiplicities, that is regions where the optimal structure overlaps. The case where the connectedness assumption is removed is also presented. Some numerical simulations are shown to confirm the overlapping phenomenon and to illustrate the complexity of the optimal structures when their total length becomes large.

Thursday 26 September 2019

• Pablo Spiga, Universita degli Studi di Milano-Bicocca

How vertex-stabilizers grow?

Here we are interested in highly symmetric graphs. (All basic terminology will be given during the talk.) There are various natural ways to “measure” the degree of symmetry of a graph and, in this talk, we look at two possibilities. First, we consider graphs Γ having a group of automorphisms acting transitively on the paths of length s ≥ 1, starting at a given vertex. The larger the value of s is, the more symmetric the graph will be. However, we show that large values of s impose severe restrictions on the structure of Γ and on the size of the stabilizer of a vertex of Γ. This will lead us to the second perspective. We take the size of the stabilizer of a vertex of Γ as a measure of the transitivity. This measure is somehow unbiased among the
graphs having the same number of vertices. Again we present some results showing, in some very specific cases, that nature is not as diverse as one might expect: graphs have either rather small vertex stabilizers or they can be classified. Finally we give some applications of these investigations: to the enumeration problem of symmetric graphs and to the problem of creating a database of small symmetric graphs.