There exist uniquely ergodic affine interval exchange transformations of [0,1] with flips having wandering intervals and such that the support of the invariant measure is a Cantor set.

Because antimatroid closure spaces satisfy the anti-exchange axiom, it is easy to show that they are uniquely generated. That is, the minimal set of elements determining a closed set is unique. A prime example is a discrete geometry in Euclidean space where closed sets are uniquely generated by their extreme points. But, many of the geometries arising in computer science, e.g. the world wide we...

A natural digraph analogue of the graph-theoretic concept of an ‘independent set’ is that of an ‘acyclic set’, namely a set of vertices not spanning a directed cycle. Hence a digraph analogue of a graph coloring is a decomposition of the vertex set into acyclic sets and we say a digraph is uniquely n-colorable when this decomposition is unique up to relabeling. It was shown probabilistically in...

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite