First Page | Document Content | |
---|---|---|
![]() Date: 2013-02-21 19:00:20Number theory Eulerian number Summation Series Leonhard Euler Binomial theorem Factorial Bernoulli number Mathematics Combinatorics Integer sequences | Source URL: go.helms-net.deDownload Document from Source WebsiteFile Size: 299,98 KBShare Document on Facebook |
![]() | ON THE NUMBER OF PLANAR EULERIAN ORIENTATIONS arXiv:1610.09837v1 [math.CO] 31 Oct 2016 NICOLAS BONICHON, MIREILLE BOUSQUET-MÉLOU, PAUL DORBEC, AND CLAIRE PENNARUNDocID: 1sPOP - View Document |
![]() | A symmetrical Eulerian identity Fan Chung∗ Ron Graham∗ Don Knuth†DocID: 1pALU - View Document |
![]() | Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is modDocID: 18y9b - View Document |
![]() | PDF DocumentDocID: NkKB - View Document |
![]() | 07 New Formula for the Sum of Powers 7.1 Expression with binomial coefficients of a factorial Formula[removed]S. Ruiz ) When nDocID: 860k - View Document |