In this paper, we study the decomposition of sets of consecutive integers, i.e., how to express the set {0, 1, . . . ,mn−1} as the Minkovski sum of two sets, one with m terms and the other with n terms. First, we translate the problem into the language of polynomials. Then we use the properties of cyclotomic polynomials to determine the structure of all the solutions. Then, we deduce formulas for the number of such expressions. Finally, we give an algorithm to calculate the number of such expressions and analyze its computational complexity.

Necessary and sufficient conditions are given in order for a Borel measure on the Euclidean sphere to have an affine image that is isotropic. A sharp reverse affine isoperimetric inequality for Borel measures on the sphere is presented. This leads to sharp reverse affine isoperimetric inequalities for convex bodies.

We set up a framework to study one-dimensional heat equations defined by fractal Laplacians associated with self-similar measures with overlaps. We show that for a class of such self-similar measures, a heat equation can be discretized and the finite element method can be applied to yield a system of linear differential equations. We show that the numerical solutions converge to the actual solution and obtain the rate of convergence. We also study some properties of the solutions of the heat equation.

No abstract uploaded!

No abstract uploaded!