Related papers: Generating-function method for tensor products

We present the generating function approach to the perturbative exponentiation of correlators of a product of Wilson lines and loops. The exponentiated expression is presented in closed form as an algebraic function of correlators of known…

We present an extension of the tensor grid method for stray field computation on rectangular domains that incorporates higher-order basis functions. Both the magnetization and the resulting magnetic field are represented using higher-order…

A product formula for the parity generating function of the number of 1's in invertible matrices over Z_2 is given. The computation is based on algebraic tools such as the Bruhat decomposition. The same technique is used to obtain a parity…

The decomposition of the tensor product of a positive and a negative discrete series representation of the Lie algebra su(1,1) is a direct integral over the principal unitary series representations. In the decomposition discrete terms can…

A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

We show for bicommutative graded connected Hopf algebras that a certain distributive (Laplace) subgroup of the convolution monoid of 2-cochains parameterizes certain well behaved Hopf algebra deformations. Using the Laplace group, or its…

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either…

Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

The use of unitary invariant subspaces of a Hilbert space $\mathcal{H}$ is nowadays a recognized fact in the treatment of sampling problems. Indeed, shift-invariant subspaces of $L^2(\mathbb{R})$ and also periodic extensions of finite…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

We give a formula for the relative Deligne tensor product of two indecomposable finite semisimple module categories over a pointed braided fusion category over an algebraically closed field.

This work explores the application of the fast assembly and formation strategy from [8, 17] to trimmed bi-variate parameter spaces. Two concepts for the treatment of basis functions cut by the trimming curve are investigated: one employs a…

We study the classical limit of a tensor product of Kirillov-Reshetikhin modules over a quantum loop algebra, and show that it is realized from the classical limits of the tensor factors using the notion of fusion products. In the process…

Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…

The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…

This work introduces an explicit expression for the generation function for the reduction of an $n$-gon to an $(n-k)$-gon. A novel recursive relation of generation function is formulated based on Feynman Parametrization in projective space,…

In this paper we use generating function methods to obtain new asymptotic results about spaces of $F$-stable maximal tori in $GL_n(\overline{F_q})$, $Sp_{2n}(\overline{F_q})$, and $SO_{2n+1}(\overline{F_q})$. We recover stability results of…