English
Related papers

Related papers: On Ramsey properties, function spaces, and topolog…

200 papers

This paper analyses Escard\'o and Oliva's generalisation of selection functions over a strong monad from a game-theoretic perspective. We focus on the case of the nondeterminism (finite nonempty powerset) monad $\mathcal{P}$. We use these…

Computer Science and Game Theory · Computer Science 2019-04-16 Joe Bolt , Jules Hedges , Philipp Zahn

We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…

General Topology · Mathematics 2015-05-14 Leandro Aurichi , Santi Spadaro , Lyubomyr Zdomskyy

Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left {\omega}-narrow strongly topological…

General Topology · Mathematics 2020-11-06 Meng Bao , Xiaoyuan Zhang , Xiaoquan Xu

The mean field games system is a coupled pair of nonlinear partial differential equations arising in differential game theory, as a limit as the number of agents tends to infinity. We prove existence and uniqueness of classical solutions…

Analysis of PDEs · Mathematics 2020-01-28 David M. Ambrose

A discrete function of $n$ variables is a mapping $g : X_1 \times \ldots \times X_n \rightarrow A$, where $X_1, \ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\em separable} if there exist $n$ functions $g_i : X_i…

Combinatorics · Mathematics 2017-11-21 Endre Boros , Ondrej Cepek , Vladimir Gurvich

We characterize a class of topological Ramsey spaces such that each element $\mathcal R$ of the class induces a collection $\{\mathcal R_k\}_{k<\omega}$ of projected spaces which have the property that every Baire set is Ramsey. Every…

Combinatorics · Mathematics 2014-06-27 Natasha Dobrinen , Jose G. Mijares

We prove a game theoretic dichotomy for $G_{\delta\sigma}$ sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand,…

Logic · Mathematics 2012-08-14 Christian Rosendal

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

Logic · Mathematics 2024-05-31 Adrián Portillo Fernández

I provide simplified proofs for each of the following fundamental theorems regarding selection principles: 1. The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of…

General Topology · Mathematics 2024-06-05 Boaz Tsaban

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

Logic · Mathematics 2024-08-28 Tonatiuh Matos-Wiederhold , Luciano Salvetti

In this survey, my aim has been to discuss the use of sequences and countable sets in general topology. In this way I have been led to consider five different classes of topological spaces: first countable spaces, sequential spaces, Frechet…

General Topology · Mathematics 2016-04-12 Anthony Goreham

The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…

Logic · Mathematics 2018-05-21 Lu Liu , Benoit Monin , Ludovic Patey

We give a characterization of countable discrete subspace $A$ of a topological space $X$ such that there exists a (linear) continuous mapping $\varphi:C_p^*(A)\to C_p(X)$ with $\varphi(y)|_A=y$ for every $y\in C_p^*(A)$. Using this…

General Topology · Mathematics 2016-04-22 V. Mykhaylyuk

We define notions of cautiousness and cautious belief to provide epistemic conditions for iterated admissibility in finite games. We show that iterated admissibility characterizes the behavioral implications of "cautious rationality and…

Theoretical Economics · Economics 2023-05-25 Emiliano Catonini , Nicodemo De Vito

This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…

Logic · Mathematics 2021-10-05 Natasha Dobrinen

We consider finite systems of contractive homeomorphisms of a complete metric space, which are non-redundant on every level. In general this separation condition is weaker than the strong open set condition and is not equivalent to the weak…

Dynamical Systems · Mathematics 2009-11-12 T. Bedford , S. Borodachov , J. Geronimo

Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…

Computational Complexity · Computer Science 2018-03-20 Joshua A. Grochow , Jamie Tucker-Foltz

We introduce a generalization of sequential compactness using barriers on $\omega$ extending naturally the notion introduced in [W. Kubi\'{s} and P. Szeptycki, On a topological Ramsey theorem, \emph{Canad. Math. Bull.}, 66 (2023),…

A topological space is totally paracompact if any base of this space contains a locally finite subcover. We focus on a problem of Curtis whether in the class of regular Lindel\"of spaces total paracompactness is equivalent to the Menger…

General Topology · Mathematics 2025-11-14 Davide Giacopello , Maddalena Bonanzinga , Piotr Szewczak

Partially observable Markov decision processes (POMDPs) rely on the key assumption that probability distributions are precisely known. Robust POMDPs (RPOMDPs) alleviate this concern by defining imprecise probabilities, referred to as…

Artificial Intelligence · Computer Science 2024-07-30 Eline M. Bovy , Marnix Suilen , Sebastian Junges , Nils Jansen
‹ Prev 1 4 5 6 7 8 10 Next ›