Selective game versions of countable tightness with bounded finite selections
Leandro F. Aurichi, Angelo Bella, Rodrigo R. Dias

TL;DR
This paper explores variations of a topological game related to countable tightness, where the second player chooses finitely many points per inning with fixed or increasing limits, revealing the distinctness of these game variants.
Contribution
It introduces and analyzes new game variants allowing finitely many points per inning with fixed or increasing limits, showing their distinctness and implications for countable tightness.
Findings
All fixed-limit game variants are distinct.
A new game variant with increasing points per inning is introduced.
Abstract
For a topological space and a point , consider the following game -- related to the property of being countably tight at . In each inning , the first player chooses a set that clusters at , and then the second player picks a point ; the second player is the winner if and only if . In this work, we study variations of this game in which the second player is allowed to choose finitely many points per inning rather than one, but in which the number of points they are allowed to choose in each inning has been fixed in advance. Surprisingly, if the number of points allowed per inning is the same throughout the play, then all of the games obtained in this fashion are distinct. We also show that a new game is obtained if the number of points the second player is allowed to pick increases at each inning.
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
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
