Gregorio Francesca (HEP Lausanne)
The mathematical crisis of successful students in secondary-tertiary transition abstract
Abstract:
The huge difficulties related to the transition from secondary to tertiary mathematics are documented by a large amount of official data. The analysis of these difficulties is one of the main issues in educational research focusing on the undergraduate level. The case of students who choose mathematics as a major is of particular interest. In fact, for the most part, they are students who are considered excellent in mathematics during secondary school and they seem to have the cognitive resources to succeed, but, in many cases, they encounter several difficulties during their university experience. Therefore, it appears especially interesting to also study the affective causes – that is, the causes which pertain to the emotional sphere – and consequences of these difficulties. With this aim, we developed a qualitative and narrative study focused on students’ reflections about the difficulties during their experience studying mathematics in university.
10:15 • EPF Lausanne, Salle MA A1 10
Amin Karbasi (Yale University)
Relax: A Non-Convex Road for Solving Structured Combinatorial Problem abstract
Abstract:
The difficulty of searching through a massive amount of data in order to quickly make an informed decision is one of today’s most ubiquitous challenges. Many scientific and engineering models feature inherently discrete decision variables — from phrases in a corpus to objects in an image. The study of how to make near-optimal decisions from a massive pool of possibilities is at the heart of combinatorial optimization. Many of these problems are notoriously hard, and even those that are theoretically tractable may not scale to large instances. However, the problems of practical interest are often much more well-behaved and possess extra structures that allow them to be amenable to exact or approximate optimization techniques. Just as convexity has been a celebrated and well-studied condition under which continuous optimization is tractable, submodularity is a condition for which discrete objectives may be optimized.
In order to provide the tightest approximation guarantees for submodular optimization problems, we usually need to leave the space of discrete domains and consider their continuous relaxations. To this end, we will explore the notion of submodularity in the continuous domains and introduce a broad class of non-convex objective functions. Despite the apparent lack of convexity, we will see that first-order optimization methods can provide strong approximation guarantees. We then show that such continuous relaxations can be used as an interface to provide tight approximation guarantees for maximizing stochastic submodular set functions.
I will not assume any particular background on submodularity or optimization and will try to motivate and define all the necessary concepts during the talk.
14:00 • EPF Lausanne, Salle MA B1 524
Ivan Todorov (Institute for Nuclear Research and Nuclear Energy, Sofia)
Making sense of the Standard Model of particle physics: exceptional quantum algebra abstract
Abstract:
The exceptional finite dimensional Jordan algebra J, consisting of 3x3 hermitian octonionic matrices, appears as tailor made for the internal space of the three generations of quarks and leptons. The special Jordan subalgebra of J, associated with a single generation, carries the symmetry group S(U(2)xU(3)) of the Standard Model. Its euclidean extension gives room to 32 primitive idempotents representing the states of fundamental fermions.
The talk is based on recent work with M. Dubois-Violette and S. Drenska.
15:30 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Thibaut Dumont (University of Jyväskylä, Finland)
The Burnside problem for locally compact groups abstract
Abstract:
In this talk, I will present joint work with Thibault Pillon on the Burnside problem for locally compact groups. A general version of the problem asks whether there are finitely generated infinite torsion groups, or equivalently whether for finitely generated groups being infinite is equivalent to containing an infinite cyclic subgroup Z. Similarly, the von Neumann-Day problem asks the same question replacing "infinite" by "non-amenable" and Z by the free group F_2. In this form, both questions have negative answers but Whyte, and later Seward, provided positive solution provided one relaxes the notion of subgroup containment to that of translation-like action. After Schneider extended this notion and Whyte\'s geometric solution to locally compact groups, we completed the picture and extended Seward\'s result on the Burnside problem to the locally compact case.
16:00 • Université de Neuchâtel, Institut de Mathématiques, Rue Emile - Argand 11, Salle B217