Related papers: Stretching maps for tensors
We investigate the similarities and differences between the module of symmetric tensors TS^n_A(M) and the module of divided powers \Gamma^n_A(M). There is a canonical map \Gamma^n_A(M) \to TS^n_A(M) which is an isomorphism in many important…
The tensor power method generalizes the matrix power method to higher order arrays, or tensors. Like in the matrix case, the fixed points of the tensor power method are the eigenvectors of the tensor. While every real symmetric matrix has…
The concept of a crossed tensor product of algebras is studied from a few points of views. Some related constructions are considered. Crossed enveloping algebras and their representations are discussed. Applications to the noncommutative…
The problem of partitioning a large and sparse tensor is considered, where the tensor consists of a sequence of adjacency matrices. Theory is developed that is a generalization of spectral graph partitioning. A best rank-$(2,2,\lambda)$…
We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…
We consider the question: what is the abstraction that should be implemented by the computational engine of a machine learning system? Current machine learning systems typically push whole tensors through a series of compute kernels such as…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
The twistor construction for Riemannian manifolds is extended to the case of manifolds endowed with generalized metrics (in the sense of generalized geometry \`a la Hitchin). The generalized twistor space associated to such a manifold is…
Sequence comparison is a basic task to capture similarities and differences between two or more sequences of symbols, with countless applications such as in computational biology. An alignment is a way to compare sequences, where a giving…
A measurable map between measure spaces is shown to have bounded compression if and only if its image via the measure-algebra functor is Lipschitz-continuous w.r.t. the measure-algebra distances. This provides a natural interpretation of…
The underlying algebra for a noncommutative geometry is taken to be a matrix algebra, and the set of derivatives the adjoint of a subset of traceless matrices. This is sufficient to calculate the dual 1-forms, and show that the space of…
Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we…
Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…
Tensor network diagram (graphical notation) is a useful tool that graphically represents multiplications between multiple tensors using nodes and edges. Using the graphical notation, complex multiplications between tensors can be described…
We provide a concise proof of existence for nonlinear operator equations in separable Banach spaces. Notably, the operator is not assumed to be monotone. Instead, our main hypotheses consist of a continuity assumption and a generalized…
A map between operator spaces is called completely coarse if the sequence of its amplifications is equi-coarse. We prove that all completely coarse maps must be $\mathbb R$-linear. On the opposite direction of this result, we introduce a…
Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…