局部分数阶拉普拉斯算子的狄利克雷问题弱解的细正则性

In this paper, we study the Holder regularity of weak solutions to the Dirichlet problem associated with the regional fractional Laplacian (-△)^αΩ on a bounded open set Ω ■R(N ≥ 2) with C^(1,1) boundary ■Ω. We prove that when f ∈ L^p(Ω), and g ∈ C(Ω), the following problem (-△)^αΩu = f in Ω, u = g on ■Ω, admits a unique weak solution u ∈ W^(α,2)(Ω) ∩ C(Ω),where p >N/2-2α and 1/2< α < 1. To solve this problem, we consider it into two special cases, i.e.,g ≡ 0 on ■Ω and f ≡ 0 in Ω. Finally, taking into account the preceding two cases, the general conclusion is drawn.     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

The value function of a transportation problem

We investigate the value of an optimal transportation problem with the maximization objective as a function of costs and vectors of production and consumption. The value is concave in production. For generic costs, the numbers of linearity domains and peak points are independent of costs and consumption. The peak points are determined by an auxiliary assignment problem. The volumes of the linearity domains are independent of costs while their dependence on consumption can be expressed via the multinomial distribution.