Abstract
Summary Pascal’s triangle arises by counting the number of shortest paths from (0, 0) to (n, k) on a square street grid. The length of the shortest path is the Manhattan distance from (0, 0) to (n, k). We consider the case of a square street grid of one-way streets, with successive parallel streets being oppositely directed. We investigate the associated distance function q (which is only a quasi-metric, since q(A, B) may differ from q(B, A)) and the arithmetic triangle obtained by counting shortest routes on the one-way grid from (0, 0) to (n, k).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
