Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

22436586 · Oct 201919922001200920172026
48 results for Area minimising

Characterizes harmonic morphisms preserving minimal submanifolds and finds novel area-minimising hypercones.

problem Understanding harmonic morphisms and their relationship to minimal submanifolds.
method Characterization of harmonic morphisms as weakly horizontally conformal maps preserving minimal submanifold equations, derivation of reduction properties for other co-dimensions, application to find novel area-minimising hypercones.
result Novel family of degree 4 area-minimising hypercones in R^m, m≥32.

Study characterizes hulls and capacities on Riemannian manifolds, proving isoperimetric inequalities.

problem Characterizing hulls and capacities on Riemannian manifolds.
method Investigates strictly outward minimising hulls and uses p-capacities to recover their areas.
result Sharp isoperimetric inequality on complete noncompact manifolds with nonnegative Ricci curvature.

Study proves properties of constant mean curvature hypersurfaces in high-dimensional spaces.

problem Properties of constant mean curvature hypersurfaces in high-dimensional spaces.
method Proves properties of constant mean curvature hypersurfaces using min-max procedure and surgery.
result Every tangent cone at each isolated singularity is area-minimising.

For every gN0g\in\mathbb{N}_0 and ε>0ε>0, we construct a smooth genus gg surface embedded into the unit ball with area 8π and Willmore energy smaller than 8π+ε8π+ ε. From this we deduce that a minimising sequence for Willmore's energy in the class of genus gg surfaces embedded in the unit ball with area 8π converges …

2016-08-09abs ↗pdf ↗

We prove a splitting theorem for Riemannian n-manifolds with scalar curvature bounded below by a negative constant and containing certain area-minimising hypersurfaces (Theorem 3). Thus we generalise [25,Theorem 3] by Nunes. This splitting result follows from an area comparison theorem for hypersurfaces with non-positi…

2013-09-04abs ↗pdf ↗

The paper establishes structure theory for stable varifolds with applications to area minimising hypersurfaces.

problem Understanding the structure of stable codimension 1 integral varifolds.
method Develops a structure theory for stable codimension 1 stationary integral varifolds with no classical singularities.
result Establishes local structure properties of area minimising currents mod p, including the uniqueness of tangent cones at points with planar tangent cones.

On the one hand, we prove that the Clifford torus in C2\mathbb{C}^2 is unstable for Lagrangian mean curvature flow under arbitrarily small Hamiltonian perturbations, even though it is Hamiltonian FF-stable and locally area minimising under Hamiltonian variations. On the other hand, we show that the Clifford torus is r…

2018-02-05abs ↗pdf ↗

In this paper we prove an area comparison result for certain totally geodesic surfaces in 3-manifolds with a lower bound on the scalar curvature. This result is a variant of a comparison theorem of Heintze-Karcher for minimal hypersurfaces in manifolds of nonnegative Ricci curvature. Our assumptions on the ambient mani…

2011-07-26abs ↗pdf ↗

We consider a short time existence problem motivated by a conjecture of Joyce. Specifically we prove that given any compact Lagrangian LCnL\subset \mathbb{C}^n with a finite number of singularities, each asymptotic to a pair of non-area-minimising, transversally intersecting Lagrangian planes, there is a smooth Lagrangi…

2015-01-30abs ↗pdf ↗

The paper optimizes Dirac eigenvalues on surfaces and connects them to harmonic maps into complex projective spaces.

problem Optimizing the kk-th positive Dirac eigenvalue on surfaces with fixed area and conformal class.
method Connecting the problem to the maximization of Laplacian eigenvalues and using critical metrics for Dirac eigenvalues and harmonic maps into complex projective spaces.
result The first nonzero Dirac eigenvalue on a torus is minimized by the flat metric.

The use of L1 regularisation for sparse learning has generated immense research interest, with successful application in such diverse areas as signal acquisition, image coding, genomics and collaborative filtering. While existing work highlights the many advantages of L1 methods, in this paper we find that L1 regularis…

2011-06-06abs ↗pdf ↗

The Poisson problem consists in finding an immersed surface ΣRmΣ\subset\mathbb{R}^m minimising Germain's elastic energy (known as Willmore energy in geometry) with prescribed boundary, boundary Gauss map and area which constitutes a non-linear model for the equilibrium state of thin, clamped elastic plates originating f…

2018-07-24abs ↗pdf ↗

We study the problem of finding strain-minimising stream surfaces in a divergence-free vector field. These surfaces are generated by motions of seed curves that propagate through the field in a strain minimising manner, i.e., they move without stretching or shrinking, preserving the length of their arbitrary arc. In ge…

2014-11-05abs ↗pdf ↗

Loss minimisation fails to capture epistemic uncertainty in second-order predictors.

