Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Frobenius complexity of Hibi rings

Published 15 Jun 2017 in math.AC | (1706.04992v2)

Abstract: We study the Frobenius complexity of Hibi rings over fields of characteristic $p > 0$. In particular, for a certain class of Hibi rings (which we call $\omega{(-1)}$-level), we compute the limit of the Frobenius complexity as $p \rightarrow \infty$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.