By using the method of mixed volumes, we give sharp bounds for inclusion measures of convex bodies in n-dimensional Euclidean space. In the special cases where the random convex body is the unit ball or when n = 3, neater and simpler bounds are obtained. All the associated inequalities proved are new isoperimetrictype inequalities.

No abstract uploaded!

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al.[3] for bounded degree graphs, and for three-connected graphs of fixed genus g . Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the g th Laplacian eigenvalue is at most $2\left [