Search results for "Necklace"
showing 4 items of 4 documents
IFS attractors and Cantor sets
2006
Abstract We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R 3 such that every homeomorphism f of R 3 which preserves K coincides with the identity on K.
On prefix normal words and prefix normal forms
2016
A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors. We prove that the language of prefix normal words is not context-free and is strictly contai…
New archaeological discoveries through magnetic gradiometry: The early Celtic settlement on Mont Lassois, France
2006
The burial complex of the “Lady of Vix” was discovered and excavated in the 1950s at the foot of Mont Lassois (Figure 1), a mountain situated close to the town of Chatillion-sur-Seine in the Bourgogne region of France. The assemblage of the burial goods was rather extraordinary, including such items as an artfully crafted golden necklace with winged horses and a voluminous wine-mixing vessel, probably made in a Greek workshop, capable of holding 1100 liters. According to archaeological research, this member of the aristocracy must have lived during the period between 550 and 500 BCE. Several large-scale geophysical research projects were undertaken in the vicinity of the burial complex duri…
On Prefix Normal Words
2011
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…