O triangulacích bez tupých úhlů
We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.
We propose a weak formulation for the binormal curvature flow of curves in . This formulation is sufficiently broad to consider integral currents as initial data, and sufficiently strong for the weak-strong uniqueness property to hold, as long as self-intersections do not occur. We also prove a global existence theorem in that framework.