Macaulay 2 Tutorial I

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=i9cTeVp8jeo


Duration: 1:06:23
3,759 views
26

Michael Stillman, Cornell University
Symbolic and Numerical Methods for Tensors and Representation Theory
http://simons.berkeley.edu/talks/macaulay-2014-11-17a



Other Videos By Simons Institute for the Theory of Computing


2014-12-08A Faster Algorithm for Linear Programming and the Maximum Flow Problem I
2014-12-08Subsampled Power Iteration: A Unified Algorithm for Block Models and Planted CSP's
2014-12-08Cut-Approximators, Approximating Undirected Max Flows, and Recursion
2014-12-08Fast Flow Algorithms via Cut-Approximators
2014-12-03Tensors: A Geometric View
2014-11-21Kronecker Coefficients — Computation and Bounds
2014-11-21A Few Computational Tools for Tensor Rank and Tensor Decomposition
2014-11-21Computing Sheaf Cohomology for Products of Projective Spaces
2014-11-21Tensors, Secant Varieties and Interpolation
2014-11-21Geometry of Symmetric Bivariate Tensors of Fixed Typical Rank
2014-11-21Macaulay 2 Tutorial I
2014-11-21Macaulay 2 Tutorial II
2014-11-21Schemes Associated with Eigenvectors of Tensors
2014-11-21Parliaments of Polytopes and Toric Vector Bundles
2014-11-21Tensors in Algebraic Statistics
2014-11-14Smoothed Analysis of Tensor Decompositions
2014-11-14Generalized Singular Values
2014-11-14Rank, Border Rank, Smoothable Rank and Cactus Rank
2014-11-14The Average Number of Critical Rank-One Approximations to a Tensor
2014-11-14NP-hardness of Nuclear Norms for Tensors
2014-11-14Geometry and Upper Bounds for the Complexity of Matrix Multiplication


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Michael Stillman