a snapshot from last week.

last week, i spoke with a university dean, and he fired off the standard question that one hears in interviews:

"so, describe your research to me."

i gulped.

so i told him about embeddings of metric spaces,
gave a toy example of computer networks,
and hinted that additional geometrical constraints give a "litmus test" to check embeddability.

then a few seconds of silence followed.

him: so .. you study non-euclidean geometry?
me: highly non-euclidean geometry!

well, at least he smiled.