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,742 papers · 148 categories

Trend · papers per month

1345 · Oct 202319922001200920172026
48 results for energy-minimizing

New theorem on 3-manifolds with curvature and convex boundary.

problem Understanding 3-manifolds with specific curvature and boundary properties.
method Analyzes properties of Riemannian 3-manifolds with nonnegative scalar curvature and mean-convex boundary.
result Shows flatness of certain 3-manifolds containing specific geometric objects.

Study on biharmonic almost complex structures on compact manifolds.

problem Existence and regularity of biharmonic almost complex structures.
method Analyzes biharmonic almost complex structures on compact almost Hermitian manifolds, focusing on dimension four.
result Existence of energy-minimizing biharmonic almost complex structures for various topologies and homotopy classes.

We prove that energy minimizing Yang-Mills connections on a compact G2G_{2}-manifold has holonomy equal to G2G_{2} are G2G_{2}-instantons, subject to an extra condition on the curvature. Furthermore, we show that energy minimizing connections on a compact Calabi-Yau 33-fold has holonomy equal to SU(3)SU(3) subject to a s…

2015-11-16abs ↗pdf ↗

We study optimal double helices with straight axes (or the fattest tubes around them) computationally using three kinds of functionals; ideal ones using ropelength, best volume packing ones, and energy minimizers using two one-parameter families of interaction energies between two strands of types rαr^{-α} and $\frac1r…

2011-04-04abs ↗pdf ↗

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

New taxonomy and improved solvers for discrete energy minimization.

problem Maximum-a-posteriori inference in discrete graphical models.
method Dual block-coordinate ascent rule, theoretical analysis, new solver variants.
result Improved state-of-the-art solver outperforming existing methods on all test instances.

We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of …

2018-06-13abs ↗pdf ↗

There are two parts of this paper. First, we discovered an explicit formula for the complex Hessian of the weighted log-Bergman kernel on a parallelogram domain, and utilised this formula to give a new proof about the strict convexity of the Mabuchi functional along a smooth geodesic. Second, when a C^{1,1}-geodesic co…

2017-11-27abs ↗pdf ↗

Study of phase separation and geometry on a closed elastic curve, including dynamics and free energy minimization.

problem Free energy and dynamics of a closed elastic filament coupled to a scalar concentration field.
method Analytical and numerical simulations of coupled Willmore flow and Cahn--Hilliard gradient flow on differential geometry.
result Qualitative changes in free energy landscape due to closure constraint, leading to metastable and stable multi-domain morphologies.

The paper studies harmonic graphs in the Heisenberg group and their properties.

problem No analogous theorem exists for HH-minimal surfaces in the Heisenberg group.
method Introduced intrinsic Dirichlet energy and studied its critical points (contact harmonic graphs).
result Calibration condition and construction of energy-minimizing graphs with various singularities.

This work develops machine learning for micromagnetic energy minimization.

problem Minimizing Gibbs free energy in full 3D micromagnetic simulations.
method Advanced machine learning techniques, including Physics-Informed Neural Networks (PINNs) and Extreme Learning Machines (ELMs), with reformulated bounds and optimization schemes.
result Competitive performance of machine learning methods compared to traditional numerical approaches.

We show that K-energy minimizing movements agree with smooth solutions to Calabi flow as long as the latter exist. As corollaries we conclude that in a general Kahler class long time solutions of Calabi flow minimize both K-energy and Calabi energy. Lastly, by applying convergence results from the theory of minimizing …

2013-01-16abs ↗pdf ↗

