Permanental polynomial identities on matrix rings (Q1327044): Difference between revisions

Let \(\Gamma\) be a directed graph, \(V\) the set of vertices, \(e_ 1,\dots,e_ N\) the set of edges of \(\Gamma\). Let \(\Phi_ +(v)\) (resp. \(\Phi_ -(v)\)) be the number of the edges starting (resp. ending) in \(v\). \(\Gamma\) is called Eulerian if \(\Phi_ +(v) = \Phi_ -(v)\) for all \(v\in V\). Fix \(v\in V\) and denote by \(\Pi\) the set of the Eulerian circuits starting in \(v\). Then \(\Pi\) can be described by a set of elements \(S(\Pi)\) in \(\text{Sym}(N)\). Let \(RX_ N\) denote the free algebra with generators \(x_ 1,\dots,x_ N\) over a ring \(R\) of characteristic \(p > 0\) (i.e. \(p R = 0\)). Set \[ P_ \Gamma = \sum_{s \in S(\Pi)} x_{s(1)} \dots x_{s(N)}. \] The following is a simplified version of the main result of the paper under review: Theorem. Let \(\Gamma\) be an Eulerian graph, \(p\) a prime, \(n > 1\) an integer such that \(\Phi_ +(v) > np\) and \(\Phi_ -(q) > np\) for some \(v\in V\), \(q\in V \setminus\{v\}\). Then \(P_ \Gamma\) is a polynomial identity of the matrix ring \(M_ n(R)\).