This paper studies properties of almost periodic sequences (also known as uniformly recursive). A sequence is almost periodic if for every ΓΏnite string that ccurs inΓΏnitely many times in the sequence there exists a number m such that every segment of length m contains an ccurrence of the word. We s
Perfect periodic correlation sequences
β Scribed by Avraham Freedman; Nadav Levanon; Shimshon Gabbay
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 741 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Asequence{d,d+l...., d f m -1) of m consecutive positive integers is said to be perfect if the integers {1,2, . . . , 2m} can be arranged in disjoint pairs {(q, bi): 1 si G m} so that {bi-a,: l~i~m}={d,d+l,..., d+m-1). A sequence is hooked if the set {1,2,...,2m-1,2m + 1) can be arranged in pairs to
The paper lirst shows the existence of so-called Plato's periodic perfect numbers. 0 Elsevier.
The formation of a perfect sequence for a chain-complete poset generalizes the process of dismantling a finite poset by irreducibles. In the finite case, according to a theorem of Duffus and Rival, the end result, or 'core,' is unique up to isomorphism, no matter how the poset is dismantled. For cha