All the shapes of spaces: a census of small 3-manifolds

In this work we present a complete (no misses, no duplicates) census for closed, connected, orientable and prime 3-manifolds induced by plane graphs with a bipartition of its edge set (blinks) up to $k=9$ edges. Blinks form a universal encoding for such manifolds. In fact, each such a manifold is a subtle class of blinks, \cite{lins2013B}. Blinks are in 1-1 correpondence with {\em blackboard framed links}, \cite {kauffman1991knots, kauffman1994tlr} We hope that this census becomes as useful for the study of concrete examples of 3-manifolds as the tables of knots are in the study of knots and links.Comment: 31 pages, 17 figures, 38 references. In this version we introduce some new material concerning composite manifold

PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.Comment: 12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematic