Related papers: Approximating the Hard Square Entropy Constant wit…
We consider entanglement through permeable interfaces in the c=1 (1+1)-dimensional conformal field theory. We compute the partition functions with the interfaces inserted. By the replica trick, the entanglement entropy is obtained…
For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…
In the Strip Packing problem (SP), we are given a vertical half-strip $[0,W]\times[0,\infty)$ and a set of $n$ axis-aligned rectangles of width at most $W$. The goal is to find a non-overlapping packing of all rectangles into the strip such…
We are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\textit{OkNN}$). Widely used algorithms for OkNN are based on incremental visibility graphs, which means they…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
Using the proposal for holographic entanglement entropy in higher derivative gravities, we compute holographic entanglement entropy for the conformal gravity in four dimensions which turns out to be finite. However, if one subtracts the…
Recently it has been proposed that the Bekenstein-Hawking formula for the entropy of spacetime horizons has a larger significance as the leading contribution to the entanglement entropy of general spacetime regions, in the underlying…
Using a holographic proposal for the entanglement entropy we study its behavior in various supergravity backgrounds. We are particularly interested in the possibility of using the entanglement entropy as way to detect transitions induced by…
We study the multiplicative version of the classical Furstenberg's filtering problem, where instead of the sum $\mathbf{X}+\mathbf{Y}$ one considers the product $\mathbf{X}\cdot \mathbf{Y}$ ($\mathbf{X}$ and $\mathbf{Y}$ are bilateral,…
The weak law of large numbers implies that, under mild assumptions on the source, the Renyi entropy per produced symbol converges (in probability) towards the Shannon entropy rate. This paper quantifies the speed of this convergence for…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…
We discuss the computation of holographic entanglement entropy for interface conformal field theories. The fact that globally well defined Fefferman-Graham coordinates are difficult to construct makes the regularization of the holographic…
We determine holographically 2-point correlators of gauge invariant operators with large conformal weights and entanglement entropy of strips for a time-dependent anisotropic 5-dimensional asymptotically anti-de Sitter spacetime. At the…
We study minimal co-dimension-2 surfaces in the asymptotically flat background of extremal 3-brane solutions in ten-dimensional type IIB supergravity. A conjectured open-closed string duality combined with the Ryu-Takayanagi prescription…
We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge…
Motivated by the approach of random linear codes, a new distance in the vector space over a finite field is defined as the logarithm of the "surface area" of a Hamming ball with radius being the corresponding Hamming distance. It is named…
As is well known, one-dimensional systems with interactions restricted to first nearest neighbors admit a full analytically exact statistical-mechanical solution. This is essentially due to the fact that the knowledge of the first…
Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…
In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours…