Related papers: Kronecker product identities from D-finite symmetr…
We construct a new operation among representations of the symmetric group that interpolates between the classical internal and external products, which are defined in terms of tensor product and induction of representations. Following…
Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
A convenient technique for calculating completed topological tensor products of functional Frechet and DF spaces is developed. The general construction is applied to proving kernel theorems for a wide class of spaces of smooth and entire…
In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy…
We present some results on the monotonicity of some traces involving functions of self-adjoint operators with respect to the natural ordering of their associated quadratic forms. We also apply these results to complete a proof of the Wegner…
Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
We study right exact tensor products on the category of finitely presented functors. As our main technical tool, we use a multilinear version of the universal property of so-called Freyd categories. Furthermore, we compare our constructions…
We derive a Kronecker product approximation for the micromagnetic long range interactions in a collocation framework by means of separable sinc quadrature. Evaluation of this operator for structured tensors (Canonical format, Tucker format,…
Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…
We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…
We characterize the generating series of extended period polynomials of normalized Hecke eigenforms for $\operatorname{PSL}_2(\mathbb Z)$ studied by Zagier in terms of the period relations and existence of a suitable factorization. For this…
We calculate the trivial factors of the L-functions for both finite and p-adic infinite symmetric products of the Kloosterman sheaf.
We show that solutions of the Schr\"odinger equation with a symmetric P\"oschl-Teller potential of a particular form can be expressed in terms of a closed combination (not series) of trigonometric functions. Using some properties of the…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…