arXiv:1108.1041 [math.CO]AbstractReferencesReviewsResources
Some formulas for numbers of line segments and lines in a rectangular grid
Pentti Haukkanen, Jorma K. Merikoski
Published 2011-08-04Version 1
We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q points of the grid. The well-known case k=2 is so generalized. We also present recursive formulas for these numbers assuming k=2, n_1=n_2. The well-known case q=2 is so generalized.
Related articles: Most relevant | Search more
arXiv:2501.11617 [math.CO] (Published 2025-01-20)
Excluding a rectangular grid
arXiv:2106.14755 [math.CO] (Published 2021-06-28)
Counting Divisions of a $2\times n$ Rectangular Grid
arXiv:1409.3869 [math.CO] (Published 2014-09-12)
Selections Without Adjacency on a Rectangular Grid