In this paper we first introduce a fractional form formula among a number of Euler’s formulas. We then extend the formula and with mathematical induction prove the case when the number of terms increases and the exponent is integer. Afterwards, we study the connection between Euler’s formula and Lagrange interpolating polynomial and use the latter to prove part of the extended formula. We then obtain a new formula from this connection. At last, we derive a set of new equations from the extended formula.

In [1] it was observed that asymptotic boundary conditions play an important role in the study of holographic entanglement beyond AdS/CFT. In particular, the Ryu-Takayanagi proposal must be modified for warped AdS 3 (WAdS 3) with Dirichlet boundary conditions. In this paper, we consider AdS 3 and WAdS 3 with Dirichlet-Neumann bound-ary conditions. The conjectured holographic duals are warped conformal field theories (WCFTs), featuring a Virasoro-Kac-Moody algebra. We provide a holographic calculation of the entanglement entropy and Rényi entropy using AdS 3 /WCFT and WAdS 3 /WCFT du-alities. Our bulk results are consistent with the WCFT results derived by Castro-Hofman-Iqbal using the Rindler method. Comparing with [1], we explicitly show that the holographic entanglement entropy is indeed affected by boundary conditions. Both results differ from the Ryu-Takayanagi proposal, indicating new relations between spacetime geometry and quantum entanglement for holographic dualities beyond AdS/CFT.

The optimal mass transportation problem, proposed by Monge, is dominated by the Monge-Ampere equation. In general, as the Monge-Ampere equation is highly non-linear, this type of partial dierential equations is beyond the solving ability of a conventional nite element method. This diculty led Gu et al. alternatively to the discrete optimal mass transportation problem. They developed variational principles for this problem and reported the calculation for the optimal mapping, based on theorem that among all possible cell decompositions, with constrained measures, the trans- portation cost of the discrete mapping from cells to the corresponding discrete points is minimized by the decomposition induced by a power Voronoi diagram. Their research inspired us to consider a similar discrete optimal mass transportation problem. Here we replace the L2 Euclidean distance by the length of the shortest path connecting two points on a line network. To solve the optimal trans- portation problem on a line network, we study a type of Voronoi diagram on undirected and connected networks and propose an elegant construction algorithm. We further consider weighted distances in a network and develop a method to compute the centroidal Voronoi tessellation (CVT) for a network. By using real geographic data, the method proposed is proved ecient and eective in several practical applications, including charging station distribution in a trac network, and trash can distribution in a park.

In this paper, the differential equations for copolymerization of multiple monomers are derived based on the steady-status assumption of Alfrey-Goldfinger and Valvassori-Sartori respectively, and a numerical method is implemented in C++ language. The differential equations of copolymer composition with wide application presented in this paper provide a theoretical guidance for industrial production and academic research of multiple free radical copolymerization.

This essay mainly involves a method to count the number of permutations of size n with length of the longest increasing subsequence equal to 2. The question is raised as the research project of Algebraic Combinatorics in 2016 Tsinghua Math Camp. This essay will show the relationshi between a permutation's longest increasing subsequence andits correspondingRobinson-Schensted map. Moreover, theessay will develop a general formula to count thenumberwith the help of the hook length formula.