Related papers: Polynomials and the exponent of matrix multiplicat…
This paper discusses the problem of symmetric tensor decomposition on a given variety $X$: decomposing a symmetric tensor into the sum of tensor powers of vectors contained in $X$. In this paper, we first study geometric and algebraic…
Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.
We consider an algebra of even-order square tensors and introduce a stretching map which allows us to represent tensors as matrices. The stretching map could be understood as a generalized matricization. It conserves algebraic properties of…
We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…
The relationship is made between matrix integrals, Toda master-symmetries, Virasoro constraints and orthogonal polynomials.
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
In this paper, we give a generating function for Multiple Charlier polynomials and deduce several consequences for these polynomials as invertion formula, connection formula, addition formula and recurrences relations they satisfy. Next, we…
We define three types of upper (and lower) triangular blocked tensors, which are all generalizations of the triangular blocked matrices. We study some basic properties and characterizations of these three types of triangular blocked…
The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…
In this paper we study finite dimensional algebras, in particular finite semifields, through their correspondence with nonsingular threefold tensors. We introduce a alternative embedding of the tensor product space into a projective space.…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
Fast matrix multiplication is one of the most fundamental problems in algorithm research. The exponent of the optimal time complexity of matrix multiplication is usually denoted by $\omega$. This paper discusses new ideas for improving the…