Related papers: On the entropy of LEGO
This paper proves that in a non-elementary relatively hyperbolic group, the logarithm growth rate of any non-elementary subgroup has a linear lower bound by the logarithm of the size of the corresponding generating set. As a consequence,…
We use simple analytic arguments and lattice-based computer simulations to study the growth of structures made from a large number of distinct component types. Components possess 'designed' interactions, chosen to stabilize an equilibrium…
Two-dimensional random tilings of rhombi can be seen as projections of two-dimensional membranes embedded in hypercubic lattices of higher dimensional spaces. Here, we consider tilings projected from a $D$-dimensional space. We study the…
We study the holographic complexity conjectures for rotating black holes, uncovering a relationship between the complexity of formation and the thermodynamic volume of the black hole. We suggest that it is the thermodynamic volume and not…
We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…
For real numbers a, b> 1, let as a_b denote the result of interpreting a in base b instead of base 10. We define ``dungeons'' (as opposed to ``towers'') to be numbers of the form a_b_c_d_..._e, parenthesized either from the bottom upwards…
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…
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 use a simple hard-core gas model to study the dynamics of small exploding systems. The system is initially prepared in a thermalized state in a spherical container and then allowed to expand freely into the vacuum. We follow the…
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…
We study the evolution of holographic complexity of pure and mixed states in $1+1$-dimensional conformal field theory following a local quench using both the "complexity equals volume" (CV) and the "complexity equals action" (CA)…
For a pair of points $x,y$ in a compact, riemannian manifold $M$ let $n_t(x,y)$ (resp. $s_t(x,y)$) be the number of geodesic segments with length $\leq t$ joining these points (resp. the minimal number of point obstacles needed to block…
Several applications in communication, control, and learning require approximating target distributions to within small informational divergence (I-divergence). The additional requirement of invertibility usually leads to using encoders…
We introduce an exactly solvable lattice model that reveals a universal finite-size scaling law for configurational entropy driven purely by geometry. Using exact enumeration via Burnside's lemma, we compute the entropy for diverse 1D, 2D,…
The entanglement entropy of various geometries is calculated for the boundary theory dual to a stack of N Dp-branes. The entanglement entropies are readily expressed in terms of the effective coupling at the appropriate energy scales. The…
We develop a theory of classical complexity. We study the relations between classical complexity and entropy, and conjecture that in an isolated system, classical absolute complexity always tends to grow, until it reaches its maximum. We…
We study the Complexity=Volume conjecture for Warped AdS$_3$ black holes. We compute the spatial volume of the Einstein-Rosen bridge and we find that its growth rate is proportional to the Hawking temperature times the Bekenstein-Hawking…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
In this paper we calculate the block entanglement entropies of spin models whose ground states have perfect antiferromagnetic or ferromagnetic long-range order. In the latter case the definition of entanglement entropy is extended to…
This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…