非加性偏差:贝克-菲拉设定下的覆盖函数
Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
AI总结:
研究非加性偏差中的覆盖函数,提出在稀疏设定下基于贝克-菲拉定理的构造性偏差界,结果与t、k和log n有关。
摘要:
最近,Dupré la Tour和Fujii以及Hollender、Manurangsi、Meka和Suksompong在ITCS'26中引入了非加性函数的古典偏差理论泛化,受公平分配应用启发。由于许多经典偏差理论技术在此设定中失效,包括贝克-菲拉定理等线性代数方法,因此是否能获得类似非加性界仍是一个开放问题。为了更好地理解非加性偏差,我们研究类似于经典贝克-菲拉定理的稀疏设定下的覆盖函数。我们的设定扩展了加性贝克-菲拉设定、分区矩阵的秩函数和图中的边覆盖。更具体地说,假设每个n个物品在所有函数中仅覆盖t个元素,我们证明了一个构造性偏差界,该界是t、颜色数k和log n的多项式函数。
英文摘要:
Recent concurrent work by Dupré la Tour and Fujii and by Hollender, Manurangsi, Meka, and Suksompong [ITCS'26] introduced a generalization of classical discrepancy theory to non-additive functions, motivated by applications in fair division. As many classical techniques from discrepancy theory seem to fail in this setting, including linear algebraic methods like the Beck-Fiala Theorem [Discrete Appl. Math '81], it remains widely open whether comparable non-additive bounds can be achieved. Towards a better understanding of non-additive discrepancy, we study coverage functions in a sparse setting comparable to the classical Beck-Fiala Theorem. Our setting generalizes the additive Beck-Fiala setting, rank functions of partition matroids, and edge coverage in graphs. More precisely, assuming each of the $n$ items covers only $t$ elements across all functions, we prove a constructive discrepancy bound that is polynomial in $t$, the number of colors $k$, and $\log n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。