Seminars by PhD students: Informal Events @ Dini (S.P.I.E.Dini)
Seminars by PhD students: Informal Events @ Dini (S.P.I.E.Dini)
Benvenuti sulla pagina di S.P.I.E.Dini. Questa è il sito del ciclo di seminari tenuti dai dottorandi di Matematica dell'UniFi che ha il proposito di condividere e confrontare il lavoro sviluppato nei diversi ambiti della matematica nel dipartimento. Lo scopo di questi seminari, di natura informale, è presentare una visione divulgativa e accessibile degli argomenti studiati dai dottorandi.
Welcome to the webpage of S.P.I.E.Dini. This is the website dedicated to the seminars held from Math PhD students of UniFi with the aim to share our work in the different areas of mathematics to the general public. The purpuse of those informal seminars is to present an easy-to-access version of the arguments studied during the PhD.
Titolo: The McKay Correspondence as an equivalence of Derived Categories
Abstract: TBA
Questions? Remarks? Contact: federico.thiella@unifi.it matteo.calosci@unifi.it
Titolo: Rationality of finite groups
Abstract: The main topic of this seminar is families of groups that have a characterization of their integral central units inside the rational group algebra. Using representation theory it is possible to consider groups as acting over vector spaces in a natural way, relating the irreducibile actions to the field generated by the trace of the representation. Those fields give us a lot of information about the group itself. In this seminar we will focus on groups with field of values that are quadratic extensions of the rationals and we will define tools that allow us to detect how far the group is from a “rational” action.
Titolo: Hadamard ranks and Tropical Geometry
Abstract: Given a complex projective variety X, the X-rank of a point p is a measure of the complexity of decomposing p as a sum of points in X with as few summands as possible. An example of this problem is writing a symmetric matrix as a sum of (as few as possible) rank 1 symmetric matrices. The variety X in this example is a Veronese variety. In general, the points of X-rank less or equal to a fixed positive integer r form the r-th secant variety of X. It is the smallest variety containing the union of all (r-1)-dimensional secant planes to X. Motivated by these important objects in classical algebraic geometry, we shift from additive to multiplicative decomposition by introducing Hadamard X-ranks. The task is to decompose a point as a coordinate-wise product of points in X (Hadamard product) with as few factors as possible. In this context, the r-th Hadamard power of X plays the role of its r-th secant variety. In the first part of the seminar, I will give an overview of these topics. Then, I will focus on generic Hadamard X-ranks. We study their finiteness using the combinatorial tools provided by Tropical Geometry. This is joint work in progress with Alessandro Oneto and Guido Montúfar.
Titolo: The Isomorphism Problem for Rational Group Algebras of Metacyclic Groups
Abstract: The Isomorphism Problem for group rings with coefficients in a ring R asks whether the isomorphism type of a group G is determined by its group ring RG. We will introduce this problem in general and we will discuss the particular case of rational group rings of metacyclic groups.
Titolo: Representation theory of the symmetric groups
Abstract: Representations of the symmetric groups are particularly interesting because there's a nice combinatorics theory that gives us several tools to work with. We will talk about these tools and we will introduce some research problems on this topic.
Titolo: Preimages of sorting algorithms
Abstract: Bubblesort, Queuesort and Stacksort are well known sorting algorithms, which have interesting properties from a combinatorial point of view. We will talk about some of those properties, focusing in particular on the problem of studying the preimages of the functions associated to the sorting algorithms.
Titolo: The optimal transport problem: the classical and the supremal setting
Abstract: In my talk, I will present the problem of Optimal Transport, the first formulation by Monge and then the relaxed version due to Kantorovich, trying to explain the main properties and results. I will then mention some fields of research, with particular attention at the formulation of OT in a "supremal" setting.
Titolo: Decomposition numbers of the symmetric group and related algebras
Abstract: Representations of the symmetric group are quite well understood, mainly thanks to James who developed the use of combinatorial tools, such as diagrams, tableaux and abacuses. This constructive approach can be generalised to give techniques for studying representations of related algebras including the Ariki-Koike algebras.
In particular, we will talk about the decomposition numbers of the symmetric group and sketch how we can generalise some results for the Ariki-Koike algebras.
Titolo: Is there an optimal shape?
Abstract: How to construct a rod of maximum rigidity? Which body moves in a fluid with the least resistance? Among sets of given area, which has the smallest perimeter? In a shape optimization problem, the objective is to deform and modify the shape of a given object to minimize (or maximize) a cost function.
From a mathematical point of view, the most intriguing feature is that the competing objects are shapes (i.e. subsets of R^N) rather than functions. We will discuss some classical problems (some of which are still open) and introduce the mathematical framework that can be used to obtain existence results.
Titolo: Multilinear spectral theory
Abstract: The spectral theory of matrices is a classical concept that has many applications in image processing, signal processing, biodiversity estimation, etc. The extended notion of eigenvectors to higher order tensors has been introduced recently in 2005, we will study this concept and understand its similarities and differences to the matrix case.
Titolo: Something about Representation Theory
Abstract: In this talk I will introduce basic concepts and ideas about representation and character theory of finite groups. My focus will be in particular on the case of symmetric groups where combinatorics plays a fundamental role. In the final part I briefly present the concept of centralizer algebra arised in order to attack important conjectures in representation theory. Again I will put the attention on symmetric groups touching the heart of my research project and showing first improvements on it.
Titolo: Interpolazione di flussi di dati 3D tramite spline quintiche PH ed applicazione alla pianificazione di traiettorie.
Titolo: Induzione matematica e catene di inferenze logiche: un'analisi cognitivo-didattica.
Titolo: The null label problem and its relation to the 2-intersection graph
Abstract: A 3-uniform hypergraph H consists of a set V of vertices, and a subset of triples of V, called set of edges E. Let a null labeling be an assignment of +1 or -1 to the triples such that each vertex has a signed degree equal to zero. If a null labeling exists, we say that the hypergraph is null. Assumed as necessary condition the degree of every vertex of H to be even, the Null Labeling Problem consists in determining whether H has a null labeling. It is remarkable that null hypergraphs arise considering two hypergraphs with the same degree sequence. In particular, the symmetric differences of these two hypergraphs give a new hypergraph that is null. From a discrete tomography point of view, null hypergraphs arise from matrices with the same projections, i.e. solutions of the same reconstruction problem. Therefore they allow modeling of switching components, a very used notion in this field of research.
Although the problem is NP-complete, the subclasses where the problem turns out to be polynomially solvable are of interest. We defined the notion of 2-intersection graph related to a 3-uniform hypergraph and we prove that if it is Hamiltonian then the related 3-hypergraph has a null labeling. Then we aimed to deepen the knowledge of the structural properties of 2-intersection graphs. Going into details, we studied when, given a graph G, it is possible to find a 3-hypergraph such that its 2-intersection graph is G. If it is possible, we say that G is reconstructable or equivalently, it has the 2-intersection property. It’s easy to see that the question is relatively straightforward for some classes. However, using some suitable gadgets, we proved that the problem in its general form is NP-Complete.
Titolo: A swim with fighting fish
Abstract: In this talk, I will propose you an excursion into the world of bijective combinatorics. This is an area of mathematics where we find a variety of discrete objects arising in other mathematical domains, and try to establish bijective links between them in order to understand better their structure and their relations. The central objects of my PhD are an exotic generalization of parallelogram polyominoes called fighting fish : I will present them to you, draw their connections with planar maps, intervals in a lattice of Dyck paths (and maybe more, if time allows), and what we can learn from that.