Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe permanent functions of tensors
69
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
By a tensor we mean a multidimensional array (matrix) or hypermatrix over a number field. This article aims to set an account of the studies on the permanent functions of tensors. We formulate the definitions of 1-permanent, 2-permanent, and $k$-permanent of a tensor in terms of hyperplanes, planes and $k$-planes of the tensor; we discuss the polytopes of stochastic tensors; at end we present an extension of the generalized matrix function for tensors.
rate research
Read More
Considering $ntimes ntimes n$ stochastic tensors $(a_{ijk})$ (i.e., nonnegative hypermatrices in which every sum over one index $i$, $j$, or $k$, is 1), we study the polytope ($Omega_{n}$) of all these tensors, the convex set ($L_n$) of all tensors in $Omega_{n}$ with some positive diagonals, and the polytope ($Delta_n$) generated by the permutation tensors. We show that $L_n$ is almost the same as $Omega_{n}$ except for some boundary points. We also present an upper bound for the number of vertices of $Omega_{n}$.
The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Mincs conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some generalizations of Mincs conjecture to the multidimensional case. For this purpose we prove and compare several bounds on the permanent of multidimensional (0,1)-matrices. Most estimates can be used for matrices with nonnegative bounded entries.
We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{gamma+1}simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices.
In this paper, we show that an order $m$ dimension 2 tensor is primitive if and only if its majorization matrix is primitive, and then we obtain the characterization of order $m$ dimension 2 strongly primitive tensors and the bound of the strongly primitive degree. Furthermore, we study the properties of strongly primitive tensors with $ngeq 3$, and propose some problems for further research.
We study the usefulness of the permanent state as variational wave functions for bosons, which is the bosonic counterpart of the Slater determinant state for fermions. For a system of $N$ identical bosons, a permanent state is constructed by taking a set of $N$ arbitrary (not necessarily orthonormal) single-particle orbitals, forming their product and then symmetrizing it. It is found that for the one-dimensional Bose-Hubbard model with the periodic boundary condition and at unit filling, the exact ground state can be very well approximated by a permanent state, in that the permanent state has high overlap (at least 0.96 for 12 particles and 12 sites) with the exact ground state and can reproduce both the ground state energy and the single-particle correlators to high precision. For more general models, we have devised an optimization algorithm to find the optimal set of single-particle orbitals to minimize the variational energy or maximize the overlap with a given state. It turns out that quite often the ground state of a bosonic system can be well approximated by a permanent state by all the criterions of energy, overlap, and correlation functions. And even if the error is apparent, it can often be remedied by including more configurations, i.e., by allowing the variational wave function to be the superposition of multiple permanent states.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
