Title	How to compute superpolynomials
Creator	Hogancamp, Matthew
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-01-21T14:04
Description	The phrase superpolynomial is often taken to mean ``graded dimension of Khovanov-Rozansky link homologyâ â . In this talk I will discuss a combinatorial technique for computing Khovanov-Rozansky homology, which in the past couple years has led to the computation of superpolynomials for torus links (and also new recursions for the rational q,t-Catalan), through various works of myself, Ben Elias, and Anton Mellit. My goal will be to communicate all the main ideas, and outline how the torus link computation is carried out.
Extent	70.0
Subject	Mathematics; Group theory and generalizations; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Southern California
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2019-07-21
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0379933
URI	http://hdl.handle.net/2429/71064
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos