On the Frobenius complexity of determinantal rings (Q2403983): Difference between revisions

The authors continue their investigation of the Frobenius complexity which they started in [\textit{F. Enescu} and \textit{Y. Yao}, J. Algebra 459, 133--156 (2016; Zbl 1401.13013)]. In this paper, they examine the Frobenius complexity of the Segre product \(S_{m,n}=k[x_1, \cdots, x_m] \sharp k[y_1,\cdots, y_n]\) where the characteristic of \(k\) is \(p\) and \(m>n\geq 2\). In addition to showing that the ring of Frobenius operators of \(S_{m,n}\) is always infinitely generated over its 0th graded piece, they prove a nice logarithmic formula for the Frobenius complexity of \(S_{m,2}\) : \(cx_F(S_{m,2})=\log_p \binom{p+m-2}{m-1}\). As in their previous paper, they exhibit a nice algorithm to determine the Frobenius complexity using an order one recurrence relation involving a matrix \(U\) and column vectors \(X_e\) whose entries represent the vector space dimensions of certain graded pieces of quotients of \(S_{m,n}\) modulo a \(p\)th power of the maximal ideal. If \(U\) has all positive eigenvalues or if \(p\) is large then the Frobenius complexity is \(\log_p(\lambda)\) where \(\lambda\) is the Perron root of \(U\). Along with illustrating how their algorithm works to determine the Frobenius complexity of \(S_{5,3}\), they show that asymptotically as \(p\) gets large, the Frobenius complexity of \(S_{m,n}\) approaches \(m-1\).