Related papers: Towards a complete classification of holographic e…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error correcting codes through…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…

We examine holographic entanglement entropy with higher curvature gravity in the bulk. We show that in general Wald's formula for horizon entropy does not yield the correct entanglement entropy. However, for Lovelock gravity, there is an…

The entanglement entropy has been historically studied by many authors in order to obtain quantum mechanical interpretations of the gravitational entropy. The discovery of AdS/CFT correspondence leads to the idea of holographic entanglement…

We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…

The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone -- the holographic entropy cone -- in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary…

We revisit entropy methods to prove new sharp trace logarithmic Sobolev and sharp Gagliardo-Nirenberg-Sobolev inequalities on the half space, with a focus on the entropy inequality itself and not the actual flow, allowing for somewhat…

This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible…

The holographic entanglement entropy functional for higher-curvature gravities involves a weighted sum whose evaluation, beyond quadratic order, requires a complicated theory-dependent splitting of the Riemann tensor components. Using the…

The homography matrix is a key component in various vision-based robotic tasks. Traditionally, homography estimation algorithms are classified into feature- or intensity-based. The main advantages of the latter are their versatility,…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

We study holographic entanglement entropy for certain logarithmic conformal field theories by making use of their gravity descriptions. The corresponding gravity descriptions are provided by higher derivative gravity at critical points…

We prove that the ``chordality condition'', which was established in arXiv:2412.18018 as a necessary condition for an entropy vector to be realizable by a holographic simple tree graph model, is also sufficient. The proof is constructive,…

The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a…

For a general maximally symmetric (spherically, plane or hyperbola symmetric) holographic screen, we rewrite the equations of motion of general Lovelock gravity into the form of some generalized first law of thermodynamics, under certain…

Due to the splitting problem, it is difficult to derive the holographic entanglement entropy for general higher derivative gravity. Inspired by double holography and renormalized entanglement entropy, we develop a method to derive the…

Triangle counting in hypergraph streams, including both hyper-vertex and hyper-edge triangles, is a fundamental problem in hypergraph analytics, with broad applications. However, existing methods face two key limitations: (i) an incomplete…