A billiards-like dynamical system for attacking chess pieces

From MaRDI portal
Publication:2033944

DOI10.1016/J.EJC.2021.103341zbMATH Open1471.37034arXiv1901.01917OpenAlexW3155269662MaRDI QIDQ2033944FDOQ2033944


Authors: Christopher R. H. Hanusa, Arvind V. Mahankali Edit this on Wikidata


Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We apply a one-dimensional discrete dynamical system originally considered by Arnol'd reminiscent of mathematical billiards to the study of two-move riders, a type of fairy chess piece. In this model, particles travel through a bounded convex region along line segments of one of two fixed slopes. We apply this dynamical system to characterize the vertices of the inside-out polytope arising from counting placements of nonattacking chess pieces and also to give a bound for the period of the counting quasipolynomial. The analysis focuses on points of the region that are on trajectories that contain a corner or on cycles of full rank, or are crossing points thereof. As a consequence, we give a simple proof that the period of the bishops' counting quasipolynomial is 2, and provide formulas bounding periods of counting quasipolynomials for many two-move riders including all partial nightriders. We draw parallels to the theory of mathematical billiards and pose many new open questions.


Full work available at URL: https://arxiv.org/abs/1901.01917




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A billiards-like dynamical system for attacking chess pieces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033944)