Tensors: Algebra-Computation-Applications (TACA)
International conference and Short courses on tensors in mathematics, computer science, physics, and data sciences. June 3 through June 14, 2019.
- Week 1: U. Colorado Boulder, Short Courses.
- Week 2: Colorado State U. Rocky Mountain Campus, Conference.
Important Please see departure and arrival times for bus to and from the CSU Mountain Campus
In week 2: The CSU Mountain Campus has limited parking. Participants should make travel plans to join us on the charter bus which will leave promptly as scheduled below. Failing to do so may result in complications and added costs to the participant.
REGISTRATION NOW OPEN Register here. Please note, if you are recieving support use the Promo-Code supplied in your invitation e-mail.
- Tensors in physics & quantum mechanics
- Tensors in data science
- Tensors in algebra
- Tensors in computer science
Google sheet schedule. If there are discrepancies between the schedule there and the one on this site, the schedule in the Google sheet takes precedence.
|Mon 3 June||Tue 4 June||Wed 5 June||Thu 6 June||Fri 7 June|
|9:00am-10:30am||Breakfast & collaboration time||Breakfast & collaboration time||Breakfast & collaboration time||Breakfast & collaboration time||Breakfast & collaboration time|
|10:30am-12:00pm||Tensor Spaces & Operators I, James Wilson (tutorial)||Computational Group Theory II, Alexander Hulpke (tutorial)||Tensors & Complexity II, Joshua Grochow (tutorial)||Noisy Tensors & Machine Learning II, Cris Moore (tutorial)||Tensors in Quantum II, Graeme Smith (tutorial)|
|1:00pm-1:30pm||Computational Group Theory I, Alexander Hulpke (tutoral)||On the complexity of MIN-RANK and its applications, Takunari Miyazaki|
|1:30pm-2:00pm||Algebraic Methods for Tensor Equivalence I, Peter Brooksbank (tutorial)||Noisy Tensors & Machine Learning II, Cris Moore (tutorial)||Tensors in Differential Geometry, Clayton Shonkwiler||Tensors in Multiparameter Persistent Homology, Amit Patel|
|2:00pm-2:30pm||Tensors & Complexity I, Joshua Grochow (tutorial)|
|2:30pm-3:00pm||Working groups on open problems||Working groups on open problems||Working groups on open problems||Working groups on open problems|
|3:00pm-4:00pm||Open Problem Session||Algebraic Methods for Tensor Equivalence II, Peter Brooksbank (tutorial)|
|4:00pm-5:00pm||A tensor playground: a demonstration of TensorSpace, Josh Maglione||Tensors in Quantum I, Graeme Smith (tutorial)||Tensors in Enumeration: Counting Orbits and Conjugacy Classes, Tobias Rossman||Tensor Spaces & Operators II, James Wilson (tutorial)||Closing Remarks|
- Saturday June 8, 2019 For participants of both sides of the program we will be planning some informal excursions you can participate in. All the activities below are at your own risk and responsiblity. We are offering only the timeline details.
- Hike one of Colorado’s 14ner Weather permitting we plan to hike one of Colorado’s “14ners” (a mountain peak above 14,000 feet above sea level). Of the more than 50 such peaks in the region we will choose one that is appropriate for beginners but still we recommend you participated only if you are fit for such a hike.
- Rocky Mountain National Park A historic park for all the right reasons. Arrange trips here in small groups. We can suggest good trails. If staying overnight consider lodging in Estes Park. The YMCA has many options located next to the park.
Week 1 – Lodging options in Boulder.
Week 2 – CSU’s Mountain Campus provides all lodging and food. It is a secluded campus without distractions. Registration to week 2 covers transportation to and from the campus, room, and board.
For out of town guests.
We recommend participants fly into Denver International Airport (DEN) which is served by most major airlines.
- Attending Week 1 (Boulder) Use bus shuttle service providers GreenRide/Groome (https://groometransportation.com/denver-airport/) to/from either Boulder (Week 1).
- Travel Between Boulder-Fort Collins A shuttle bus will pick up from Boulder to Fort Collins, continuing to the Mountain Campus on Sunday June 9, 2019. Pickup from Boulder will be at 10 am, June 9, delivering to downtown Fort Collins for brief lunch break. (Suitcases can be left on the bus). Then we continue from Fort Collins (including Fort Collins passengers) at 1:30 pm, June 9, picking up at the downtown Fort Collins Transit Center, and delivering everyone to the CSU Mountain Campus.
- Joining in Week 2 (Mountain Campus) There is a shuttle bus from Fort Collins departing June 9, 2019 at 1:30 PM Sharp from the Downtown Fort Collins Transit Center. (Downtown Transit Center, 250 N Mason St, Fort Collins, CO 80524) HERE
- Alternative option take train from Denver airport to downtown Denver, follow by public transport to Boulder/Fort Collins. Allow 2 hourss at least.
- Guest of Week 1 only (depart Boulder) If you are staying only for Week 1, you can return to the Denver International Airport by Greenride pickup from your hotel.
- General Guests (departing in Week 2) We will return from CSU Mountain Campus by 1 pm on Friday June 14, 2019. We will stop at Fort Collins Downtown Transit Center with access to restaurants and MAX bus system to local hotels if you are staying the night. We will then continue to the Colorado State University Transit Center. Airport shuttles to Denver airport can be scheduled for pick up from either drop-off locations, rates may vary.
- If you are joining us only for the first week, Airport shuttles from Boulder deliver to Denver airport.
For in town guests.
If you are in Fort Collins we invite we have a shuttle Van that will depart from Fort Collins to Boulder and return after each workshop. Please contact James Wilson if you would like to be incluced.
For travel from Boulder to CSU’s Mountain Campus we will have a shuttle bus for participants leaving on Sunday. Please be at the Fort Collins Downtown Transit Center at 1:20 as the bus will depart at 1:30 sharp!
Abstracts and Slides
Speaker: Peter Brooksbank, Bucknell
Abstract: The purpose of this mini-course is to introduce algebraic tools that help to elucidate the structure of tensors. The focus will be on tensors of valence 2, or bilinear maps as they are also known. The main objects of study will be rings of matrices associated to a bilinear map that are invariant under isomorphism. These include commutative rings (centroids), rings with involution (adjoints), and Lie rings (derivations).
The motivation to study such rings comes from several directions. First, the structure and representation theory of these various types of rings is, to a greater or lesser extent, well understood. Secondly, that structure may in turn be used to decompose and study the associated bilinear map. Finally, since the defining conditions of these rings are all systems of linear equations, they can be constructed very efficiently from the given bilinear map.
Among the objectives of the mini-course are the following:
- A survey of algorithms for computing with matrix algebras.
- An analysis of algebraic methods to test equivalence of tensors––successes and outstanding challenges.
- An introduction to software for computing with tensors and their associated algebras.
Title: Computational Group Theory (tutorial)
Speaker: Alexander Hulpke, CSU
Abstract: These lectures are intended to give an overview of Concepts, Ideas, Tools, and Main results in Computational Group Theory (CGT), aimed at researchers who have just a basic idea of the concept of groups (knowing what a homomorphism is will be enough) but do not necessarily aim to specialize in the area. Focussing on the case of permutation groups and matrix groups, I will describe the what and why of the problems CGT considers, the assumptions that are made on input, the fundamental data structures that are used (and how they are constructed), and some ways how these tools can be used in solving problems that are outside the scope of the basic algorithms.
Speaker: Joshua A. Grochow, CU Boulder
Abstract: The first lecture will be about what computational complexity can tell us about tensors. We will review notions of reductions between problems, how we can use these notions of reduction to learn about computational difficulty. We will then cover what is known about the complexity of a variety of problems on tensors, including a first look at some very recent results (only going up on the arXiv this week!).
The second lecture will be about what tensors can tell us about computational complexity. We will see several ways - both direct and indirect - in which problems on tensors lie at the heart of lower bounds in complexity theory.
Speaker: Josh Maglione, U. Bielefeld
Abstract: New algorithms for tensors change the way we compute with and manipulate tensors. Making room for modern theory while keeping the tried and true is the purpose of TensorSpace. We demonstrate how to build a tensor space system and apply it to known problems.
Speaker: Takunari Miyazaki, Trinity College
Abstract: The problem of finding a low-rank linear combination of matrices is a fundamental problem in linear algebra. Its decision version, called MIN-RANK, is also an important subject in computational complexity theory. In this talk, I will discuss MIN-RANK’s fundamental properties and highlight its various roles in cryptography.
Speaker: Cris Moore, Santa Fe Institute
Abstract: Someone gives you a tensor. You have a hunch that it is a noisy observation of an underlying tensor which is low rank. Depending on what kind of noise has been applied, can you recover the underlying matrix, at least approximately? Can you do this efficiently? And how much noise can you tolerate? And what does this have to do with statistical physics?
Speaker: Amit Patel, CSU
Abstract: Let K0⊆ … ⊆ Kn = K be a 1-filtration of a finite simplicial complex. As the filtration parameter increases, cycles are born and cycles die. This history of births and deaths is neatly described by a discrete invariant called its persistence diagram. The most important property of the persistence diagram is that is stable to perturbations of the filtration. Its computation involves setting up a boundary matrix followed by a reduction that maintains the filtration. The problem of multiparameter persistent homology is the study of births and death of cycles in an n-filtration of K. Until very recently, this problem was poorly understood. We now have a notion of a multiparameter persistence diagram and it is stable ! We are now focused on its computation which involves tenors.
 Alex McCleary and Amit Patel. Multiparameter Persistent Homology. arXiv:1905.13220
Speaker: Tobias Rossman, NUI Galway
Abstract: This talk is devoted to the enumeration of orbits and conjugacy classes of finite p-groups. By a process of linearisation, the study of such enumerative problems turns out to be closely related to understanding average sizes of kernels of operators associated with bilinear maps. In addition to exhibiting a rich algebraic structure, this connection also casts some light on the arithmetic and geometric questions hiding inside seemingly group-theoretic problems.
Speaker: Clayton Shonkwiler, CSU
Abstract: I will give an introduction to the fundamental role played by tensors in differential geometry, with particular emphasis on the idea of a tensor as a multilinear map. This will include brief cameos by some of the most important tensors in geometry: vector fields, differential forms, Riemannian metrics, and the Riemann and Ricci curvature tensors. Time allowing, I will also present an intriguing tensorial connnection between Plucker coordinates on Grassmann manifolds and projection matrices; this last is joint work with Harrison Chapman.
Speaker: Graeme Smith, CU Boulder
Title: Tensors Spaces & Operators
Speaker: James B. Wilson, CSU
Abstract: Concepts, examples, and notation of tensors can be quite varied, which presents a real barrier to communicating about problems and solutions regarding tensors. Like vector spaces, tensor spaces make a uniform treatment possible without overriding any existing interpretation of individual tensors. This bridges talk about tensors between varied disciplines.
- Bucknell University
- Colorado State University
- U. Colorado
- NSA Grants Program
- Peter A. Brooksbank, Bucknell, Dept. Mathematics.
- Joshua Grochow, U. Colorado, Dept. Computer Science.
- Alexander Hulpke, Colorado State U. Dept. Mathematics.
- James B. Wilson, Colorado State U. Dept. Mathematics.