Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Extension of Laguerre polynomials with negative arguments

We consider the irreducibility of polynomial $L_n^{\left(\alpha \right)}\left(x\right)$ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{\left(\alpha \right)}\left(x\right)$ vanishes if and only if $n\ge \left|\alpha \right|=?\alpha$. Therefore we assume that $\alpha =?n?s?1$ where $s$ is a non-negative integer. Let $g\left(x\right)={(?1)}^n{L}_n^{(?n?s?1)}\left(x\right)=\sum _{j=0}^n{a}_j\frac{x^j}{j!}$ and more general polynomial, let $G\left(x\right)=\sum _{j=0}^n{a}_j{b}_j\frac{x^j}{j!}$ where $b_j$ with $0\le j\le n$ are integers such that $\left|b_0\right|=\left|b_n\right|=1$. Schur was the first to prove the irreducibility of $g\left(x\right)$ for $s=0$. It has been proved that $g\left(x\right)$ is irreducible for $0\le s\le 60$. In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either $G\left(x\right)$ is irreducible or $G\left(x\right)$ is linear factor times irreducible polynomial. This is a consequence of the estimate $s>1.9k$ whenever $G\left(x\right)$ has a factor of degree $k\ge 2$ and $(n,k,s)\ne (10,5,4)$. This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey.     

FINITE GROUPS WHOSE AUTOMORPHISM GROUP HAS ORDER CUBEFREE

ＦＩＮＩＴＥＧＲＯＵＰＳＷＨＯＳＥＡＵＴＯＭＯＲＰＨＩＳＭＧＲＯＵＰＨＡＳＯＲＤＥＲＣＵＢＥＦＲＥＥＬＩＳＨＩＲＯＮＧＡｂｓｔｒａｃｔＬｅｔＧｄｅｎｏｔｅａｆｉｎｉｔｅｇｒｏｕｐ．Ｉｔｉｓｓｈｏｗｎｔｈａｔｉｆ｜Ａｕｔ（Ｇ）｜ｉｓｃｕｂｅｆｒｅ...