We consider several modified versions of the Positivstellensatz for global analytic functions that involve infinite sums of squares and/or positive semidefinite analytic functions. We obtain a general local-global criterion which localizes the obstruction to have such a global result. This criterion allows us to get completely satisfactory results for analytic curves, normal analytic surfaces and real coherent analytic sets whose connected components are all compact.

The main facts about Hausdorff and packing measures and dimensions of a Borel set$E$are revisited, using$determining$set functions $\phi_\alpha\colon\mathcal{B}_E\to(0,\infty)$ , where $\mathcal{B}_E$ is the family of all balls centred on$E$and α is a real parameter. With mild assumptions on φ_{α}, we verify that the main density results hold, as well as the basic properties of the corresponding box dimension. Given a bounded open set$V$in ℝ^{$D$}, these notions are used to introduce the$interior$and$exterior$measures and dimensions of any Borel subset of ∂$V$. We stress that these dimensions depend on the choice of φ_{α}. Two determining functions are considered, φ_{α}($B$)=Vol_{$D$}($B$∩$V$)diam($B$)^{α-$D$}and φ_{α}($B$)=Vol_{$D$}($B$∩$V$)^{α/$D$}, where Vol_{$D$}denotes the$D$-dimensional volume.

We present an ansatz which makes the equations of motion more tractable for the simplest of Vasiliev’s four-dimensional higher spin theories. The ansatz is similar to axial gauge in electromagnetism. We present a broad class of solutions in the gauge where the spatial connection vanishes, and we discuss the lift of one of these solutions to a full spacetime solution via a gauge transformation.

No abstract uploaded!

Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has O(Kn) vertices, where n is the number of vertices in M and K is a model-dependent constant. We also develop a novel algorithm to simplify Delaunay meshes, allowing a smooth choice of detail levels. Our methods are conceptually simple, theoretically sound and easy to implement. The DM construction algorithm also scales well due to its O(nK logK) time complexity. Delaunay meshes have many favorable geometric and numerical properties. For example, a DM has exactly the same geometry as the input mesh, and it can be encoded by any mesh data structure. Moreover, the empty geodesic circumcircle property implies that the commonly used cotangent Laplace-Beltrami operator has non-negative weights. Therefore, the existing digital geometry processing algorithms can benefit the numerical stability of DM without changing any codes. We observe that DMs can improve the accuracy of the heat method for computing geodesic distances. Also, popular parameterization techniques, such as discrete harmonic mapping, produce more stable results on the DMs than on the input meshes.