Related papers: Cauchy filters from Pelant's games
In this manuscript, we claim that the newly introduced $\mathcal{F}$-metric space \cite[\, M.~Jleli and B.~Samet, On a new generalization of metric spaces, J. Fixed Point Theory Appl, 20(3) 2018]{JS1} is metrizable. Also, we deduce that the…
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…
Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…
Convergence of the policy iteration method for discrete and continuous optimal control problems holds under general assumptions. Moreover, in some circumstances, it is also possible to show a quadratic rate of convergence for the algorithm.…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even…
It is a longstanding problem whether every contractible Banach algebra is necessarily finite-dimensional. In this note, we confirm this for Banach algebras acting on Banach spaces with the uniform approximation property. This generalizes a…
Menger's conjecture that Menger spaces are /sigma-compact is false; it is true for analytic subspaces of Polish spaces and undecidable for more complex definable subspaces of Polish spaces. For non-metrizable spaces, analytic Menger spaces…
In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…
The main purpose of this paper is to study complex valued metric-like spaces as an extension of metric-like spaces, complex valued partial metric spaces, partial metric spaces, complex valued metric spaces and metric spaces. In this…
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…
We observe that the category of topological space, uniform spaces, and simplicial sets are all, in a natural way, full subcategories of the same larger category, namely the simplicial category of filters; this is, moreover, implicit in the…
We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have…
J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal…
The main purpose of the paper is the proof of a cardinal inequality for a space with points $G_\delta$, obtained with the help of a long version of the Menger game. This result improves a similar one of Scheepers and Tall.
We study the obstructions to coarse universality in separable dual Banach spaces. We prove coarse non-universality of several classes of dual spaces, including those with conditional spreading bases, as well as generalized James and James…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…