Related papers: Master Teapots and Entropy Algorithms for the Mand…
We consider the theory of $N$ free Dirac fermions with a uniformly winding mass, $m e^{iqx}$, in two spacetime dimensions. This theory (which describes for instance a superconducting current in an $N$-channel wire) has been proposed to have…
Twist fields are a powerful formal tool to compute R\'enyi entropies in quantum many-body systems, but their conventional formulation in tensor network states involves operations acting on virtual degrees of freedom, which are not directly…
In the second paper [LZ24b] of this series, we obtained an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly…
We consider the family of real (generalized) eigenfunctions of the adjacency operator on $T_d$ - the $d$-regular tree. We show the existence of a unique invariant Gaussian process on the ensemble and derive explicitly its covariance…
Maximum entropy method for analytic continuation is extended by introducing quantum relative entropy. This new method is formulated in terms of matrix-valued functions and therefore invariant under arbitrary unitary transformation of input…
For closed hyperbolic $3$-manifolds $M$ with volume less than a constant $V$, we prove an inequality regarding the geometric $L^2$-norm and the topological Thurston norm, which is qualitatively sharp and verifies a conjecture of Brock and…
A Thurston map is a branched covering map $f\colon S^2\to S^2$ that is postcritically finite. Mating of polynomials, introduced by Douady and Hubbard, is a method to geometrically combine the Julia sets of two polynomials (and their…
We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
The classification of electron systems according to their topology has been at the forefront of condensed matter research in recent years. It has been found that systems of the same symmetry, previously thought of as equivalent, may in fact…
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…
We develop a new method for bounding the relative entropy of a random vector in terms of its Stein factors. Our approach is based on a novel representation for the score function of smoothly perturbed random variables, as well as on the de…
Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…
In this work, we introduce and study what we believe is an intriguing and, to the best of our knowledge, previously unknown connection between two areas in computational topology, topological data analysis (TDA) and knot theory. Given a…
The conformal module of conjugacy classes of braids implicitly appeared in a paper of Lin and Gorin in connection with their interest in the 13. Hilbert Problem. This invariant is the supremum of conformal modules (in the sense of Ahlfors)…
Increased attention has been paid over the last four years to dynamic network embedding. Existing dynamic embedding methods, however, consider the problem as limited to the evolution of a topology over a sequence of global, discrete states.…
We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case,…
We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…
The central result about fast rotating-flow structures is the Taylor-Proudman theorem (TPT) which connects various aspects of the dynamics. Taylor's geometrical proof of TPT is reproduced and extended substantially, with Lie's theory for…