GIVEN a set X and a natural number r denote by X(r) the set of relement subsets of X. An r-graph or hypergraph G is a pair (V, T), where V is a finite set and T c V(r) . We call v E V a vertex of Gâ€¦ (More)

We say a family W of strings over an alphabet is an UMFF if every string has a unique maximal factorization over W. Foundational work by Chen, Fox and Lyndon established properties of the Lyndonâ€¦ (More)

We say a family W of strings is an UMFF if every string has a unique maximal factorization over W . Then W is an UMFF iff xy,yz âˆˆ W and y non-empty imply xyz âˆˆ W . Let L-order denote lexicographicâ€¦ (More)

Suppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Î£. Then W is a circ-UMFF if and only if every word in Î£ has a unique maximalâ€¦ (More)