Search Results

Documents authored by Koul, Prajval


Document
On Effective Banach-Mazur Games and an Application to the Poincaré Recurrence Theorem for Category

Authors: Prajval Koul and Satyadev Nandakumar

Published in: LIPIcs, Volume 364, 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026)


Abstract
The classical Banach-Mazur game characterizes sets of first category in a topological space. In this work, we show that an effectivized version of the game yields a characterization of sets of effective first category. Using this, we provide a game-theoretic proof of an effective theorem in dynamical systems, namely the category version of Poincaré Recurrence. The Poincaré Recurrence Theorem for category states that for a homeomorphism without open wandering sets, the set of non recurrent points forms a first category (meager) set. As an application of the effectivization of the Banach-Mazur game, we show that such a result holds true in effective settings as well.

Cite as

Prajval Koul and Satyadev Nandakumar. On Effective Banach-Mazur Games and an Application to the Poincaré Recurrence Theorem for Category. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 364, pp. 61:1-61:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{koul_et_al:LIPIcs.STACS.2026.61,
  author =	{Koul, Prajval and Nandakumar, Satyadev},
  title =	{{On Effective Banach-Mazur Games and an Application to the Poincar\'{e} Recurrence Theorem for Category}},
  booktitle =	{43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026)},
  pages =	{61:1--61:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-412-3},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{364},
  editor =	{Mahajan, Meena and Manea, Florin and McIver, Annabelle and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.61},
  URN =		{urn:nbn:de:0030-drops-255509},
  doi =		{10.4230/LIPIcs.STACS.2026.61},
  annote =	{Keywords: Recurrence, Topology, Category, Computable Analysis, Computable Toplogy, Dynamical Systems}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail