Quantum convolution of linearly recursive sequences (Q1375975)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quantum convolution of linearly recursive sequences
scientific article

    Statements

    Quantum convolution of linearly recursive sequences (English)
    0 references
    0 references
    0 references
    15 November 1998
    0 references
    Let \(k\) be a field, \(A=k[x]\). Then \(A\) is a Hopf algebra with \(x\) primitive under the comultiplication \(\Delta\) by putting \(\Delta x=1\otimes x+x\otimes 1\). Every element \(f\) in the dual Hopf algebra \(A^0\) is a linearly recursive sequence. Here the product of \(A^0\) is the convolution product *. In this paper, the main result is that if \(q\) is a root of unity in \(k\), then the space \(A^0\) of linearly recursive sequences is closed under the quantum convolution product \((f_n)*_q(g_n)=(h_n)\) where \(h_n=\sum^n_{i=0}{n\choose i}_qf_ig_{n-i}\). The authors also show that when \(q\) is not a root of unity in \(k\), \(A^0\) is not closed under the quantum convolution \(*_q\). The main result is proved in the framework of a duality result concerning bialgebras in the braided monoidal category of modules over a quasitriangular Hopf algebra. For this aim, the authors show that if \(H\) is a quasitriangular Hopf algebra with a bijective antipode \(S\), \(_HM\) the braided monoidal category of left \(H\)-modules and \(A\) a bialgebra in \(_HM\), then \(A^0\) is also a bialgebra in \(_HM\). This extends to Hopf algebras in \(_HM\). The same methods are used by the authors to determine which linearly recursive sequences are invertible under the quantum product and which are zero-divisors.
    0 references
    linearly recursive sequences
    0 references
    quantum convolution products
    0 references
    bialgebras
    0 references
    braided monoidal categories
    0 references
    quasitriangular Hopf algebras
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references