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.

No abstract uploaded!

No abstract uploaded!

We proved in this paper that 14 triangles are necessary to triangulate a square with every angle no more than 72◦, answering an unsolved problem proposed by Professor D.Eppstein. At first, computer is used to search for topologically feasible solutions of triangulations of a rectangle. Then the geometric feasibility is analyzed case by case by plane geometry. We also proved that any rectangle can be 72◦ triangulated if the number of triangles is not limited.

For the d-dimensional incompressible Euler equation, the standard energy method gives local wellposedness for initial velocity in Sobolev space with regularity above some critical threshold. The borderline case was a folklore open problem. In this paper we consider the physical dimension d=2 and show that if we perturb any given smooth initial data in critical norm, then the corresponding solution can have infinite critical norm instantaneously at t>0. In a companion paper we settle the 3D and more general cases. The constructed solutions are unique and even infinitely-smooth (locally) in some cases. To prove these results we introduce a new strategy: large Lagrangian deformation induces critical norm inflation. As an application we also settle several closely related open problems.