We explore the fine structure of the holographic entanglement entropy proposal (the Ryu-Takayanagi formula) in AdS$_3$/CFT$_{2}$. With the guidance from the boundary and bulk modular flows we find a natural slicing of the entanglement wedge with the modular planes, which are co-dimension one bulk surfaces tangent to the modular flow everywhere. This gives an one-to-one correspondence between the points on the boundary interval $\mathcal{A}$ and the points on the Ryu-Takayanagi (RT) surface $\mathcal{E}_{\mathcal{A}}$. In the same sense an arbitrary subinterval $\mathcal{A}_2$ of $\mathcal{A}$ will correspond to a subinterval $\mathcal{E}_2$ of $\mathcal{E}_{\mathcal{A}}$. This fine correspondence indicates that the length of $\mathcal{E}_2$ captures the contribution $s_{\mathcal{A}}(\mathcal{A}_2)$ from $\mathcal{A}_2$ to the entanglement entropy $S_{\mathcal{A}}$, hence gives the contour function for entanglement entropy. Furthermore we propose that $s_{\mathcal{A}}(\mathcal{A}_2)$ in general can be written as a simple linear combination of entanglement entropies of single intervals inside $\mathcal{A}$. This proposal passes several non-trivial tests.

We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using the control points, resampling the knot vector, and then computing the new control points from the derivatives. We compare our approach with previous algorithms and illustrate it with examples.

We present the third in the series of papers describing Poisson properties of planar directed networks in the disk or in the annulus. In this paper we concentrate on special networks$N$_{$u,v$}in the disk that correspond to the choice of a pair ($u, v$) of Coxeter elements in the symmetric group$S$_{$n$}and the corresponding networks $N_{u,v}^\circ$ in the annulus. Boundary measurements for$N$_{$u,v$}represent elements of the Coxeter double Bruhat cell$G$^{$u,v$}⊂GL_{$n$}. The Cartan subgroup$H$acts on$G$^{$u,v$}by conjugation. The standard Poisson structure on the space of weights of$N$_{$u,v$}induces a Poisson structure on$G$^{$u,v$}, and hence on the quotient$G$^{$u,v$}/$H$, which makes the latter into the phase space for an appropriate Coxeter–Toda lattice. The boundary measurement for $N_{u,v}^\circ$ is a rational function that coincides up to a non-zero factor with the Weyl function for the boundary measurement for$N$_{$u,v$}. The corresponding Poisson bracket on the space of weights of $N_{u,v}^\circ$ induces a Poisson bracket on the certain space $ {\mathcal{R}_n} $ of rational functions, which appeared previously in the context of Toda flows.

No abstract uploaded!

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.