Related papers: Riemannian and Lorentzian flow-cut theorems
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…
Fluence map optimization for intensity-modulated radiation therapy planning can be formulated as a large-scale inverse problem with competing objectives and constraints associated with the tumors and organs-at-risk. Unfortunately,…
Several concepts borrowed from graph theory are routinely used to better understand the inner workings of the (human) brain. To this end, a connectivity network of the brain is built first, which then allows one to assess quantities such as…
In this paper, we obtain the existence criteria for a geometic flow on noncompact affine Riemannian manifolds. Our results can be regarded as a real version of Lee-Tam [19]. As an application, we prove that a complete noncompact Hessian…
The left-invariant sub-Riemannian problem on the Engel group is considered. The problem gives the nilpotent approximation to generic nonholonomic systems in four-dimensional space with two-dimensional control, for instance to a system which…
We present variational approximations of boundary value problems for curvature flow (curve shortening flow) and elastic flow (curve straightening flow) in two-dimensional Riemannian manifolds that are conformally flat. For the evolving open…
Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in…
The maximum principle is one of the most important tools in the analysis of geometric partial differential equations. Traditionally, the maximum principle is applied to a scalar function defined on a manifold, but in recent years more…
We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the net flow at every node and a concave utility function for…
We extend the DeTurck trick from the classical isotropic curve shortening flow to the anisotropic setting. Here the anisotropic energy density is allowed to depend on space, which allows an interpretation in the context of Finsler metrics,…
We study the size of nodal sets of Laplacian eigenfunctions on compact Riemannian manifolds without boundary and recover the currently optimal lower bound by comparing the heat flow of the eigenfunction with that of an artifically…
We study an optimization problem related to the approximation of given data by a linear combination of transformed modes. In the simplest case, the optimization problem reduces to a minimization problem well-studied in the context of proper…
A solution to the left-invariant sub-Riemannian problem on the group of motions (rototranslations) of a plane SE(2) is obtained. Local and global optimality of extremal trajectories is characterized. Lower and upper bounds on the first…
We prove that the multiplicity of a filtration of a local ring satisfies various convexity properties. In particular, we show the multiplicity is convex along geodesics. As a consequence, we prove that the volume of a valuation is log…
In this work, we obtain a short time solution for a geometric flow on noncompact affine Riemannian manifolds. Using this result, we can construct a Hessian metric with nonnegative bounded Hessian sectional curvature on some Hessian…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…
Data flow analysis and optimization is considered for homogeneous rectangular mesh networks. We propose a flow matrix equation which allows a closed-form characterization of the nature of the minimal time solution, speedup and a simple…
In this paper we first propose a framework of structure-preserving submersions, which generalises the concept of a Riemannian submersion, and dualises the concept of subgeometry, or "structure-preserving immersions". The emphasis of our…
This paper studies the characteristics and applicability of the CutFEM approach as the core of a robust topology optimization framework for 3D laminar incompressible flow and species transport problems at low Reynolds number (Re < 200).…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…