Several explicit identifiability results are derived for deterministic blin
d beamforming in incoherent multipath with small delay spread. For example,
it is shown that if the sum of spatial and fractional sampling diversities
exceeds two times the total number of paths, then identifiability can be g
uaranteed even for one symbol snapshot. The tools come from the theory of l
ow-rank three-way array decomposition (commonly referred to as parallel fac
tor analysis (PARAFAC) and data smoothing in one and two dimensions, New re
sults regarding the Kruskal-rank of certain structured matrices are also in
cluded, and they are of interest in their own right.