A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of holographic entanglement entropies. We also prove various properties of the max flow…
We show how 'test' vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we show that a continuous version of the classical Max Flow Min Cut Theorem for net…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This gives a relative version of Stallings' Theorem on the structure of groups with mo…
The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …
Proves a generalized isoperimetric inequality for spheres in dimensions 4 and above.
problem Proving a generalized isoperimetric inequality for spheres in dimensions 4 and above.
method Reduced to a theorem about thick embeddings of graphs, proved using Kolmogorov-Barzdin theorem and max-flow min-cut theorem. Counterexample in dimension 3 uses coarea inequality and winding number computation.
result A generalized isoperimetric inequality for spheres in dimensions 4 and above.
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair s,t where each of s,t is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…
The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. We consider the ana…
In this paper, we study the shape of the min-max minimal hypersurface produced by Almgren-Pitts-Schoen-Simon \cite{AF62, AF65, P81, SS81} in a Riemannian manifold (Mn+1,g) of positive Ricci curvature for all dimensions. The min-max hypersurface has a singular set of Hausdorff codimension 7. We characterize the …
We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer programming (MIP) technology. Yet, existing approaches from the literatur…
Let M be a stratum of a compact stratified space A. It is equipped with a general adapted metric g, which is slightly more general than the adapted metrics of Nagase and Brasselet-Hector-Saralegi. In particular, g has a general type, which is an extension of the type of an adapted metric. A restriction on this …
In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus g≥2. We develop a direct variational methods similar to the proof of the famous Plateau problem by J. Douglas and T. Rado. As a result, we show that the min-max value for the area functional can be achieved by a …
Previously, Cristofaro-Gardiner, Hutchings and Ramos have proved that embedded contact homology (ECH) capacities can recover the volume of a contact 3-manifod in their paper "the asymptotics of ECH capacities" . There were two main steps to proving this theorem: The first step used an estimate for the energy of min-max…
Let (M,g) be a compact Ricci-flat 4-manifold. For p∈M let Kmax(p) (respectively Kmin(p)) denote the maximum (respectively the minimum) of sectional curvatures at p. We prove that if Kmax(p)≤−cKmin(p) for all p∈M, for some constant c with 0≤c<42+6, th…
Entropy is a natural geometric quantity measuring the complexity of a surface embedded in R3. For dynamical reasons relating to mean curvature flow, Colding-Ilmanen-Minicozzi-White conjectured that the entropy of any closed surface is at least that of the self-shrinking two-sphere. We prove this conjecture …
Strong parallels can be drawn between the theory of minimal hypersurfaces and the theory of phase transitions. Borrowing ideas from the former we extend recent results on the regularity of stable phase transition interfaces to the finite Morse index case. As an application we present a PDE-based proof of the celebrated…
Study on local convergence of min-max algorithms to differential equilibria on Riemannian manifolds.
problem Solving zero-sum differential games on Riemannian manifolds.
method Analysis of two simultaneous min-max algorithms, τ-GDA and τ-SGA, to differential Stackelberg and Nash equilibria, with conditions for linear convergence and asymptotic approximation.
result Established sufficient conditions for linear convergence of τ-GDA and demonstrated faster convergence of τ-SGA in some cases.