M. Aigner, "A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207--210. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
....further combinatorial con gurations. Applications of (2.1) in Physics have been discussed by Guttmann, Owczarek, and Viennot [40] 3) The central argument in the proof of Theorem 2.1 was the application of recursion (2.3) Let us demonstrate the use of this recursion with another example. Aigner [3] could show that the Bell numbers are the unique sequence (c m ) m=0;1;2; such that the electronic journal of combinatorics 8 2001, #A1 8 det(A (0) n ) det(A (1) n ) n Y k=0 k ; det(A (2) n ) r n 1 n Y k=0 k ; 2:4) where r n = 1 P n l=1 n(n 1) n l 1) is the ....
.... of combinatorics 8 2001, #A1 8 det(A (0) n ) det(A (1) n ) n Y k=0 k ; det(A (2) n ) r n 1 n Y k=0 k ; 2:4) where r n = 1 P n l=1 n(n 1) n l 1) is the total number of permutations of n things (for det(A (0) n ) and det(A (1) n ) see [27] and [23] In [3] an approach via generating functions was used in order to derive d (2) n = det(A (2) n ) in (2.4) Setting d (2) n = r n 1 Q n k=0 k in (2.4) with (2.3) one obtains the recurrence r n 1 = n 1) r n 1; r 2 = 5; which just characterizes the total number of permutations of n ....
M. Aigner, \A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207-210.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
....further combinatorial configurations. Applications of (2.1) in Physics have been discussed by Guttmann, Owczarek, and Viennot [40] 3) The central argument in the proof of Theorem 2.1 was the application of recursion (2.3) Let us demonstrate the use of this recursion with another example. Aigner [3] could show that the Bell numbers are the unique sequence (c m ) m=0,1,2, such that the electronic journal of combinatorics 8 2001, #A1 8 det(A (0) n ) det(A (1) n ) n # k=0 k , det(A (2) n ) r n 1 n # k=0 k , 2.4) where r n =1 # n l=1 n(n 1) n l 1) is the total ....
....journal of combinatorics 8 2001, #A1 8 det(A (0) n ) det(A (1) n ) n # k=0 k , det(A (2) n ) r n 1 n # k=0 k , 2. 4) where r n =1 # n l=1 n(n 1) n l 1) is the total number of permutations of n things (for det(A (0) n ) and det(A (1) n ) see [27] and [23] In [3] an approach via generating functions was used in order to derive d (2) n =det(A (2) n ) in (2.4) Setting d (2) n = r n 1 # n k=0 k in (2.4) with (2.3) one obtains the recurrence r n 1 = n 1) r n 1,r 2 =5, which just characterizes the total number of permutations of n things, cf. ....
M. Aigner, "A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207--210.
Hankel Matrices in Coding Theory and Combinatorics - Tamm (2000) (Correct)
No context found.
M. Aigner, "A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207--210.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
No context found.
M. Aigner, "A characterization of the Bell numbers", Discrete Math. 205, no. 1-3, 1999, 207--210.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC