COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > The LMS Hardy Lecture > Combinatorics of the tree amplituhedron
Combinatorics of the tree amplituhedronAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact HoD Secretary, DPMMS. The tree amplituhedron A(n, k, m) is a geometric object generalizing the positive Grassmannian, which was introduced by Arkani-Hamed and Trnka in 2013 in order to give a geometric basis for the computation of scattering amplitudes in N=4 supersymmetric YangMills theory. I will give a gentle introduction to the amplituhedron, and then describe what it looks like in various special cases. For example, one can use the theory of sign variation and matroids to show that the amplituhedron A(n, k, 1) can be identified with the complex of bounded faces of a cyclic hyperplane arrangement. I will also present some conjectures relating the amplituhedron A(n, k, m) to combinatorial objects such as non-intersecting lattice paths and plane partitions. This is joint work with Steven Karp, and part of it is additionally joint work with Yan Zhang. The lecture will be followed by a wine reception in the Central Core, CMS . This talk is part of the The LMS Hardy Lecture series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsDesign and use of chemical tools to modulate gene expression in cancer cells based on the targeting of DNA methyltransferase ChemSoc - Cambridge Chemistry Society Arts and Creativities Research GroupOther talksJoinings of higher rank diagonalizable actions Life in the dark: can deep sea fishes see colours? Communication: Radios and Treatment Centre Simulation Double-diffusive fingering at low Prandtl number A simple proof with effective bounds for the Kobayashi conjecture on generic hyperbolicity. |