A combinatorial property of the factor poset of a word
β Scribed by Arturo Carpi; Aldo de Luca
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 77 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove the following interesting combinatorial property of the poset of the factors of a word. Let w be a word and n = G w + 2, where G w is the maximal length of a repeated factor of w. If v is any word such that the posets of the factors of v and of w up to length n are isomorphic, then v can be obtained by renaming the letters of w or of the reversal of w. ο 2002 Elsevier Science B.V. All rights reserved.
π SIMILAR VOLUMES
We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co
We say that a semigroup S has property P.\* , n > 2, if, given elements xi. , x, of S, at least two of the n! products of these elements coincide. In a recent paper, Restivo considered the Fibonacci semigroup (i.e. the Rees quotient of (a, h}+ by the ideal of nonfactors of the well-known infinite Fi
We prove a new combinatorial property of the maximum round robin tournament (MRRT) problem. This property allows us to answer negatively the question of Briskorn, whether the optimal objective value of the MRRT problem and that of its conventional linear relaxation always coincide.