Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Rook and queen paths with boundaries (1109.1806v4)

Published 8 Sep 2011 in math.CO

Abstract: A rook path is a path on lattice points in the plane in which any proper horizontal step to the right or vertical step north is allowed. If, in addition, one allow bishop steps, that is, proper diagonal steps of slope 1, then one has queen paths. A rook or queen path is Catalan if it starts at the origin and stays strictly to the left of the line y = x-1. We give explicit formulas for the ordinary generating function of the number of Catalan rook and queen paths finishing at $(n,n).$ These generating functions are algebraic; indeed, they satisfy quadratic equations. In the second version, we also consider paths with "spider steps", that is, proper steps on lattice points with slope strictly greater than one. In the third version, we give step-enumerator versions of our results.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.