Hassani, Mehdi (2005) Counting and Computing by e. Research report collection, 8 (1).

Text cce.pdf Download (155kB)

Abstract

In this research and review paper, using some inequalities and relations involving e, we count the number of paths and cycles in complete graphs the number of derangements. Connection by e yields some nice formulas for the number of derangements, 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.

Item Type:	Article
Uncontrolled Keywords:	approximation, complete graphs, cycles, derangements, derangement function, differential equation, e, incomplete gamma function, hypergeometric function, inequality, irrational number, paths, permutation
Subjects:	FOR Classification > 0101 Pure Mathematics FOR Classification > 0102 Applied Mathematics Collections > Research Group in Mathematical Inequalities and Applications (RGMIA)
Depositing User:	Research Group in Mathematical Inequalities and Applications
Date Deposited:	13 Feb 2012 11:15
Last Modified:	23 May 2013 16:54
URI:	http://vuir.vu.edu.au/id/eprint/18064
ePrint Statistics:	View download statistics for this item

Repository staff only

	View Item

Search Google Scholar