Enumeration of higher-dimensional paths under restrictions

DOI10.1016/0012-365X(79)90118-3MaRDI QIDQ754891zbMATH OpenFDO

Authors B. R. Handa, S. G. Mohanty

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(79)90118-3

zbMATH Keywords

enumerationdeterminantlattice pathsgeneralized recurrence relationhigher dimensional spacenumber of paths

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3327315 (Why is no real title available?)
• scientific article; zbMATH DE number 3400906 (Why is no real title available?)
• scientific article; zbMATH DE number 7731501 (Why is no real title available?)
• On queues involving batches
• On the enumeration of certain sets of planted plane trees
• Principles of combinatorics
• Some Convolutions with Multinomial Coefficients and Related Probability Distributions
• Some properties of compositions and their application to probability and statistics I
• Some remarks on ballot-type sequences of positive integers

Cited in

(8)

• Young bitableaux, lattice paths and Hilbert functions
• Higher dimensional restricted lattice paths with diagonal steps
• A history and a survey of lattice path enumeration
• A combinatorial formula for graded multiplicities in excellent filtrations
• A determinant for q-counting n-dimensional lattice paths
• Linear recurrences under side conditions
• q-counting \(n\)-dimensional lattice paths
• A formula for \(P(b_ i \leq R_ i \leq a_ i;\) \(1\leq i\leq m)\) under a general class of alternatives

This page was built for publication: Enumeration of higher-dimensional paths under restrictions

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