منابع مشابه
Some Enumerations on Non-Decreasing Dyck Paths
We construct a formal power series on several variables that encodes many statistics on non-decreasing Dyck paths. In particular, we use this formal power series to count peaks, pyramid weights, and indexed sums of pyramid weights for all nondecreasing Dyck paths of length 2n. We also show that an indexed sum on pyramid weights depends only on the size and maximum element of the indexing set.
متن کاملRegular Enumerations
In the paper we introduce and study regular enumerations for arbitrary recursive ordinals. Several applications of the technique are presented.
متن کاملEnumerations including laconic enumerators
We show that it is possible, for every machine universal for Kolmogorov complexity, to enumerate the lexicographically least description of a length n string in O(n) attempts. In contrast to this positive result for strings, we find that, in any Kolmogorov numbering, no enumerator of nontrivial size can generate a list containing the minimal index of a given partial-computable function. One can...
متن کاملUniform regular enumerations
In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalization of a theorem of Ash and a characterization of a class of uniform operators on transfinite sequences of sets of natural numbers.
متن کاملLocally Computable Enumerations
This paper is an extended and modiied version of 10]. A protocol with local rules is presented for enumerating anonymous nodes of nite graphs. It is proved that such algorithms do not exists for the class of ambiguous graphs, deened in the paper; the proposed algorithm works successfully for remaining non-ambiguous graphs. It is also proved that protocol is fair, which means that no enumeration...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00307-4