Maximum Number of Non-Intersecting Diagonals in Square Arrays
Marbarisha M. Kharkongor, Joseph Varghese Kureethara
TL;DR
This paper derives a formula to determine the maximum number of non-intersecting diagonals of any length in square arrays, specifically when the array size is a multiple of the diagonal length plus one.
Contribution
The paper introduces a new formula for calculating the maximum non-intersecting diagonals in square arrays based on array size and diagonal length.
Findings
Derived a general formula for maximum non-intersecting diagonals
Applicable to square arrays where size is a multiple of diagonal length plus one
Provides a theoretical basis for combinatorial arrangements in grids
Abstract
In this paper, we derive a formula to express the maximum number of non-intersecting diagonals of arbitrary length that can be drawn in n x n square arrays, where n is a multiple of l+1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Optimal Experimental Design Methods · Cellular Automata and Applications