Related papers: E-Characteristic Polynomials of Tensors

The exact computation of permanent for high-dimensional tensors is a hard problem. Having in mind the applications of permanents in other fields, providing an algorithm for the approximation of tensor permanents is an attractive subject. In…

We introduce the concept of shape partition of a tensor and formulate a general tensor eigenvalue problem that includes all previously studied eigenvalue problems as special cases. We formulate irreducibility and symmetry properties of a…

We construct the tensor hierarchies of generic, bosonic, 5- and 6-dimensional field theories. The construction of the tensor hierarchy starts with the introduction of two tensors: the embedding tensor which tells us which vector is used for…

Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…

Suppose E/F is a field extension. We ask whether or not there exists an element of E whose characteristic polynomial has one or more zero coefficients in specified positions. We show that the answer is frequently ``no''. We also prove…

We study bivariate orthogonal polynomials associated with Freud weight functions depending on real parameters. We analyze relations between the matrix coefficients of the three term relations for the orthonormal polynomials as well as the…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

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,…

This paper addresses two fundamental problems posed by Qi regarding the sufficiency of eigenvalues for the classification of symmetric tensors in the two-dimensional setting. For $2\times2\times2$ and $2\times2\times2\times2$ complex…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

In this paper, we discuss O-basis of symmetry classes of polynomials associated with the Brauer character of the Semi-Dihedral groups and Dihedral groups. Also, necessary and sufficient conditions are given for the existence of an…

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

We study the recurrence coefficients of the orthogonal polynomials with respect to a semi-classical extension of the Krawtchouk weight. We derive a coupled discrete system for these coefficients and show that they satisfy the fifth…

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

Demazure characters, also known as key polynomials, generalize the classical Schur polynomials. In particular, when all variables are set equal to $1$, these polynomials count the number of integer points in a certain class of…

Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) computationally…

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

This paper discusses the computation of real Z-eigenvalues and H-eigenvalues of nonsymmetric tensors. A general nonsymmetric tensor has finitely many Z-eigenvalues, while there may be infinitely many ones for special tensors. In the…

We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…