Home Mathematics Walks on tiled boards
Article
Licensed
Unlicensed Requires Authentication

Walks on tiled boards

  • László Németh EMAIL logo
Published/Copyright: December 6, 2024
Become an author with De Gruyter Brill

Abstract

Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled (1 × n) and (2 × n) square grids by covering them with squares and dominoes. We describe these numbers not only recursively, but also as rational polynomial linear combinations of Fibonacci numbers.

Acknowledgement

The author would like to thank the referee for their careful reading and helpful suggestions.

  1. Communicated by Anatolij Dvurečenskij

References

[1] Abbott, H. L.—Hanson, D.: A lattice path problem, Ars Combin. 6 (1978), 163–178.Search in Google Scholar

[2] Belbachir, H.—Belkhir, A.: Tiling approach to obtain identities for generalized Fibonacci and Lucas numbers, Ann. Math. Inform. 41 (2013), 13–17.Search in Google Scholar

[3] Benjamin, A. T.: Self-avoiding walks and Fibonacci numbers, Fibonacci Quart. 44 (2006), 330–334.10.1080/00150517.2006.12428301Search in Google Scholar

[4] Benjamin, A. T.—Quinn, J. J.: Proofs that Really Count: The Art of Combinatorial Proof. Dolciani Math. Exp., Vol. 27, Amer. Math. Soc., 2003.10.5948/9781614442080Search in Google Scholar

[5] Benjamin, A. T.—Quinn, J. J.: The Fibonacci numbers – Exposed more discretely, Math. Mag. 76(3) (2003), 182–192.10.1080/0025570X.2003.11953177Search in Google Scholar

[6] Bousquet-Mélou, M.—Guttmann, A. J.—Jensen, I.: Self-avoiding walks crossing a square, J. Phys. A: Math. Theor. 38(42) (2005), 9159–9181.10.1088/0305-4470/38/42/001Search in Google Scholar

[7] Burkhardt, T. W.—Guim, I.: Self-avoiding walks that cross a square, J. Phys. A: Math. Gen. 24(20) (1991), L1221–L1228.10.1088/0305-4470/24/20/003Search in Google Scholar

[8] Kahkeshani, R.: The tilings of a (2 × n)-board and some new combinatorial identities, J. Integer Seq. 20(5) (2017), Article 17.5.4.Search in Google Scholar

[9] Komatsu, T.—Németh, L.—Szalay, L.: Tilings of hyperbolic (2 × n)-board with colored squares and dominoes, Ars Math. Contemp. 15(2) (2018), 337–346.10.26493/1855-3974.1470.e79Search in Google Scholar

[10] Koshy, T.: Fibonacci and Lucas Numbers with Applications, John Wiley & Sons, Inc, 2001.10.1002/9781118033067Search in Google Scholar

[11] Liptai, K.—Németh, L.—Szakács, T.—Szalay, L.: On certain Fibonacci representation, Fibonacci Quart., 62(4) (2024).Search in Google Scholar

[12] Madras, N.: Critical behaviour of self-avoiding walks that cross a square, J. Phys. A: Math. Theor. 28(6) (1995), 1535.10.1088/0305-4470/28/6/010Search in Google Scholar

[13] Madras, N.—Slade, G.: Some combinatorial bounds. In: The Self-Avoiding Walk, . Springer New York, New York, NY, 2013, pp. 57–76.10.1007/978-1-4614-6025-1_3Search in Google Scholar

[14] Major, L.—Németh, L.—Pahikkala, A.—Szalay, L.: Self-avoiding walks of specified lengths on rectangular grid graphs, Aequat. Math. 98(1) (2024), 215–239.10.1007/s00010-023-00977-8Search in Google Scholar

[15] McQuistan, R. B.—Lichtman, S. J.: Exact recursion relation for 2 × n arrays of dumbbells, J. Math. Phys. 11(10) (1970), 3095–3099.10.1063/1.1665098Search in Google Scholar

[16] Shorey, T. N.—Tijdeman, R.: Exponential Diophantine Equations, Cambridge University Press, 1986.10.1017/CBO9780511566042Search in Google Scholar

[17] Slade, G.: Self-avoiding walk on the complete graph, J. Math. Soc. Japan. 72(4) (2020), 1189–1200.10.2969/jmsj/82588258Search in Google Scholar

[18] Sloane, N. J. A., and Inc., T. O. F.: The On-Line Encyclopedia of Integer Sequences, 2020.10.1515/9780691197944-009Search in Google Scholar

[19] Whittington, S. G.—Guttmann, A. J.: Self-avoiding walks which cross a square, J. Phys. A: Math. Gen. 23 (1990), 5601.10.1088/0305-4470/23/23/030Search in Google Scholar

[20] Williams, L. K.: Enumerating up-side self-avoiding walks on integer lattices, Electron. J. Combin. 3(1) (1996), R31.10.37236/1255Search in Google Scholar

Received: 2023-06-02
Accepted: 2024-07-07
Published Online: 2024-12-06
Published in Print: 2024-12-15

© 2024 Mathematical Institute Slovak Academy of Sciences

Downloaded on 15.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ms-2024-0099/html
Scroll to top button