Select a news year: 2025 2024 2023 2022 2021 2020 2019 2017 2016 2015 2013 2012 2009 2008
An excerpt from the 2024 Department Newsletter research article...
A tensor is a multi-way array of numbers. An order-1 tensor is just a vector u ∈ ℝn. An order-2 tensor is a matrix M ∈ ℝn1× n2 . An order-3 tensor is a 3-way array T ∈ ℝn1× n2× n3 , and so on. [...]
Tensors have a bunch of applications in statistics and data science. For instance, certain datasets might naturally be represented as a 3-wayarray encoding 3-way interactions between 3 different variables. Another key example in statistics is the method of moments: given many samples of an n-dimensional random vector, it may be useful to compute the moments. The first moment is the mean (expected value), which is an n dimensional vector; the second moment is the n × n covariance matrix; the third moment is an n × n × n tensor; and so on. We are used to performing various primitive computations on matrices: eigenvalues and eigenvectors, singular value decomposition (SVD), low-rank approximation, and so on. For tensors of order 3 and above, the analogous operations tend to be much more difficult to compute, or even ill-defined.
For the full article, check out our 2024 Department Newsletter! This article starts on page 8.
An excerpt from the 2024 Department Newsletter research article...
Informally, a mechanical linkage is a system of rigid links (rods or bars) connected by ideal joints and moving in the plane or in space. This definition suffices for engineering purposes, and one can find it in some form in many engineering books. However, from the mathematical viewpoint, this is not a satisfactory definition. Mathematically speaking, an abstract linkage is a finite connected metric graph L = (G, l), a graph G together with a length function l which assigns to every edge e ∈ E(G) of G a positive real number, its length l(e). Given such a graph and a target metric space (X, d) (for the purpose of this article, X will be Euclidean space of some dimension), one de fines the realization space R(L, X), as the space of maps from the vertex set of G to the target space X, f : V(G) -> X, subject to the condition d( f(v), f(w) ) = l ([v, w]).
Here v, w ∈ V(G)are vertices of G and [v, w] ∈ E(G) are the edges connecting these vertices. In terms of the informal definition of a mechanical linkage, each realization f ∈ R(L, X) defines a system of rods f([v, w]) connected at joints f(v).For the full article, check out our 2024 Department Newsletter! This article starts on page 5.
