TL;DR
This paper extends Rothberger's theorem to regular lambda, showing that the difference between the pseudointersection number and the towering number is bounded under certain assumptions.
Contribution
It generalizes a classical theorem to higher cardinals and establishes bounds on key cardinal invariants under new conditions.
Findings
Discrepancy between pseudointersection and towering numbers is limited
Generalization of Rothberger's theorem to regular lambda
Bounded difference under certain assumptions
Abstract
We generalize Rothberger's theorem for regular lambda. We prove that the discrepancy between the pseudointersection number and the towering number is limited, under some reasobable assumption
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Benford’s Law and Fraud Detection · Computability, Logic, AI Algorithms