A new way of counting \(n^ m\)

DOI10.1016/0898-1221(95)00060-CzbMath0841.05006MaRDI QIDQ1903757

Young-Ching Deng, Jou-Ming Chang, Yue-Li Wang

Publication date: 1 February 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (1)

Trees, parking functions, and standard monomials of skeleton ideals

Cites Work

• Unnamed Item
• Unnamed Item
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Enumerating \(k\)-way trees
• Another Way of Counting $N^N $

This page was built for publication: A new way of counting \(n^ m\)