Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 15 (1982), S. 351-357 
    ISSN: 1432-1416
    Keywords: Markov chain ; Steady state probabilities ; Catalan numbers ; Sequence enumeration ; Enzyme kinetics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract A certain Markov chain which was encountered by T. L. Hill in the study of the kinetics of a linear array of enzymes is studied. An explicit formula for the steady state probabilities is given and some conjectures raised by T. L. Hill are proved.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of combinatorics 2 (1998), S. 185-195 
    ISSN: 0219-3094
    Keywords: 05A15 ; Permutation with restricted positions ; Automated proofs in combinatorics ; Wilf classes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The notion of Enumeration Scheme is introduced and applied to the problem of counting permutations with forbidden patterns. Most importantly, the process is completely automated in a software package, WILF, accompanying this article.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Inventiones mathematicae 108 (1992), S. 575-633 
    ISSN: 1432-1297
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary It is shown that every ‘proper-hypergeometric’ multisum/integral identity, orq-identity, with a fixed number of summations and/or integration signs, possesses a short, computer-constructible proof. We give a fast algorithm for finding such proofs. Most of the identities that involve the classical special functions of mathematical physics are readily reducible to the kind of identities treated here. We give many examples of the method, including computer-generated proofs of identities of Mehta-Dyson, Selberg, Hille-Hardy,q-Saalschütz, and others. The prospect of using the method for proving multivariate identities that involve an arbitrary number of summations/integrations is discussed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of statistical physics 57 (1989), S. 1129-1135 
    ISSN: 1572-9613
    Keywords: Restricted random walk ; method of images ; return probability ; linear partial recurrence equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract In his celebrated paper, Polya has considered the random walk in the three-dimensional (cubic) lattice and showed that the probability of return to the origin is less than 1. Subsequent authors have shown that the probability is %34.053.... Here we consider the same random walk, with the restriction that the drunkard is only allowed to stay inx⩾y⩾z. It is shown that his probability of returning to the originand staying in the allowed region is %6.4844....
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Wellesley, MA :A. K. Peters,
    Title: ¬A¬ equals B ; ¬A¬ = B
    Author: Petkovsek, Marko
    Contributer: Wilf, Herbert S. , Zeilberger, Doron
    Publisher: Wellesley, MA :A. K. Peters,
    Year of publication: 1996
    Pages: 212 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...