A note on counting homomorphisms of paths

DOI10.1007/S00373-012-1261-0MaRDI QIDQ2441343zbMATH OpenOpenAlexWikidataFDO

Authors Michał Morayne, Roger B. Eggleton

Publication date 24 March 2014

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-012-1261-0

zbMATH Keywords

Catalan numberendomorphismgenerating functionhomomorphismpath

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Sums of independent random variables; random walks (60G50)

Recommendations

• The number of path homomorphisms by the generalized Catalan number
• On the number of congruence classes of paths
• scientific article; zbMATH DE number 4047782
• An algorithm for the number of path homomorphisms
• An algorithm for the numbers of endomorphisms on paths (DM13208)

Cites work

• An algorithm for the number of path homomorphisms
• An algorithm for the numbers of endomorphisms on paths (DM13208)
• The number of minimal lattice paths restricted by two parallel lines

Cited in

(7)

• An algorithm for the number of path homomorphisms
• The number of path homomorphisms by the generalized Catalan number
• Counting paths with Schur transitions
• COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
• On the number of congruence classes of paths
• Graph homomorphisms between trees
• Homomorphisms of trees into a path

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A note on counting homomorphisms of paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441343)