English
Related papers

Related papers: Topological games of bounded selections

200 papers

In this note we relate some selection principles to metrisability and separability of a manifold. In particular we show that $\sf{S}_{fin}(\mathcal K,\mathcal O)$, $\sf{S}_{fin}(\Omega,\Omega)$ and $\sf{S}_{fin}(\Lambda,\Lambda)$ are each…

General Topology · Mathematics 2012-12-05 David Gauld

In 2017, Tkachuk isolated the closed discrete selection property while working on problems related to function spaces [15]. In this paper we will study the closed discrete selection property and the related games and strategies on $C_k(X)$.…

General Topology · Mathematics 2021-02-04 Christopher Caruvana , Jared Holshouser

We establish relationships between various topological selection games involving the space of minimal cusco maps into the real line and the underlying domain. These connections occur across different topologies, including the topology of…

General Topology · Mathematics 2025-09-22 Christopher Caruvana , Jared Holshouser

We derive a conditional variational principle of the saturated set for systems with the non-uniform structure. Our result applies to a broad class of systems including beta-shifts, S-gap shifts and their factors.

Dynamical Systems · Mathematics 2019-03-20 Cao Zhao , Ercai Chen

We add to the theory of preservation of topological properties under forcing. In particular, we answer a question of Gilton and Holshouser in a strong sense, showing that if player II has a winning strategy in the strong countable fan…

Logic · Mathematics 2026-01-13 Chris Lambie-Hanson , Pedro Marun

Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…

General Topology · Mathematics 2018-10-01 Steven Clontz

In this work we discuss a random Tug-of-War game in graphs where one of the players has the power to decide at each turn whether to play a round of classical random Tug-of-War, or let the other player choose the new game position in…

Analysis of PDEs · Mathematics 2019-07-23 Marcos Antón , Fernando Charro , Peiyong Wang

We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in $\mathbb{R}^d$ based on some rules. Variants include boundedness games, where one player wants to keep the positions…

Computer Science and Game Theory · Computer Science 2016-11-28 Stéphane Le Roux , Arno Pauly , Jean-François Raskin

For any classical field configuration or mechanical system with a finite number of degrees of freedom we introduce the concept of topological spectrum. It is based upon the assumption that for any classical configuration there exists a…

Mathematical Physics · Physics 2009-11-13 Francisco Nettel , Hernando Quevedo

In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen…

General Topology · Mathematics 2022-02-01 Manoj Bhardwaj , Alexander V. Osipov

We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game.…

General Topology · Mathematics 2012-02-14 Liljana Babinkostova , Bruno A. Pansera , Marion Scheepers

We establish a network formation game for the Internet's Autonomous System (AS) interconnection topology. The game includes different types of players, accounting for the heterogeneity of ASs in the Internet. We incorporate reliability…

Computer Science and Game Theory · Computer Science 2014-12-31 Eli A. Meirom , Shie Mannor , Ariel Orda

We consider the preservation under products, finite powers, and forcing, of a selection principle based covering property of $T_0$ topological groups. Though the paper is in part a survey, it contributes some new information, including: 1.…

General Topology · Mathematics 2022-05-27 Marion Scheepers

This work presents the selection principle $S_1^*(\tau_x,CD)$ that characterizes $q$-points. We also discuss the induced topological game $G_1^*(\tau_x,CD)$ and its relations with $W$-points and $\widetilde{W}$-points, as well as with the…

General Topology · Mathematics 2022-06-06 Dione Andrade Lara , Renan Maneli Mezabarba

We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…

Logic · Mathematics 2023-02-03 Peter Holy , Philipp Schlicht , Christopher Turner , Philip Welch

By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…

Computer Science and Game Theory · Computer Science 2017-12-11 Yaqi Hao , Daizhan Cheng

We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.

General Topology · Mathematics 2010-11-02 Boaz Tsaban

The connection between topology and quantum mechanics is one of the cornerstones of modern physics. Several examples of current interest like the Aharonov-Bohm effect in quantum mechanics, monopoles and instantons in quantum field theory,…

Classical Physics · Physics 2025-09-22 Kaustav Giri , V. V. Sreedhar

We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible.…

Statistical Mechanics · Physics 2009-11-10 Vittoria Colizza , Jayanth R. Banavar , Amos Maritan , Andrea Rinaldo

A computation in the continuation monad returns a final result given a continuation, ie. it is a function with type $(X \to R) \to R$. If we instead return the intermediate result at $X$ then our computation is called a selection function.…

Programming Languages · Computer Science 2015-03-23 Jules Hedges