Abstract
Abstract We count lattice paths that remain in the first quadrant. A path can come from only finitely many lattice points, and if no further restrictions apply, can go to infinitely many others. By “further restrictions” we mean a boundary line above which the paths may have to stay. Access privilege to the boundary line itself is granted from certain lattice points in the form of a special access step set, which also may be infinite. Our approach to explicit solutions of such enumeration problems is via Sheffer polynomials and functionals, using results of the Umbral Calculus.
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.
