We consider the following mean field equation: $$\Delta_{g}v+\rho\left(\frac{h^*e^v}{\int_Mh^*e^v}-1\right)=4\pi\sum_{j=1}^N\alpha_j(\delta_{q_j}-1)$$ on M, where M is a compact Riemann surface with volume 1, $h^*$ is a positive $C^1$ function on M, and  $\alpha_j$ are constants satisfying $\alpha_j>-1$. In this paper, we derive the topological degree counting formula for noncritical values of $\rho$. We also give several applications of this formula, including existence of curvature +1 metric with conic singularities, doubly periodic solutions of electroweak theory, and a special case of self-gravitating strings.

No abstract uploaded!

Finding the maximum eigenvalue of a symmetric tensor is an important topic in tensor computation and numerical multilinear algebra. In this paper, we introduce a new class of structured tensors called W-tensors, which not only extends thewell-studied nonnegative tensors by allowing negative entries but also covers several important tensors arising naturally from spectral hypergraph theory.We then show that finding the maximum H-eigenvalue of an even-order symmetric W-tensor is equivalent to solving a structured semidefinite program and hence can be validated in polynomial time. This yields a highly efficient semidefinite program algorithm for computing themaximumH-eigenvalue of W-tensors and is based on a new structured sums-of-squares decomposition result for a nonnegative polynomial induced by W-tensors. Numerical experiments illustrate that the proposed algorithm can successfully find the maximum H-eigenvalue of W-tensors with dimension up to 10,000, subject to machine precision. As applications, we provide a polynomial time algorithm for computing the maximum H-eigenvalues of large-size Laplacian tensors of hyperstars and hypertrees, where the algorithm can be up to 13 times faster than the state-of-the-art numerical method introduced by Ng, Qi, and Zhou in 2009. Finally, we also show that the proposed algorithm can be used to test the copositivity of a multivariate form associated with symmetric extended Z-tensors,whose order may be even or odd.

No abstract uploaded!

The first author has associated in a natural way a profinite group to each irreducible subshift. The group in question was initially obtained as a maximal subgroup of a free profinite semigroup. In the case of minimal subshifts, the same group is shown in the present paper to also arise from geometric considerations involving the Rauzy graphs of the subshift. Indeed, the group is shown to be isomorphic to the inverse limit of the profinite completions of the fundamental groups of the Rauzy graphs of the subshift. A further result involving geometric arguments on Rauzy graphs is a criterion for freeness of the profinite group of a minimal subshift based on the Return Theorem of Berthé et al.