The covering number and the transitive covering number may be totally different

被引：0
|
作者：
Jan Kraszewski
机构：
来源：
Acta Mathematica Hungarica | 2004年 / 105卷
关键词：
Abelian groups; ideals; covering number; Hamel basis;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We construct a translation invariant σ-ideal T(κ) (where κ is an infinite cardinal number) such that covt (T(κ)) = 2κ while cov (T(κ)) = cof (T(κ)) = ω1. The constructions can be carried out in R as well.
引用
收藏
页码：115 / 119
页数：4
相关论文
共 50 条
  • [41] Intersecting families with covering number three
    Frankl, Peter
    Wang, Jian
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2025, 171 : 96 - 139
  • [42] EXACT COVERING SYSTEMS IN NUMBER FIELDS
    Jiang, Yupeng
    Deng, Yingpu
    QUARTERLY JOURNAL OF MATHEMATICS, 2014, 65 (01): : 211 - 223
  • [43] ON THE MINIMUM COVERING NUMBER FORMULA OF GRAPHS
    Hou Yaoping Deptof MathUniversity of Science and Technology of ChinaHefei PRC
    NumericalMathematicsAJournalofChineseUniversities(EnglishSeries), 2000, (EnglishSeries) : 61 - 64
  • [44] Set covering number for a finite set
    Chang, HC
    Prabhu, N
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1996, 53 (02) : 267 - 269
  • [45] THE GRAPHOIDAL COVERING NUMBER OF UNICYCLIC GRAPHS
    PAKKIAM, C
    ARUMUGAM, S
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1992, 23 (02): : 141 - 143
  • [46] EXTREMAL GRAPHS WITH PRESCRIBED COVERING NUMBER
    BONDY, JA
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (01) : 51 - 52
  • [47] ON THE MINIMUM COVERING NUMBER FORMULA OF GRAPHS
    Hou Yaoping (Dept.of Math.
    Numerical Mathematics(Theory,Methods and Applications), 2000, (S1) : 61 - 64
  • [48] AVERAGE COVERING NUMBER FOR SOME GRAPHS
    Durgun, Derya Dogan
    Bagatarhan, Ali
    RAIRO-OPERATIONS RESEARCH, 2019, 53 (01) : 261 - 268
  • [49] Estimation of Covering number in learning theory
    Wang, Jianjun
    Huang, Hua
    Luo, Zhangtao
    Chen, Baili
    2009 FIFTH INTERNATIONAL CONFERENCE ON SEMANTICS, KNOWLEDGE AND GRID (SKG 2009), 2009, : 388 - +
  • [50] COVERING POLYGONS WITH MINIMUM NUMBER OF RECTANGLES
    LEVCOPOULOS, C
    LINGAS, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 166 : 63 - 72
12345