超图引导循环的最大运行时间

IF 0.9 3区数学 Q2 MATHEMATICS SIAM Journal on Discrete Mathematics Pub Date : 2024-05-07 DOI:10.1137/22m151995x

Ivailo Hartarsky, Lyuben Lichev

{"title":"超图引导循环的最大运行时间","authors":"Ivailo Hartarsky, Lyuben Lichev","doi":"10.1137/22m151995x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1462-1471, June 2024. <br/> Abstract. We show that for every [math], the maximal running time of the [math]-bootstrap percolation in the complete [math]-uniform hypergraph on [math] vertices [math] is [math]. This answers a recent question of Noel and Ranganathan in the affirmative and disproves a conjecture of theirs. Moreover, we show that the prefactor is of the form [math] as [math].","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Maximal Running Time of Hypergraph Bootstrap Percolation\",\"authors\":\"Ivailo Hartarsky, Lyuben Lichev\",\"doi\":\"10.1137/22m151995x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1462-1471, June 2024. <br/> Abstract. We show that for every [math], the maximal running time of the [math]-bootstrap percolation in the complete [math]-uniform hypergraph on [math] vertices [math] is [math]. This answers a recent question of Noel and Ranganathan in the affirmative and disproves a conjecture of theirs. Moreover, we show that the prefactor is of the form [math] as [math].\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/22m151995x\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/22m151995x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

SIAM 离散数学杂志》，第 38 卷，第 2 期，第 1462-1471 页，2024 年 6 月。摘要。我们证明，对于每一个[math]，在[math]顶点[math]上的完整[math]均匀超图中，[math]-bootstrap percolation 的最大运行时间是[math]。这回答了诺埃尔和兰加纳森最近提出的一个问题，并推翻了他们的一个猜想。此外，我们还证明了前因式[math]为[math]。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The Maximal Running Time of Hypergraph Bootstrap Percolation

SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1462-1471, June 2024.
Abstract. We show that for every [math], the maximal running time of the [math]-bootstrap percolation in the complete [math]-uniform hypergraph on [math] vertices [math] is [math]. This answers a recent question of Noel and Ranganathan in the affirmative and disproves a conjecture of theirs. Moreover, we show that the prefactor is of the form [math] as [math].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.

期刊最新文献

An Algorithm to Recover Shredded Random Matrices On Powers of Hamilton Cycles in Ramsey–Turán Theory Maximum Number of Symmetric Extensions in Random Graphs Graphs of Degree at Least [math] with Minimum Algebraic Connectivity On the Turán Number of Edge Blow-Ups of Cliques