Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA comparison of different notions of ranks of symmetric tensors
539
0
0.0
(
0
)
Authors
Alessandra Bernardi
Ask ChatGPT about the research
No Arabic abstract
We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank and smoothable rank. We analyze the stratification induced by these ranks. The mutual relations between these stratifications, allow us to describe the hierarchy among all the ranks. We show that strict inequalities are possible between rank, border rank, extension rank and catalecticant rank. Moreover we show that scheme length, generalized rank and extension rank coincide.
rate research
Read More
Given tensors $T$ and $T$ of order $k$ and $k$ respectively, the tensor product $T otimes T$ is a tensor of order $k+k$. It was recently shown that the tensor rank can be strictly submultiplicative under this operation ([Christandl-Jensen-Zuiddam]). We study this phenomenon for symmetric tensors where additional techniques from algebraic geometry become available. The tensor product of symmetric tensors results in a partially symmetric tensor and our results amount to bounds on the partially symmetric rank. Following motivations from algebraic complexity theory and quantum information theory, we focus on the so-called W-states, namely monomials of the form $x^{d-1}y$, and on products of such. In particular, we prove that the partially symmetric rank of $x^{d_1 -1}y otimes ... otimes x^{d_k-1} y$ is at most $2^{k-1}(d_1+ ... +d_k)$.
We explore the connection between the rank of a polynomial and the singularities of its vanishing locus. We first describe the singularity of generic polynomials of fixed rank. We then focus on cubic surfaces. Cubic surfaces with isolated singularities are known to fall into 22 singularity types. We compute the rank of a cubic surface of each singularity type. This enables us to find the possible singular loci of a cubic surface of fixed rank. Finally, we study connections to the Hessian discriminant. We show that a cubic surface with singularities that are not ordinary double points lies on the Hessian discriminant, and that the Hessian discriminant is the closure of the rank six cubic surfaces.
We compare the restriction to the context of weak Hopf algebras of the notion of crossed product with a Hopf algebroid introduced in cite{BB} with the notion of crossed product with a weak Hopf algebra introduced in~cite{AG}
In this paper, we seek analytically checkable necessary and sufficient condition for copositivity of a three-dimensional symmetric tensor. We first show that for a general third order three-dimensional symmetric tensor, this means to solve a quartic equation and some quadratic equations. All of them can be solved analytically. Thus, we present an analytical way to check copositivity of a third order three dimensional symmetric tensor. Then, we consider a model of vacuum stability for $mathbb{Z}_3$ scalar dark matter. This is a special fourth order three-dimensional symmetric tensor. We show that an analytically expressed necessary and sufficient condition for this model bounded from below can be given, by using a result given by Ulrich and Watson in 1994.
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of two formalisms used for different purposes and in different research areas: graphical games and soft constraints. We relate the notion of optimality used in the area of soft constraint satisfaction problems (SCSPs) to that used in graphical games, showing that for a large class of SCSPs that includes weighted constraints every optimal solution corresponds to a Nash equilibrium that is also a Pareto efficient joint strategy.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
