相关论文: Generating-function method for tensor products

This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…

This is the second of two articles devoted to an exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper focuses on fusion rules, using the machinery developed for tensor products in…

We review some contributions on fusion rules that were inspired by the work of Sharp, in particular, the generating-function method for tensor-product coefficients that he developed with Patera. We also review the Kac-Walton formula, the…

We give the generating function for the index of integer lattice points, relative to a finite order ideal. The index is an important concept in the theory of border bases, an alternative to Gr\"obner bases. Equivalently, we explicitly solve…

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Over a field of prime characteristic $p>2$, we prove that the cohomology rings of some pointed Hopf algebras of dimension $p^3$ are finitely generated. These are Hopf algebras arising in the ongoing classification of finite dimensional Hopf…

We prove a variety results on tensor product factorizations of finite dimensional Hopf algebras (more generally Hopf algebras satisfying chain conditions in suitable braided categories). The results are analogs of well-known results on…

Building on the approach of 1703.00905, we present an efficient algorithm for computing topological intersection numbers of divisors in a broad class of elliptic fibrations with the aid of a symbolic computing tool. A key part of our…

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and…

This paper focuses on the $GL_n$ tensor product algebra, which encapsulates the decomposition of tensor products of arbitrary finite dimensional irreducible representations of $GL_n$. We will describe an explicit basis for this algebra.…

This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…

Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…

We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…

This paper presents a reformulation of the Leibniz product rule as a finite sum that expresses the fractional derivative of the product of two differentiable functions. This paper then proves the cases for when the product consists of an…

It is shown that several of Brafman's generating functions for the Gegenbauer polynomials are algebraic functions of their arguments, if the Gegenbauer parameter differs from an integer by one-fourth or one-sixth. Two examples are given,…

We describe and implement a symbolic algebra for scalar and vector-valued finite elements, enabling the computer generation of elements with tensor product structure on quadrilateral, hexahedral and triangular prismatic cells. The algebra…

The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…

Fusion coefficients for affine Lie algebras are fixed by the corresponding tensor-product coefficients and a set of threshold levels. It is shown how the information concerning the threshold level is coded in the fusion basis, which is a…