Related papers: Explicit entropy bounds for symmetric nearest-neig…
We compute entanglement entropy for free massive scalar fields in anti-de Sitter (AdS) space. The entangling surface is a minimal surface whose boundary is a sphere at the boundary of AdS. The entropy can be evaluated from the thermal free…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…
Recently, the reflected entropy is proposed in holographic approach to describe the entanglement of a bipartite quantum system in a mixed state, which is identified as the area of the reflected minimal surface inside the entanglement wedge.…
Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…
Entanglement entropy is a fundamental concept with rising importance in different fields ranging from quantum information science, black holes to materials science. In complex materials and systems, entanglement entropy provides insight…
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…
We present the analytical calculation of entanglement entropy for a class of two dimensional field theories governed by the symmetries of the Galilean conformal algebra, thus providing a rare example of such an exact computation. These…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanced with a roll-back idea allowing to sequentially retrace…
We consider entanglement through permeable junctions of $N$ $(1+1)$-dimensional free boson and free fermion conformal field theories. In the folded picture we constrain the form of the general boundary state. We calculate replicated…
The Renyi entropies and entanglement entropy of 1+1 CFTs with gravity duals can be computed by explicit construction of the bulk spacetimes dual to branched covers of the boundary geometry. At the classical level in the bulk this has…
The path integral representation for the Renyi entanglement entropies of integer index n implies these information measures define operator correlation functions in QFT. We analyze whether the limit $n\rightarrow 1$, corresponding to the…
In this work, we introduce an original self-consistent scheme based on the one-body reduced density matrix ($\gamma$) formalism. A significant feature of this methodology is the utilization of an optimal unitary transformation of the…
We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…
We present a detailed discussion of entanglement entropy in (1+1)-dimensional Warped Conformal Field Theories (WCFTs). We implement the Rindler method to evaluate entanglement and Renyi entropies for a single interval and along the way we…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
Johnson and Lindenstrauss (Contemporary Mathematics, 1984) showed that for $n > m$, a scaled random projection $\mathbf{A}$ from $\mathbb{R}^n$ to $\mathbb{R}^m$ is an approximate isometry on any set $S$ of size at most exponential in $m$.…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…