Related papers: The max flow/min cut theorem for currents and lami…
Given any smooth solenoidal vector field $v_0$ on $\mathbf T^3$, we show the existence of infinitely many H\"older-continuous steady Euler flows $v$ with the same topology as $v_0$, in certain weak sense. In particular, we show that $v$…
In this paper, we perform a rigourous version of shape and topological derivatives for optimizations problems under constraint Helmoltz problems. A shape and topological optimization problem is formulated by introducing cost functional. We…
We define a geometric flow that is designed to change surfaces of cylindrical type spanning two disjoint boundary curves into solutions of the Douglas-Plateau problem of finding minimal surfaces with given boundary curves. We prove that…
We extend an energy introduced by Mather to the setting of Almgren-Pitts min-max theory and obtain a parametric, higher-dimensional analogue of Mather's variational barrier theory for twist maps and geodesics on tori. We use this energy to…
I extend the methods in "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng" to directed graphs with a variation of…
We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…
In 2022, Chen et al. proposed an algorithm in \cite{main} that solves the min cost flow problem in $m^{1 + o(1)} \log U \log C$ time, where $m$ is the number of edges in the graph, $U$ is an upper bound on capacities and $C$ is an upper…
We analyse finite-time singularities of the Teichm\"uller harmonic map flow -- a natural gradient flow of the harmonic map energy -- and find a canonical way of flowing beyond them in order to construct global solutions in full generality.…
For every positive, continuous and homogeneous function $f$ on the space of currents on a compact surface $\overline{\Sigma}$, and for every compactly supported filling current $\alpha$, we compute as $L \to \infty$, the number of mapping…
We develop the theory of veering triangulations on oriented surfaces adapted to moduli spaces of half-translation surfaces. We use veering triangulations to give a coding of the Teichm\"uller flow on connected components of strata of…
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…
In this paper, we construct various examples of holomorphic laminations, with leaves of dimension 1, and we also study some of their dynamical properties. In particular we study existence and uniqueness of positive closed currents. We…
We show that topological properties of minimal Dirac sheets as well as of currents lines characterize the phases unambiguously. We obtain the minimal sheets reliably by a suitable simulated-annealing procedure.
The Teichm\"uller harmonic map flow deforms both a map from an oriented closed surface $M$ into an arbitrary closed Riemannian manifold, and a constant curvature metric on $M$, so as to reduce the energy of the map as quickly as possible…
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound…
We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a…
Affine flows on vector bundles with chain transitive base flow are lifted to linear flows and the decomposition into exponentially separated subbundles provided by Selgrade's theorem is determined. The results are illustrated by an…
In this paper, we investigate steady Euler flows in a two-dimensional bounded domain. By an adaption of the vorticity method, we prove that for any nonconstant harmonic function $q$, which corresponds to a nontrivial irrotational flow,…