Paper detail

Asymptotic Degree of Random Monomial Ideals

One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erdős-Rényi-type model for random monomial ideals defined in \cite{rmi}. We study the staircase structure associated to a monomial ideal, and show that in the random case the shape of the staircase diagram is approximately hyperbolic, and this behavior is robust across several random models. Since the discrete volume under this staircase is related to the summatory higher-order divisor function studied in number theory, we use this connection and our control over the shape of the staircase diagram to derive the asymptotic degree of a random monomial ideal. Another way to compute the degree of a monomial ideal is with a standard pair decomposition. This paper derives bounds on the number of standard pairs of a random monomial ideal indexed by any subset of the ring variables. The standard pairs indexed by maximal subsets give a count of degree, as well as being a more nuanced invariant of the random monomial ideal.