Abstract
To count over some oriented graphs a class of combinatorial numbers is introduced. Their explicit form is obtained by the modern classical umbral calculus using a suitable Sheffer sequence of polynomials. Some properties of this class of polynomials are derived. Very useful methods of divisibility can be generated by the numbers studied here. Some ideas could be applicable in the theory of cellular automata.
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.
