In this paper, the authors study the asymptotic degree of Erdős-Rényi-type random monomial ideals. Let \(D\) be a positive integer and \(p\in (0,1)\). A monomial ideal \(\mathfrak I\) in the polynomial ring \(R=\mathbb K[x_1,\ldots,x_n]\) is called a random monomial ideal if it is obtained by randomly selecting its generators independently, with probability \(p\) each, from the set of all monomials in R of positive degree no more than D. The resulting distribution on generating sets induces a probability distribution \(\mathfrak I(n,D,p)\) on the set of all monomial ideals in the ring \(R\). In the paper the asymptotic behavior of \(\mathfrak I\sim \mathfrak I(n,D,p)\) refers to the case where \(n\) is fixed, \(D \rightarrow \infty\), and \(p = p(D)\) is a function of \(D\). Let \[ Z(n,D)=\#\left\{\alpha\in\mathbb Z_{\ge 0}^n: \prod_{i=1}^n(\alpha_i+1)\le d\right\}. \] The authors prove the following result in Theorem 1.1 of the paper. In order to prove this they relate the value of \(Z(n,d)\) with the summatory higher-order divisor function in classical multiplicative number theory. Theorem: Let \(\mathfrak I\sim \mathfrak I(n,D,p)\), and suppose \(p=D^{-k}\) for \(k\in (0, n)\), with \(k\) not an integer. Let \(s = \lfloor k\rfloor\). Then there exist constants \(C_1\), \(C_2 > 0\) such that asymptotically almost surely as \(D\rightarrow\infty\), \begin{itemize} \item[1.] \(Z(n-s, D^{k-s-\epsilon})<\deg(\mathfrak I)<Z(n-s, D^{k-s+\epsilon})\), and \item[2.] \(C_1D^{k-s-\epsilon}(\log D)^{n-1}<\deg(\mathfrak I)<C_2D^{k-s+\epsilon}(\log D)^{n-1}\) \end{itemize} Let \(I\) be a monomial ideal. An admissible pair of \(I\) is a pair \((x^{\alpha}, S)\), for \(x^{\alpha}\) a monomial of \(\mathbb K[x_1,\ldots , x_n]\) and \(S \subseteq \{x_1,\ldots , x_n\}\), such that \(\mathrm{supp}(x^{\alpha})\cap S = \emptyset\) and every monomial in \(x^{\alpha}\cdot\mathbb K[S]\) is a standard monomial of \(I\) . An admissible pair is called a standard pair if it is minimal with respect to the partial order given by \((x^{\alpha}, S)\le (x^{\beta}, T)\) if \(x^{\alpha}\) divides \(x^{\beta}\) and \(\mathrm{supp}(x^{\beta-\alpha})\cup T\subseteq S\). Among other results, in Theorem 1.3 of the paper the authors probabilistically bound the number of standard pairs \((x^{\alpha}, S)\) of a random monomial ideal for each \(S \subseteq \{x_1,\ldots , x_n\}\): Theorem: Fix \(S\) a proper subset of the variables \(\{x_1,\ldots, x_n\}\), let \(s = \#S\), and let \(\mathfrak I\sim \mathfrak I(n,D,p)\), where \(p = D^{-k} , k \in (s, n)\). Then there exists a constant \(C > 0\) such that asymptotically almost surely as \(D\rightarrow\infty\), \[ CZ(n-s, D^{k-s-\epsilon})< \#\{\text{standard pairs \((x^{\alpha}, S)\) of \(\mathfrak I\)}\}<Z(n-s, D^{k-s-1+\epsilon}). \]
- A quick proof of nonvanishing for asymptotic syzygies
- Asymptotic syzygies of algebraic varieties
- Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
- Asymptotics of random Betti tables
- Average behavior of minimal free resolutions of monomial ideals
- Betti numbers of graded modules and cohomology of vector bundles
- Bounds on degrees of projective schemes
- Combinatorial Commutative Algebra
- Elementary Methods in Number Theory
- Hilbert polynomials in combinatorics
- Homological connectivity of random 2-complexes
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- Limit shapes of bumping routes in the Robinson-Schensted correspondence
- On a Principle of Lipschitz
- On a problem posed by Steve Smale
- On the average number of real roots of a random algebraic equation
- Polyedres de Newton et nombres de Milnor
- Polynomial Equations and Convex Polytopes
- Random flag complexes and asymptotic syzygies
- Random Graphs
- Random monomial ideals
- Random Simplicial Complexes
- Random walk in random groups.
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Standard pairs and group relaxations in integer programming
- The fundamental group of random 2-complexes.
- The probabilistic method
- Topology of random clique complexes
- Topology of random geometric complexes: a survey
This page was built for publication: Asymptotic degree of random monomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170625)
