Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

A q-QUEENS PROBLEM V. SOME OF OUR FAVORITE PIECES: QUEENS, BISHOPS, ROOKS, AND NIGHTRIDERS

  • Chaiken, Seth (Computer Science Department The University at Albany (SUNY)) ;
  • Hanusa, Christopher R.H. (Department of Mathematics Queens College (CUNY)) ;
  • Zaslavsky, Thomas (Department of Mathematical Sciences Binghamton University (SUNY))
  • Received : 2019.10.08
  • Accepted : 2020.06.04
  • Published : 2020.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

Parts I-IV showed that the number of ways to place q nonattacking queens or similar chess pieces on an n × n chessboard is a quasipolynomial function of n whose coefficients are essentially polynomials in q. For partial queens, which have a subset of the queen's moves, we proved complete formulas for these counting quasipolynomials for small numbers of pieces and other formulas for high-order coefficients of the general counting quasipolynomials. We found some upper and lower bounds for the periods of those quasipolynomials by calculating explicit denominators of vertices of the inside-out polytope. Here we discover more about the counting quasipolynomials for partial queens, both familiar and strange, and the nightrider and its subpieces, and we compare our results to the empirical formulas found by Kotššovec. We prove some of Kotššovec's formulas and conjectures about the quasipolynomials and their high-order coefficients, and in some instances go beyond them.

Keywords

References

  1. S. E. Arshon, Reshenie odnoi kombinatorornoi zadachi, Mat. Prosveshchenie 8 (1936), 24-29.
  2. M. Beck and T. Zaslavsky, Inside-out polytopes, Adv. Math. 205 (2006), no. 1, 134-162. https://doi.org/10.1016/j.aim.2005.07.006
  3. S. Chaiken, C. R. H. Hanusa, and T. Zaslavsky, A q-queens problem. I. General theory, Electron. J. Combin. 21 (2014), no. 3, Paper #P3.33, 28 pp. MR 3262270, Zbl1298.05021, arXiv:1303.1879.
  4. S. Chaiken, C. R. H. Hanusa, and T. Zaslavsky, A q-queens problem. II. The square board, J. Algebraic Combin. 41 (2015), no. 3, 619-642. https://doi.org/10.1007/s10801-014-0547-0
  5. S. Chaiken, C. R. H. Hanusa, and T. Zaslavsky, A q-queens problem III. Nonattacking partial queens, Australas. J. Combin. 74 (2019), 305-331.
  6. S. Chaiken, C. R. H. Hanusa, and T. Zaslavsky, A q-queens problem IV. Attacking configurations and their denominators, Dis- crete Math. 343 (2020), no. 2, 111649, 16 pp. https://doi.org/10.1016/j.disc.2019.111649
  7. S. Chaiken, C. R. H. Hanusa, and T. Zaslavsky, A q-queens problem VI. The bishops' period, Ars Math. Contemp. 16 (2019), no. 2, 549-561. https://doi.org/10.26493/1855-3974.1657.d75
  8. L. Comtet, Advanced Combinatorics, revised and enlarged edition, D. Reidel Publishing Co., Dordrecht, 1974.
  9. I. Gessel and R. P. Stanley, Stirling polynomials, J. Combin. Theory Ser. A 24 (1978), no. 1, 24-33. https://doi.org/10.1016/0097-3165(78)90042-0
  10. C. R. H. Hanusa and A. V. Mahankali, A billiards-like dynamical system for attacking chess pieces, Submitted.
  11. A. M. Karavaev, 6 Ferzei - itogi [6 nonattacking queens], cf. [13, 6th ed., pp. 14, 18] and [15, Sequence A176186].
  12. V. Kotesovec, Personal communications, Feb. 8, June 23, July 2, 2010, April 10, 2011, et seq.
  13. V. Kotesovec, Non-attacking chess pieces (chess and mathematics) [Sach a matematika - pocty rozmisteni neohrozujicich se kamenu], self-published online book, Apr. 2010; second ed. Jun. 2010, third ed. Jan., 2011, fourth ed. Jun. 2011, fifth ed. Jan., 2012; 6th ed. Feb., 2013, 795 pp. http://www.kotesovec.cz/math.htm and https://oeis.org/wiki/User: Vaclav_Kotesovec.
  14. K. Pratt, Closed-form expressions for the n-queens problem and related problems, Int. Math. Res. Not. IMRN 2019, no. 4, 1098-1107. https://doi.org/10.1093/imrn/rnx119
  15. N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, http://oeis.org/
  16. R. P. Stanley, Enumerative Combinatorics. Volume 1, second edition, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, Cambridge, 2012.