Related papers: The max flow/min cut theorem for currents and lami…
For a large class of tilings, including the Penrose tiling in two dimension as well as the icosahedral ones in 3 dimension, the continuous hull of such a tiling inherits a minimal lamination structure with flat leaves and a transversal…
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum $s$-$t$ cut (or just its value) for all pairs of vertices $s,t$. We study this problem in directed graphs with unit edge/vertex capacities (corresponding to…
A one-line proof of a minimax theorem due to Steinerberger is given.
In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…
This is a mathematical commentary on Teichm{\"u}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{\"a}chen'' (Determination of extremal quasiconformal maps of closed oriented…
We study the dynamics of the geodesic and horocycle flows of the unit tangent bundle $(\hat M, T^1\mathcal{F})$ of a compact minimal lamination $(M,\mathcal F)$ by negatively curved surfaces. We give conditions under which the action of the…
The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exhibiting a submodular structure of the family of paths within…
We prove that, under a semi-ampleness type assumption on the twisted canonical line bundle, the conical K\"ahler-Ricci flow on a minimal elliptic K\"ahler surface converges in the sense of currents to a generalized conical K\"ahler-Einstein…
We study the problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian…
Let $M$ be a closed Riemannian manifold with a parallel 1-form $\Omega$. We prove two theorems about the curve shortening flow in $M$. One is that the {\csf} $\ct$ in $M$ exists for all $t$ in $[0, \infty)$, if it satisfies $\Omega(T)\geq…
An old and apparently persistent problem in numerical lattice QCD is that the simulations tend to get trapped in a sector of fixed topological charge when the lattice spacing is taken to zero. The effect sets in very rapidly and may…
In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove…
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
We give the first deterministic algorithm that makes sub-quadratic queries to find the global min-cut of a simple graph in the cut query model. Given an $n$-vertex graph $G$, our algorithm makes $\widetilde{O}(n^{5/3})$ queries to compute…
The harmonic map energy of a map from a closed, constant-curvature surface to a closed target manifold can be seen as a functional on the space of maps and domain metrics. We consider the gradient flow for this energy. In the absence of…
We study Kolmogorov flow on a three dimensional, periodic domain with aspect ratios fixed to unity. Using an energy method, we give a concise proof of the linear stability of the laminar flow profile. Since turbulent motion is observed for…
We consider a minimal compact lamination by hyperbolic surfaces. We prove that if it admits a leaf whose holonomy covering is not topologically trivial, then the horocycle flow on its unitary tangent bundle is minimal.
We devise a deterministic algorithm for minimum Steiner cut, which uses $(\log n)^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Panigrahi's (FOCS 2020) algorithm, which uses $(\log…
In this paper, we investigate the embeddings for topological flows. We prove an embedding theorem for discrete topological system. Our results apply to suspension flows via constant function, and for this case we show an embedding theorem…