Abstract
A graph is introduced, which allows of a combinatorial interpretation of a discrete-time semi-infinite Lotka-Volterra (dLV) equation. In particular, Hankel determinants used in a determinant solution to the dLV equation are evaluated, via the Gessel-Viennot method, in terms of non-intersecting subgraphs. Further, the recurrence of the dLV equation describing its time-evolution is equivalently expressed as a time-evolution of weight of specific subgraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
X. G. Viennot, A combinatorial interpretation of the quotient-difference algorithm, Formal power series and algebraic combinatorics (Moscow, 2000), 379–390, Springer, Berlin, 2000.
R. Hirota, Conserved quantities of “random-time Toda equation”, J. Phys. Soc. Japan, 1997, 66(2): 283–284.
V. Spiridonov and A. Zhedanov, Discrete Darboux transformations, the discrete-time Toda lattice, and the Askey-Wilson polynomials, Methods Appl. Anal., 1995, 2(4): 369–398.
P. Flajolet, Combinatorial aspects of continued fractions, Discrete Math., 1980, 32(2): 125–161.
I. Gessel and G. Viennot, Binomial determinants, paths, and hook length formulae, Adv. in Math., 1985, 58(3): 300–321.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kamioka, S., Mizutani, S. A combinatorial aspect of a discrete-time semi-infinite Lotka-Volterra equation. J Syst Sci Complex 23, 71–80 (2010). https://doi.org/10.1007/s11424-010-9276-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-010-9276-1