منابع مشابه
A simple shift rule for k-ary de Bruijn sequences
A k-ary de Bruijn sequence of order n is a cyclic sequence of length k in which each k-ary string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of order n is a function that maps each length n substring to the next length n substring in the sequence. We present the first known shift rule for k-ary de Bruijn sequences that runs in O(1)-amortized time per ...
متن کاملComparison of k-ary n-cube and de Bruijn Overlays in QoS-constrained Multicast Applications
Research on the construction of logical overlay networks has gained significance in recent times. This is partly due to work on peer-to-peer (P2P) systems for locating and retrieving distributed data objects, and also scalable content distribution using end-system multicast techniques. However, there are emerging applications that require the real-time transport of data from various sources to ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملOn the $k$-ary Moment Map
The moment map is a mathematical expression of the concept of the conservation associated with the symmetries of a Hamiltonian system. The abstract moment map is defined from G-manifold M to dual Lie algebra of G. We will interested study maps from G-manifold M to spaces that are more general than dual Lie algebra of G. These maps help us to reduce the dimension of a manifold much more.
متن کاملPractical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
We present practical algorithms for ranking k-ary necklaces and Lyndon words of length n. The algorithms are based on simple counting techniques. By repeatedly applying the ranking algorithms, both necklaces and Lyndon words can be efficiently unranked. Then, explicit details are given to rank and unrank the length n substrings of the lexicographically smallest de Bruijn sequence of order n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90002-x