On the Frobenius complexity of determinantal rings

Florian Enescu; Yongwei Yao

On the Frobenius complexity of determinantal rings

Commutative Algebra 2015-10-15 v2

Authors: Florian Enescu , Yongwei Yao

Abstract

We compute the Frobenius complexity for the determinantal ring of prime characteristic $p$ obtained by modding out the $2 \times 2$ minors of an $m \times n$ matrix of indeterminates, where $m > n \ge 2$ . We also show that, as $p \to \infty$ , the Frobenius complexity approaches $m-1$ .

Keywords

Frobenius complexity determinantal ring prime characteristic minors polynomial ring commutative algebra

Cite

@article{arxiv.1503.03164,
  title  = {On the Frobenius complexity of determinantal rings},
  author = {Florian Enescu and Yongwei Yao},
  journal= {arXiv preprint arXiv:1503.03164},
  year   = {2015}
}

Comments

18 pages, comments welcome; new material added regarding the limit of Frobenius complexity as p goes to infinity and connections to the Perron-Frobenius theorem. arXiv admin note: text overlap with arXiv:1401.0234

On the Frobenius complexity of determinantal rings

Abstract

Keywords

Cite

Comments

Related papers