ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 347, Issues 1-2, 30 November 2005, Pages 353-369
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (207 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2005.06.034    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

Cayley continuants

Emanuele MunariniCorresponding Author Contact Information, E-mail The Corresponding Author and Damiano TorriE-mail The Corresponding Author

Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy

Accepted 9 June 2005. 
Communicated by E. Pergola. 
Available online 8 September 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In 1858 Cayley considered a particular kind of tridiagonal determinants (or continuants). By a direct inspection of the first cases, he conjectured an identity expressing these determinants in terms of certain other determinants considered by Sylvester in 1854. Then Cayley proved the conjectured identity by induction but, as he wrote, he felt unsatisfied with his proof. The main aim of this paper is to give a straightforward proof of Cayley's identity using the method of formal series. Moreover we use this method and umbral calculus techniques to obtain several other identities.

Cayley continuants appear in several contexts and in particular in enumerative combinatorics. Mittag–Leffler polynomials, Meixner polynomials of the first kind, the falling and the raising factorials are just few instances of these continuants. They can be interpreted in terms of weighted permutations. Moreover, as we prove in this paper, they also appear in the context of Hankel determinants generated by certain Catalan-like numbers.

Keywords: Cayley continuant; Kac matrix; Clement matrix; Mittag–Leffler polynomial; Pidduck polynomial; Meixner polynomial; Delannoy number; Catalan-like path; Lattice path; Hankel determinant; Connection constants; Linearization coefficients


Theoretical Computer Science
Volume 347, Issues 1-2, 30 November 2005, Pages 353-369
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.