Counting and Computing by e

arXivmath/0606613MaRDI QIDQ6477421FDOQ6477421

Publication date: 26 June 2006

Abstract: In this paper we count the number of paths and cycles in complete graphs by using the number

e

. Also, we compute the number of derangements in same way. Connection by

e

yields some nice formulas for the number of derangements, such as

D_{n} = l f l o o r f r a c n! + 1 e f l o o r

and

D_{n} = l f l o o r (e + e^{- 1}) n! f l o o r - l f l o o r e n! f l o o r

, and using these relations allow us to compute some incomplete gamma functions and hypergeometric summations; these connections are hidden in the heart of a nice polynomial that we call it derangement function and a simple ordinary differential equation concerning it.

Mathematics Subject Classification ID

Generalized hypergeometric series, ({}_pF_q) (33C20) Paths and cycles (05C38) Inequalities for sums, series and integrals (26D15) Perfect graphs (05C17) Approximation to limiting values (summation of series, etc.) (40A25) Numerical methods for ordinary differential equations (65L99) Incomplete beta and gamma functions (error functions, probability integral, Fresnel integrals) (33B20) Irrationality; linear independence over a field (11J72)

This page was built for publication: Counting and Computing by $e$

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