Asymptotic degree of random monomial ideals (Q6170625): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental group of random 2-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of random geometric complexes: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert polynomials in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Simplicial Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Principle of Lipschitz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average behavior of minimal free resolutions of monomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random monomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic syzygies of algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of random Betti tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick proof of nonvanishing for asymptotic syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betti numbers of graded modules and cohomology of vector bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random flag complexes and asymptotic syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk in random groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Standard pairs and group relaxations in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of real roots of a random algebraic equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of random clique complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyedres de Newton et nombres de Milnor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random 2-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Commutative Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary Methods in Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit shapes of bumping routes in the Robinson-Schensted correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Equations and Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on degrees of projective schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group / rank
 
Normal rank

Latest revision as of 13:16, 2 August 2024

scientific article; zbMATH DE number 7725178
Language Label Description Also known as
English
Asymptotic degree of random monomial ideals
scientific article; zbMATH DE number 7725178

    Statements

    Asymptotic degree of random monomial ideals (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2023
    0 references
    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}). \]
    0 references
    0 references
    random monomial ideals
    0 references
    degree
    0 references
    random commutative algebra
    0 references
    probabilistic combinatorics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references