Dimitrios Ntalampekos (University of California, Los Angeles)
Uniformization of Sierpinski carpets by square carpets abstract
Abstract:
Uniformization of metric spaces is the problem of nding condi-tions on a metric space, under which it can be transformed to a canonicalspace, by a map that preserves the geometry. In this talk, our metric spacewill be planar Sierpinski carpets, and the canonical spaces are square Sier-pinksi carpets. We prove that every Sierpinski carpet, under certain geometricassumptions, can be mapped by a quasisymmetric map to a square carpet.This is achieved with the aid of carpet-harmonic functions, which is a discretenotion of harmonic functions on Sierpinski carpets.
10:00 • Universität Bern, Sidlerstrasse 5, 3012 Bern, Room B13
Ben Walter (METU)
Lie algebras and coalgebras via the configuration pairing abstract
Abstract:
I will outline recent advances generalizing, simplifying, and applying the configuration pairing of graphs and trees originally developed to compute the homology of configuration spaces. Earlier work applies this framework to investigate knot invariants as well as rational homotopy theory. I will present an new application directly to Lie algebras and Lie coalgebras, where this framework provides an interesting tool for making computations and an alternate view of some basic, classical Lie algebra constructions. In the theory of finite type knot invariants, we filter knots and their invariants into towers of Lie algebras; reducing the study of knots to the study of Lie algebras. This work is morally dual -- filtering Lie algebras to reduce them to towers of "simplified knots."
10:15 • EPF Lausanne, Salle CM 012
Beren Sanders (University of Copenhagen)
Quillen stratification for tensor triangulated categories with applications to the Steenrod algebra abstract
Abstract:
I will begin with some historical background on the spectrum of the cohomology ring and its significance in modular representation theory. I will then discuss Paul Balmer\'s approach to Quillen stratification, facilitated by his notion of the spectrum of a tensor triangulated category. Time permitting, I will then discuss an application of these methods to the problem of classifying the thick tensor-ideals of the stable category of the mod 2 Steenrod algebra.
11:30 • EPF Lausanne, Salle CM 012
Julian Williams (Durham University))
FuturesMEX: Secure Distributed Futures Market Exchange abstract
Abstract:
Futures exchanges, such as the Chicago Mercantile Exchange, are the embodiment of centralized financial intermediation. Complex interactions between economic and security properties and the exchange\'s essentially non-monotonic security behavior affecting the eligibility of a party\'s asset in a protocol are a challenge for security research. We present the key security properties of an Exchange, needed to guarantee its economic viability (availability of trading information, confidentiality of positions, absence of price discrimination, global integrity management), and show how to implement all key market business functionalities in a secure, fully distributed setting. Our distributed protocol simulates the centralized functionality in the general case of asynchronous communication, under the usual assumptions of anonymity of the physical transmission layer and availability of a distributed ledger. The results of our proof of concept implementation (based on zk-SNARKs and SPDZ) shows that the computations corresponding to actual trading days (according to the Thomson-Reuters Tick History Database) are within engineering reach.
12:00 • EPF Lausanne, Quartier UNIL - Dorigny, Salle Extranef 109
Dev Sinha (University of Oregon)
Combinatorics, geometry and topology of neural codes abstract
Abstract:
Given a collection of neurons, consider all of the subsets which are observed to fire at the same time. One can view this as a simplicial complex with missing facets (for example, if neurons 1 and 2 fire together and neuron 1 is never observed firing on its own). We review recent work on such codes by Curto, Giusti, Itskov and their collaborators, focusing on aspects of when such codes are consistent with a “place field” model, and the interplay between such codes and the neural network architecture which can realize them.
14:15 • EPF Lausanne, Salle CM 012