Egalitarian Steiner triple systems for data popularity
Egalitarian Steiner triple systems for data popularity
复制标题
DOI：
10.1007/s10623-021-00925-0
复制
发表时间：
2021-09
期刊：
影响因子：
--
通讯作者：
C. Colbourn
中科院分区：
文献类型：
--
作者：
C. Colbourn
对于设计的块的排序，元素的点和是包含该元素的块的索引的和。受欢迎程度的块标签要求点和尽可能相等。对于Steiner系统的orderv和strengthin一般，平均点和是;在各种限制块分割的Steiner系统，最大和最小的点和之间的差异是。事实上，对于Steiner三重系统，直接和递归的结构给出建立系统存在的所有点和等于超过三分之二的可接受的订单。
For an ordering of the blocks of a design, the point sum of an element is the sum of the indices of blocks containing that element. Block labelling for popularity asks for the point sums to be as equal as possible. For Steiner systems of ordervand strengthtin general, the average point sum is; under various restrictions on block partitions of the Steiner system, the difference between the largest and smallest point sums is shown to be. Indeed for Steiner triple systems, direct and recursive constructions are given to establish that systems exist with all point sums equal for more than two thirds of the admissible orders.