Abstract
In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.
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.
