Random Necklaces Require Fewer Cuts

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-04-26 DOI:10.1137/22m1506699

Noga Alon, Dor Elboim, János Pach, Gábor Tardos

{"title":"Random Necklaces Require Fewer Cuts","authors":"Noga Alon, Dor Elboim, János Pach, Gábor Tardos","doi":"10.1137/22m1506699","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1381-1408, June 2024. <br/>Abstract. It is known that any open necklace with beads of [math] types, in which the number of beads of each type is divisible by [math], can be partitioned by at most [math] cuts into intervals that can be distributed into [math] collections, each containing the same number of beads of each type. This is tight for all values of [math] and [math]. Here, we consider the case of random necklaces, where the number of beads of each type is [math]. Then the minimum number of cuts required for a “fair” partition with the above property is a random variable [math]. We prove that for fixed [math] and large [math], this random variable is at least [math] with high probability. For [math], fixed [math], and large [math], we determine the asymptotic behavior of the probability that [math] for all values of [math]. We show that this probability is polynomially small when [math], is bounded away from zero when [math], and decays like [math] when [math]. We also show that for large [math], [math] is at most [math] with high probability and that for large [math] and large ratio [math], [math] is [math] with high probability.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-04-26","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/22m1506699","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1381-1408, June 2024.
Abstract. It is known that any open necklace with beads of [math] types, in which the number of beads of each type is divisible by [math], can be partitioned by at most [math] cuts into intervals that can be distributed into [math] collections, each containing the same number of beads of each type. This is tight for all values of [math] and [math]. Here, we consider the case of random necklaces, where the number of beads of each type is [math]. Then the minimum number of cuts required for a “fair” partition with the above property is a random variable [math]. We prove that for fixed [math] and large [math], this random variable is at least [math] with high probability. For [math], fixed [math], and large [math], we determine the asymptotic behavior of the probability that [math] for all values of [math]. We show that this probability is polynomially small when [math], is bounded away from zero when [math], and decays like [math] when [math]. We also show that for large [math], [math] is at most [math] with high probability and that for large [math] and large ratio [math], [math] is [math] with high probability.

查看原文本刊更多论文

随机项链所需的剪裁更少

SIAM 离散数学杂志》，第 38 卷第 2 期，第 1381-1408 页，2024 年 6 月。摘要已知任何有[math]类型珠子的开放项链，其中每种类型珠子的数量都能被[math]整除，可以用至多[math]个切割分割成[math]集合的区间，每个区间包含每种类型相同数量的珠子。这对所有 [math] 和 [math] 值都是严密的。在这里，我们考虑随机项链的情况，即每种类型的珠子数量为 [math]。那么，具有上述性质的 "公平 "分割所需的最小切割次数就是一个随机变量 [math]。我们证明，对于固定的[math]和较大的[math]，这个随机变量至少是[math]，而且概率很高。对于[math]、固定[math]和大[math]，我们确定了[math]在所有[math]值下的概率渐近行为。我们证明，当[math]时，这个概率是多项式小概率；当[math]时，这个概率离零有界；当[math]时，这个概率像[math]一样衰减。我们还证明，对于较大的 [math]，[math] 最有可能是 [math]，而对于较大的 [math]和较大比率的 [math]，[math] 极有可能是 [math]。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

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.