Abstract—We analyze some 2-adic properties of the sequence defined by the recurrence Z(1) = 1; Z(n) = ∑n−1 k=1 S(n, k)Z(k), n ≥ 2, which counts the number of ultradissimilarity relations, i.e., ultrametrics on an n-set. We prove the 2-adic growth property ν2(Z(n)) ≥ log2 n − 1 and present conjectures on the exact values. DOI: 10.1134/S2070046612030028 Key words: Stirling numbers of the second kind, 2-adic order, recurrence
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
AbstractMultirestricted Stirling numbers of the second kind count the number of partitions of a give...
Abstract Lengyel introduced a sequence of numbers Z n , defined combinatorially, that satisfy a recu...
We prove that for any k = 1, . . . , 2n the 2-adic order of the Stirling number S(2n, k) of the seco...
We prove that for any k = 1,..., 2n the 2-adic order of the Stirling number S(2n, k) of the second k...
We prove that for any k = 1,... , 2n the 2-adic order of the Stirling number S(2n, k) of the second ...
We count the number Z(n) of (not necessarily maximal) chains from 0 to 1 in the partition lattice of...
Abstract. We analyze properties of the 2-adic valuations of S(n, k), the Stir-ling numbers of the se...
We analyze congruence classes of S(n,k), the Stirling numbers of the second kind, modulo powers of 2...
We analyze congruence classes of S(n,k), the Stirling numbers of the second kind, modulo powers of 2...
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the firs...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
AbstractMultirestricted Stirling numbers of the second kind count the number of partitions of a give...
Abstract Lengyel introduced a sequence of numbers Z n , defined combinatorially, that satisfy a recu...
We prove that for any k = 1, . . . , 2n the 2-adic order of the Stirling number S(2n, k) of the seco...
We prove that for any k = 1,..., 2n the 2-adic order of the Stirling number S(2n, k) of the second k...
We prove that for any k = 1,... , 2n the 2-adic order of the Stirling number S(2n, k) of the second ...
We count the number Z(n) of (not necessarily maximal) chains from 0 to 1 in the partition lattice of...
Abstract. We analyze properties of the 2-adic valuations of S(n, k), the Stir-ling numbers of the se...
We analyze congruence classes of S(n,k), the Stirling numbers of the second kind, modulo powers of 2...
We analyze congruence classes of S(n,k), the Stirling numbers of the second kind, modulo powers of 2...
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the firs...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
AbstractMultirestricted Stirling numbers of the second kind count the number of partitions of a give...
DOI
Add to ORKG