Related papers: Robust Eigenvectors of Regular Simplex Tensors: Co…

Let v_1,...,v_{n-1} be n-1 independent vectors in R^n (or C^n). We study x, the unit normal vector of the hyperplane spanned by the v_i. Our main finding is that x resembles a random vector chosen uniformly from the unit sphere, under some…

We prove a conjecture of W.~Hackbusch in a bigger generality than in our previous article. Here we consider Tensor Train (TT) model with an arbitrary number of leaves and a corresponding "almost binary tree" for Hierarchical Tucker (HT)…

Octupolar tensors are third order, completely symmetric and traceless tensors. Whereas in 2D an octupolar tensor has the same symmetries as an equilateral triangle and can ultimately be identified with a vector in the plane, the symmetries…

Random matrix models encode a theory of random two dimensional surfaces with applications to string theory, conformal field theory, statistical physics in random geometry and quantum gravity in two dimensions. The key to their success lies…

We propose a novel matrix regularization for tensor fields. In this regularization, tensor fields are described as rectangular matrices and both area-preserving diffeomorphisms and local rotations of the orthonormal frame are realized as…

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

This paper deals with eigenvalues and eigenvectors of bicomplex linear operators defined on bicomplex space. We investigate the properties of these operators in the context of eigenvalues and eigenvectors, along with some relevant theorems.…

We use Maeda's Conjecture to prove that the Rankin-Cohen bracket of an eigenform and any modular form is only an eigenform when forced to be because of the dimensions of the underlying spaces. We further determine when the Rankin-Cohen…

The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…

Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

In this paper, we develop new theory connected with resonant vector bundles that will allow for the use of validated numerics to rigorously determine the stability of pulse solutions in the context of the Swift-Hohenberg equation. For many…

A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization and tensor complementarity…

We construct the geometric Langlands functor in one direction (from the automorphic to the spectral side) in characteristic zero settings (i.e., de Rham and Betti). We prove that various forms of the conjecture (de Rham vs Betti, restricted…

In recent years numerous methods have been developed to formally verify the robustness of deep neural networks (DNNs). Though the proposed techniques are effective in providing mathematical guarantees about the DNNs behavior, it is not…

Provably finding stationary points on bounded-rank tensors turns out to be an open problem [E. Levin, J. Kileel, and N. Boumal, Math. Program., 199 (2023), pp. 831--864] due to the inherent non-smoothness of the set of bounded-rank tensors.…

Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…

Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…