The "two ears theorem" is widely known, but I don't know of a general theorem for determining the number of ears of an n-sided polygon. Sounds like a Ph.D. research project to me.
I'd be glad to continue discussions on it, and I'm sure there are a number of others on Wyzant who would be interested in this problem as well.