Related papers: Boundary complexity and surface entropy of 2-multi…
In this paper, we introduce two bounds which we call the Upper Differential Entropy and the Lower Differential Entropy for an infinite family of intervals(strips) in quantum field theory. The two bounds are equal provided that the theory is…
Given a closed, oriented, compact surface $S$ of constant negative curvature and genus $g \ge 2$, we study the measure-theoretic entropy of the Bowen-Series boundary map with respect to its smooth invariant measure. We obtain an explicit…
For a homeomorphism $f$ of a compact metric space $X$ and a positive integer $n\geq 2$, we introduce the notion of $(\omega, \alpha, n)$-sensitivity of $f$, which describes such a kind of chaos: there is some $c>0$ such that for any $x\in…
In this paper we consider the numerical approximation of the two-phase membrane (obstacle) problem by finite difference method. First, we introduce the notion of viscosity solution for the problem and construct certain discrete nonlinear…
Given a closed, orientable surface of constant negative curvature and genus $g \ge 2$, we study the topological entropy and measure-theoretic entropy (with respect to a smooth invariant measure) of generalized Bowen--Series boundary maps.…
We present a numerical analysis of the entropy rate and statistical complexity related to the spin flip dynamics of the 2D Ising Ferromagnet at different temperatures T. We follow an information theoretic approach and test three different…
Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n \times n$ square matrices combining ``\emph{Strassen-like}'' fast matrix multiplication approach with…
In this note a new method for computing the entanglement entropy of a CFT holographically is explored. It consists of finding a bulk background with a boundary metric that has the conical singularities needed to compute the entanglement…
We consider second order elliptic divergence form systems with complex measurable coefficients $A$ that are independent of the transversal coordinate, and prove that the set of $A$ for which the boundary value problem with $L_2$ Dirichlet…
When a spacetime has boundaries, the entangling surface does not have to be necessarily compact and it may have boundaries as well. Then there appear a new, boundary, contribution to the entanglement entropy due to the intersection of the…
In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\times 2$ matrices, denoted $\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as…
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…
Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop…
We address several aspects of entanglement entropy of 2D interface CFT using the replica method. Unlike the case of boundary CFT, we consider the boundary OPE (BOPE) of the R\'enyi twist operator and find a boundary twist operator anchored…
One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…
We prove that for every nonnegative integer $g$, there exists a bound on the number of ends of a complete, embedded minimal surface $M$ in $\mathbb{R}^3$ of genus $g$ and finite topology. This bound on the finite number of ends when $M$ has…
Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #SAT to approximate. We study #BIS…
Automata networks are a versatile model of finite discrete dynamical systems composed of interacting entities (the automata), able to embed any directed graph as a dynamics on its space of configurations (the set of vertices, representing…
We consider the supercritical problem {equation*} -\Delta u=|u| ^{p-2}u\text{\in}\Omega,\quad u=0\text{\on}\partial\Omega, {equation*} where $\Omega$ is a bounded smooth domain in $\mathbb{R}^{N}$ and $p$ smaller than the critical exponent…
This paper deals with boundedness results for weak solutions of an elliptic equation where the functions are Carath\'eodory functions satisfying certain $p$-structure conditions that have critical growth even on the boundary. Based on a…