Random flag complexes and asymptotic syzygies (Q1755591): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic syzygies of Stanley-Reisner rings of iterated subdivisions / 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: The Geometry of Syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial ideals, Veronese subrings, and rates of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp vanishing thresholds for cohomology of random flag complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective non-vanishing of asymptotic adjoint syzygies / rank
 
Normal rank

Latest revision as of 19:30, 17 July 2024

scientific article
Language Label Description Also known as
English
Random flag complexes and asymptotic syzygies
scientific article

    Statements

    Random flag complexes and asymptotic syzygies (English)
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    Let \(G \sim G(n,p)\) denote an Erdős-Rényi random graph on \(n\) vertices, where each edge is attached with probability \(p\). We turn \(G\) into a flag complex by adjoining a \(q\)-simplex to every \((q+1)\)-clique in the graph, and \(\Delta \sim \Delta(n,p)\) denotes a flag complex chosen with respect to this distribution. From \(\Delta\) Stanley-Reisner theory yields a squarefree monomial ideal \(I_{\Delta} \subseteq K[x_{1},x_{2},\ldots,x_{n}]\). By using probabilistic techniques to analyze the syzygies of \(I_{\Delta}\), the authors produce examples of \textit{L. Ein} and \textit{R. Lazarsfeld}'s [Invent. Math. 190, No. 3, 603--646 (2012; Zbl 1262.13018)] nonvanishing for asymptotic syzygies and of Ein, Erman, and Lazarsfeld's conjecture on how asymptotic Betti numbers behave like binomial coefficients [\textit{L. Ein} et al., J. Reine Angew. Math. 702, 55--75 (2015; Zbl 1338.13023)].
    0 references
    syzygies
    0 references
    monomial ideals
    0 references

    Identifiers

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