problem Capturing epistemic uncertainty in machine learning models.
method Analysis of a second-order learner approach using loss minimisation.
result Loss minimisation does not faithfully represent epistemic uncertainty in second-order predictors.

Let ΩR3Ω\subset \mathbb{R}^3 be a Lipschitz domain, and consider a harmonic map v:ΩS2v: Ω\rightarrow \mathbb{S}^2 with boundary data vΩ=φv|\partialΩ= \varphi which minimises the Dirichlet energy. For p2p\geq 2, we show that any energy minimiser uu whose boundary map ψψ has a small W1,pW^{1,p}-distance to φ\varphi is close t…

2018-10-24abs ↗pdf ↗

We study the Calabi functional on a ruled surface over a genus two curve. For polarisations which do not admit an extremal metric we describe the behaviour of a minimising sequence splitting the manifold into pieces. We also show that the Calabi flow starting from a metric with suitable symmetry gives such a minimising…

2007-03-19abs ↗pdf ↗

Proves strict inequality for minimizers of Willmore energy under isoperimetric constraints.

problem Minimizing the Willmore energy under isoperimetric constraints.
method Connected sum approach, building on previous work by Keller-Mondino-Rivière.
result Existence of minimizers for the isoperimetric constrained Willmore problem in every genus.

Two oppositely charged droplets of (say) water in e.g. oil or air will tend to drift together under the influence of their charges. As they make contact, one might expect them to coalesce and form one large droplet, and this indeed happens when the charge difference is sufficiently small. However, Ristenpart et al disc…

2013-02-20abs ↗pdf ↗

The Duffing oscillator's parameters are identified online using variational message passing.

problem Estimating parameters of a nonlinear Duffing oscillator in real-time.
method Variational message passing on a factor graph of the Duffing oscillator's generative model.
result The online inference procedure performs as well as offline methods.

The paper analyzes greedy algorithms for MMD minimization, showing their efficiency and approximation error.

problem Minimizing Maximum Mean Discrepancy (MMD) for probability measure quantization.
method Iterative algorithms including kernel herding, greedy MMD minimization, and Sequential Bayesian Quadrature (SBQ).
result The greedy algorithms have a lower approximation error than SBQ, but are significantly faster.

Paper finds optimal shapes for minimizing average lengths of billiard trajectories in specific polygons.

problem Finding optimal shapes to minimize the average length of billiard trajectories.
method Used techniques from Teichmüller theory.
result Optimal shapes minimize average lengths of billiard trajectories in specific polygons.

A neural flow method minimizes Willmore energy for 2-surfaces in 3D space.

problem Minimizing Willmore energy for closed oriented 2-surfaces in 3D space.
method Introducing neural Willmore flow to model and minimize the Willmore energy using neural architectures.
result The neural flow reproduces expected round sphere and Clifford torus for genus 0 and 1 surfaces, respectively, and finds minimal Willmore surfaces for genus 2.

Choose two points in the tangent bundle of the Euclidean plane (x,X),(y,Y)TR2(x,X),(y,Y)\in T{ \mathbb R}^2. In this work we characterise the immersed length minimising paths with a prescribed bound on the curvature starting at xx, tangent to XX; finishing at yy, tangent to YY, in each connected component of the space of paths…

2014-03-19abs ↗pdf ↗

The paper discusses the impossibility of eliminating surplus intersections in Lagrangian submanifolds.

problem Can surplus intersections in Lagrangian submanifolds be eliminated by Hamiltonian isotopy?
method Analyzing the intersections and isotopies of Lagrangian submanifolds and auxiliary Lagrangians.
result Surplusection cannot be eliminated in several important situations, highlighting the need for better understanding.

A method improves Cryo-EM 3D map refinement by regularizing rotation estimation.

problem Noise-robustness vs. data-consistency in Cryo-EM 3D map reconstruction.
method Ellipsoidal support lifting (ESL) for regularizing and approximating the global minimizer over Riemannian manifolds.
result The induced bias due to regularizing effect of ESL estimates better rotations than global optimisation.

In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullbac…

2010-04-19abs ↗pdf ↗

Study minimizes crossing points of up to 12 curves on a genus 2 surface.

problem Minimizing intersection points of curves on a surface.
method Analyzes systems of up to 12 simple closed curves on a genus 2 surface to find the minimum crossing number.
result Determines the minimal crossing number of up to 12 curves on a genus 2 surface and proves the minimization systems are unique.

We show that reinforcement learning agents that learn by surprise (surprisal) get stuck at abrupt environmental transition boundaries because these transitions are difficult to learn. We propose a counter-intuitive solution that we call Mutual Information Minimising Exploration (MIME) where an agent learns a latent rep…

2020-01-16abs ↗pdf ↗