In this paper, we consider multi-valued graphs with a prescribed real analytic interface that minimize the Dirichlet energy. Such objects arise as a linearized model of area minimizing currents with real analytic boundaries and our main result is that their singular set is discrete in 2 dimensions. This confirms (and p…

2019-06-24abs ↗pdf ↗

Optimizes energy of mappings from complex projective spaces.

problem Finding energy-minimizing mappings between complex projective spaces and Riemannian manifolds.
method Establishes optimal lower bounds for energy functionals and characterizes optimal mappings.
result Optimal lower bounds for energy functionals are characterized for mappings from real and complex projective spaces.

Improved optimal regularity for harmonic almost complex structures.

problem Establishing optimal regularity for harmonic almost complex structures.
method Quantitative stratification method and rectifiability of singular strata.
result Optimal regularity theory for energy minimizing harmonic almost complex structures.

The article analyzes the stability of a curve shortening flow for planar networks.

problem Stability analysis of anisotropic curve shortening flow for planar networks.
method Used Lojasiewicz-Simon gradient inequality to derive stability results.
result For initial data close to an energy minimizer, the flow exists globally and converges to a different energy minimum.

Let N=(Ω,σ)N=(Ω,σ) and M=(Ω,ρ)M=(Ω^*,ρ) be doubly connected Riemann surfaces and assume that ρρ is a smooth metric with bounded Gauss curvature K\mathcal{K} and finite area. The paper establishes the existence of homeomorphisms between ΩΩ and ΩΩ^* that minimize the Dirichlet energy. In the class of all homeomorphisms $f \col…

2011-08-03abs ↗pdf ↗

Researchers find a surface with minimum bending energy for any genus and isoperimetric ratio.

problem Finding surfaces with minimum bending energy for given genus and isoperimetric ratio.
method Gluing catenoidal bridges to a singular solution of the Willmore equation on a punctured sphere.
result Existence of a surface with minimum bending energy for any genus and isoperimetric ratio.

A new deep learning method for option pricing in rough volatility models.

problem Efficient pricing of European options in high-dimensional rough volatility models.
method Time-stepping deep gradient flow method reformulating the option pricing PDE as an energy minimization problem.
result The method respects asymptotic behavior and known bounds for option prices.

Investigates energy minimizers and critical points of scale-invariant tangent-point energies for knots.

problem Finding and characterizing minimizers and critical points of scale-invariant tangent-point energies for closed curves.
method Develops convergence and regularity theories based on fractional Sobolev spaces and new energy functionals.
result Minimizing sequences converge to locally critical embeddings in all but finitely many points, and locally critical embeddings are regular.

We study the converse to the statement that instantons are minimizers of the Yang--Mills energy in four dimensions. We show that given an energy minimizing connection, A, the curvature of A takes values in a subbundle of the adjoint bundle which decomposes as a sum of instantons.

2008-08-05abs ↗pdf ↗

Derives equilibrium law for Plateau borders in wet soap films and foams.

problem Equilibrium law for Plateau borders in wet foams and films.
method Rigorous derivation using Gauss' capillarity theory, homotopic spanning condition, and effective compactness theorems.
result Sharp regularity properties of energy minimizers for Plateau borders in wet foams and films.

We prove existence and regularity results for energy minimizing maps between ideal hyperbolic 2-dimensional simplicial complexes. The spaces in question were introduced by Charitos-Papadopoulos, who describe their Teichmüller spaces and some compactifications. This work is a first step in introducing harmonic map theor…

2018-10-15abs ↗pdf ↗

The study finds minimal distortion embeddings of surfaces into small domains.

problem Finding the minimal distortion of embeddings between two-dimensional manifolds.
method Proving a lower bound on distortion in terms of areas' discrepancy, characterizing minimizers, and proving stability.
result Homotheties are the unique minimizers for VN/VM1/4V_{\mathcal{N}}/V_{\mathcal{M}} \ge 1/4, and non-homothetic minimizers exist for VN/VM1/4V_{\mathcal{N}}/V_{\mathcal{M}} \le 1/4.

Lipschitz mappings found between Riemann surfaces with specific properties.

problem Finding globally Lipschitz mappings between doubly connected Riemann surfaces.
method Using a result from Iwaniec, Kovalev, and Onninen, the minimizer of the energy functional is shown to be locally Lipschitz and globally Lipschitz.
result The minimizer of the energy functional is a globally Lipschitz mapping.

We study on which compact Sasakian 3-manifolds the Reeb field, which is a Beltrami field with eigenvalue 2, is an energy minimizer in its adjoint orbit under the action of volume preserving diffeomorphisms. This minimization property for Beltrami fields is relevant because of its connections with the phenomenon of magn…

2018-06-04abs ↗pdf ↗

Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information. Because hashing codes learning is NP-hard, many methods resort to some form of relaxation technique. But the performance of these methods can easily deterior…

2017-12-02abs ↗pdf ↗