Esdeveniments del dia Dimecres, 8. Juny 2016

Reminder CRM Intensive Research Program on Large Cardinals

We would like to remind you about the forthcoming CRM Intensive Research Program on Large Cardinals and Strong Logics, to be held from September 5 to December 16, 2016. The National Science Foundation and the Association for Symbolic Logic offer grants to participate in the program and its scientific events.

Discrete Mathematics Days Barcelona

Computational geometry seminars: J. Pfeifle

The simplexity of a convex d-polytope P with n vertices is the minimum number of simplices necessary to triangulate P without using new vertices. In dimension 3 and above, bounds for the simplexity are scarce, even in such well-studied cases as the d-dimensional cube. One general method for obtaining bounds on the simplexity is doing linear optimization over the universal polytope U(P). However, since U(P) lives in (d+1)-dimensional space, these linear programs quickly become infeasible computationally. On the other hand, if P is symmetric, we can use techniques from the representation theory of finite groups to simplify the computations. In the Tuesday session, we'll give a crash course on the basics of representation theory, and apply these tools to the problem at hand on Friday.