Related papers: A Conjecture about Conserved Symmetric Tensors

This paper expounds the relations between continuous symmetries and conserved quantities, i.e. Noether's ``first theorem'', in both the Lagrangian and Hamiltonian frameworks for classical mechanics. This illustrates one of mechanics' grand…

In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.

Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…

We establish the vanishing for non-trivial unitary representations of the bounded cohomology of SL_d up to the rank. It holds more generally for uniformly bounded representations on superreflexive spaces. The same results are obtained for…

We show that a generic tensor $T\in \mathbb{F}^{n\times n\times \dots\times n}$ of order $k$ and CP rank $d$ can be uniquely recovered from $n\log n+dn\log \log n +o(n\log \log n) $ uniformly random entries with high probability if $d$ and…

Noether's theorem connects symmetries to invariants in continuous systems, however its extension to discrete systems has remained elusive. Recognizing the lowest-order finite difference as the foundation of local continuity, a viable method…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

We present a fully extrinsic, parametrization-free variant of tensor calculus on embedded, possibly evolving, submanifolds with boundary in arbitrary dimension and codimension. The proposed approach is component-free and, for general rank…

We consider rank-one symmetric tensor estimation when the tensor is corrupted by Gaussian noise and the spike forming the tensor is a structured signal coming from a generalized linear model. The latter is a mathematically tractable model…

For every mapping of a perturbed spacetime onto a background and with any vector field $\xi$ we construct a conserved covariant vector density $I(\xi)$, which is the divergence of a covariant antisymmetric tensor density, a…

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…

This paper is concerned with low multilinear rank approximations to antisymmetric tensors, that is, multivariate arrays for which the entries change sign when permuting pairs of indices. We show which ranks can be attained by an…

Suppose that an equilibrium is asymptotically stable when external inputs vanish. Then, every bounded trajectory which corresponds to a control which approaches zero and which lies in the domain of attraction of the unforced system, must…

In this note, we consider the highly nonconvex optimization problem associated with computing the rank decomposition of symmetric tensors. We formulate the invariance properties of the loss function and show that critical points detected by…

We illustrate a rigorous approach to express the totally symmetric isotropic tensors of arbitrary rank in the $n$-dimensional Euclidean space as a linear combination of products of Kronecker deltas. By making full use of the symmetries, one…

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with…

While one can in principle augment gravity theory with torsion, it is generally thought that any such torsion affects would be too small to be of consequence. Here we show that this cannot in general be the case. We show that the limit of…

We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of $n_1\times n_2 \times 2$ tensors with a random…

We lower bound the rank of a tensor by a linear combination of the ranks of three of its unfoldings, using Sylvester's rank inequality. In a similar way, we lower bound the symmetric rank by a linear combination of the symmetric ranks of…

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…