5 search results - page 1 / 1 » A combinatorial identity with application to Catalan numbers |
DM
2006
13 years 4 months ago
2006
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...
EJC
2006
13 years 4 months ago
2006
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
— We examine an abstract formulation of BIST diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vector...
CATS
2006
13 years 6 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...