title: A table of geometrical ambiguities in powder indexing obtained by exhaustive search.
abstract: Geometrical ambiguity means the cases in which more than one powder indexing solution exists. Using a new function implemented in the powder indexing software CONOGRAPH, unit cells that involve geometrical ambiguity are exhaustively searched. As a result, many unknown cases are obtained, although the number of such unit cells is still rather limited. It is also proven that the number of solutions in powder auto-indexing is not always unique, but generally finite.
authors.affiliation: JST PRESTO, Kawaguchi, Saitama, Japan, and Tohoku University, Sendai, Miyagi, Japan.
authors.forename: R
authors.initials: R
authors.lastname: Oishi-Tomiyasu
keywords: computer programs; derivative lattices; geometrical ambiguity; multiple solutions; powder indexing