By the integral method, we prove that any space-like entire graphic self-shrinking solution to Lagrangian mean curvature flow in $\mathbb{R}^{2n}_{n}$ with the indefinite metric $\sum_i dx_idy_i$ is flat. This result improves the previous ones in [9] and [1] by removing the additional assumption in their results. In a similar manner, we reprove its Euclidean counterpart which is established in [1].

This paper is devoted to the study of the proximal point algorithm for solving monotone second-order cone complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point algorithm is verified to have global and superlinear convergence properties. For the purpose of solving the subproblems efficiently, we introduce a generalized Newton method and show that only one Newton step is eventually needed to obtain a desired approximate solution that approximately satisfies the appropriate criterion under mild conditions. Numerical comparisons are also made with the derivative-free descent method used by Pan and Chen (Optimization 59:11731197, 2010), which confirm the theoretical results

The aim of this study is to figure out the optimization of survival probability of the generals in the card game "Legends of the Three Kingdoms". First, based on combinatorics and probability theory, the PASCAL program was performed to analyze the probabilities of success when several popular generals perform their special skills in the game. The results are as follows: Second, seven typical generals, including Zhou Tai, Zhang Jiao, Zhen Ji, Lu Xun, Ma Chao, Xiahou Dun, and Guo Jia, were chosen, and their abilities including attacking and defense were arbitrarily quantified according to a model constructed in the present study. The scores are as follows: Card-drawing Changing Attacking Defense Blood-selling Zhen Ji 5.62 Zhou Tai 1.04 Ma Chao 1.68 Xiahou Dun 1.19 Guo Jia 3.36 Lu Xun 3.55 Zhang Jiao 2.55 The abilities of different generals were sorted, and by comparison with the statistical record online, the reliability of the model was proved. Thus, the irrationality of the game is identified in this study, and we recommend the game designer to modify the abilities of some generals and to obtain an optimized value according to the output of the model, by which the game would be more popular.

Let (M, ω) be a compact symplectic 4-manifold with a compatible almost complex structure J. The problem of finding a J-compatible symplectic form with prescribed volume form is an almost-K¨ahler analogue of Yau’s theorem and is connected to a programme in symplectic topology proposed by Donaldson. We call the corresponding equation for the symplectic form the Calabi- Yau equation. Solutions are unique in their cohomology class. It is shown in this paper that a solution to this equation exists if the Nijenhuis tensor is small in a certain sense. Without this assumption, it is shown that the problem of existence can be reduced to obtaining a C0 bound on a scalar potential function.

We study harmonic maps from an admissible flat simplicial complex to a non-positively curved Riemannian manifold. Our main regularity theorem is that these maps are C1, at the interfaces of the top-dimensional simplices in addition to satisfying a balancing condition. If we assume that the domain is a 2-complex,then these maps are C1. As an application, we show that the regularity, the balancing condition and a Bochner formula lead to rigidity and vanishing theorems for harmonic maps. Furthermore, we give an explicit relationship between our techniques and those obtained via combinatorial methods.