We define type A, type B, type C as well as C*-semi-finite C*-algebras.

For the data based choice of the bandwidth of a kernel density estimator, several methods have recently been proposed which have a very fast asymptotic rate of convergence to the optimal bandwidth. In particular the relative rate of convergence is the square root of the sample size, which is known to be the best possible. The point of this paper is to show how semiparametric arguments can be employed to calculate the best possible constant coefficient, that is, an analog of the usual Fisher information, in this convergence. This establishes an important benchmark as to how well bandwidth selection methods can ever hope to perform. It is seen that some existing methods attain the bound, others do not.

Let R be a non-discrete rank one valuation ring of characteristic p and let E be any discrete valuation ring, we prove the ring of E-Witt vectors over R has uncountable Krull dimension without assuming the axiom of existence of prime ideals for general commutative unitary rings.

Computing the distance among linguistic objects is an essential problem in natural language processing. The word mover’s distance (WMD) has been successfully applied to measure the document distance by synthesizing the low-level word similarity with the framework of optimal transport (OT). However, due to the global transportation nature of OT, the WMD may overestimate the semantic dissimilarity when documents contain unequal semantic details. In this paper, we propose to address this overestimation issue with a novel Wasserstein-Fisher-Rao (WFR) document distance grounded on unbalanced optimal transport theory. Compared to the WMD, the WFR document distance provides a trade-off between global transportation and local truncation, which leads to a better similarity measure for unequal semantic details. Moreover, an efficient prune strategy is particularly designed for the WFR document distance to facilitate the top-k queries among a large number of documents. Extensive experimental results show that the WFR document distance achieves higher accuracy that WMD and even its supervised variation s-WMD.

In this paper, we prove two existence results of solutions to mean field equations Δu+e^u=ρδ_0 and Δu=λe^u(e^u−1)+4π\sum_{j=1}^M δ_{p_j} on an arbitrary connected finite graph, where ρ>0 and λ>0 are constants, M is a positive integer, and p_1,…,p_M are arbitrarily chosen distinct vertices on the graph.