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

10203040 · May 202619922001200920172026
48 results for Lawlor's criterion

This paper proves area-minimizing cones over Grassmannian manifolds.

problem Determine if cones over Grassmannian manifolds are area-minimizing.
method Detailed descriptions of embedding maps using Hermitian orthogonal projectors, re-proving area-minimization using Lawlor's Curvature Criterion.
result All cones over Grassmannian manifolds are area-minimizing except for oriented real Grassmannians.

Constructing translating solitons from Lagrangian Grim Reapers.

problem Creating Lagrangian translating solitons from intersections of Grim Reapers.
method Desingularizing intersections with special Lagrangian Lawlor necks.
result Constructing Lagrangian translating solitons with multiple ends and loops.

Researchers create non-degenerate harmonic functions on n-dimensional space.

problem Creating non-degenerate Z2\mathbb{Z}_{2}-harmonic functions on Rn\mathbb{R}^{n}.
method Using a variant of ellipsoidal coordinates, the construction is explicit and involves Lawlor's necks in Cn\mathbb{C}^{n}.
result First known family of non-degenerate Z2\mathbb{Z}_{2}-harmonic 1-forms with compact branching sets.

Study on singularities in Lagrangian mean curvature flow with special Lagrangian cones.

problem Understanding singularities in Lagrangian mean curvature flow.
method Analysis of tangent flows and blowup limits of special Lagrangian cones.
result Uniqueness of tangent flows in dimension two and any dimension when the link is connected.

We show the area-minimality property of all homogeneous area-minimizing hypercones in Euclidean spaces (classified by Lawlor) following Lawson's original idea in his 72' Trans. A.M.S. paper "The equivariant Plateau problem and interior regularity". Moreover, each of them enjoys (coflat) calibrations singular only at th…

2015-01-20abs ↗pdf ↗

Butscher, D. Lee, Y. Lee, and Joyce constructed a special Lagrangian submanifold by gluing a Lawlor neck into a transverse intersection point of two special Lagrangian submanifolds. We prove a uniqueness theorem for the gluing of flat special Lagrangian tori of real dimension 3 in a flat complex torus of complex dimens…

2011-02-13abs ↗pdf ↗

In this paper we prove the existence of families of n-dimensional complete embedded minimal submanifolds of C^n with a prescribed configuration of k>1 asymptotic planes. These submanifolds are obtained by desingularizing the intersection of the asymptotes, using a gluing theorem applied to a generalization of a special…

2001-03-21abs ↗pdf ↗

The paper constructs solutions with infinite-time singularities in Lagrangian mean curvature flow.

problem Infinite-time singularities in Lagrangian mean curvature flow.
method Constructing solutions by gluing special Lagrangian 'Lawlor necks' and analyzing dynamics of neck size.
result The flow decomposes initial data into a union of special Lagrangians intersecting at one point.

We prove two main results: (a) Suppose LL is a closed, embedded, exact special Lagrangian mm-fold in Cm{\mathbb C}^m for m3m\ge 3 asymptotic at infinity to the union Π1Π2Π_1\cupΠ_2 of two transverse special Lagrangian planes Π1,Π2Π_1,Π_2 in Cm{\mathbb C}^m. Then LL is one of the explicit 'Lawlor neck' family of examples …

2014-04-01abs ↗pdf ↗

We introduce Lagrangian mean curvature flow with boundary in Calabi--Yau manifolds by defining a natural mixed Dirichlet-Neumann boundary condition, and prove that under this flow, the Lagrangian condition is preserved. We also study in detail the flow of equivariant Lagrangian discs with boundary on the Lawlor neck an…

2019-11-12abs ↗pdf ↗

We study almost-calibrated, O(n)O(n)-equivariant Lagrangian mean curvature flow in Cn\mathbb{C}^n, and prove structural theorems about the Type I and Type II blowups of finite-time singularities. In particular, we prove that any Type I blowup of such a flow must be a special Lagrangian pair of transversely intersecting p…

2019-10-14abs ↗pdf ↗

The paper studies stability and minimizing properties of higher codimensional surfaces in Euclidean space.

problem Stability and minimizing properties of higher codimensional surfaces in Euclidean space.
method Analyzes surfaces associated with the weighted area-functional and proves stability and minimization properties under specific conditions.
result Minimal cones with globally flat normal bundles are ff-stable, and highly singular determinantal varieties and Pfaffian varieties are ff-minimizing.

We characterize the three-dimensional spaces admitting at least six or at least seven equidistant points. In particular, we show the existence of CC^\infty norms on R3\R^3 admitting six equidistant points, which refutes a conjecture of Lawlor and Morgan (1994, Pacific J. Math \textbf{166}, 55--83), and gives the exist…

2005-06-13abs ↗pdf ↗

A second order family of special Lagrangian submanifolds of complex m-space is a family characterized by the satisfaction of a set of pointwise conditions on the second fundamental form. For example, the set of ruled special Lagrangian submanifolds of complex 3-space is characterized by a single algebraic equation on t…

2000-07-21abs ↗pdf ↗

We prove two gluing theorems for special Lagrangian (SL) conifolds in complex space C^m. Conifolds are a key ingredient in the compactification problem for moduli spaces of compact SLs in Calabi-Yau manifolds. In particular, our theorems yield the first examples of smooth SL conifolds with 3 or more planar ends and the…

2011-09-15abs ↗pdf ↗

New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.

problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.

We introduce a new criterion to determine the order of an autoregressive model fitted to time series data. It has the benefits of the two well-known model selection techniques, the Akaike information criterion and the Bayesian information criterion. When the data is generated from a finite order autoregression, the Bay…

2015-08-11abs ↗pdf ↗

This is the second in a series of papers constructing explicit examples of special Lagrangian submanifolds in C^m. The first paper was math.DG/0008021, which studied special Lagrangian m-folds with large symmetry groups. The third is math.DG/0010036, which uses ideas from this paper to construct families of special Lag…

2000-08-21abs ↗pdf ↗

Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.

problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2Γ_2 criterion inequalities and a modified inequality.
result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.

New criterion improves predictive evaluation in weighted inference scenarios.

problem Improving predictive evaluation in scenarios with different likelihoods for estimation and evaluation.
method Developed the posterior covariance information criterion (PCIC) to handle weighted likelihood inference.
result PCIC is asymptotically unbiased for quasi-Bayesian generalization error in weighted inference.

Criterion for stopping conjugacy class enumeration in triangle groups.

problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.

New criterion for solving inverse Hessian equations, including J-equation.

problem Existence of solutions to inverse Hessian equations, including J-equation.
method Stability of pairs in the sense of Paul, formulated in terms of GIT criterion.
result New numerical criterion for existence of solutions to inverse Hessian equations.

Study proposes a stopping criterion for active learning based on error stability.

problem Improving predictive performance in active learning by adaptively annotating samples.
method Proposes a stopping criterion based on error stability for Bayesian active learning.
result Demonstrates the proposed criterion stops active learning at the appropriate timing for various models and datasets.

Clarifies boundary criterion for non-one-ended subgroups in cubulation theory.

problem Boundary criterion for relative cubulation in non-one-ended subgroups.
method Showed that if boundary criterion is satisfied for a relatively hyperbolic group, the group admits a relatively geometric action on a CAT(0) cube complex.
result The refinement of the boundary criterion is useful for constructing new relative cubulations.

Criterion for solvability of complex 2-Hessian equation on compact Kähler manifolds.

problem Solvability of complex 2-Hessian equation on compact Kähler manifolds.
method Nakai--Moishezon-type criterion associated with the complex 2-Hessian equation.
result Criterion equivalent to existence of a smooth 2-admissible representative in complex dimension three.

This paper proves a Nakai-Moishezon criterion for complex Hessian equations.

problem The solvability of complex Hessian equations on Kähler manifolds.
method Establishing a Nakai-Moishezon criterion for Kähler classes on analytic Kähler varieties.
result Proves Lejmi-Szekelyhidi's conjecture for the JJ-equation.

The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.

problem Computing the total Thurston-Bennequin invariant for Legendrian graphs.
method Generalized criterion for computing the total Thurston-Bennequin invariant from the tb of smaller cycles.
result The criterion holds for graphs with up to 9 vertices and for infinite families of examples.

Paper proposes an algorithm for robust estimation using Huber's criterion.

problem Non-convexity and non-robustness of joint maximum likelihood estimation.
method Block-wise minimization majorization framework with data-adaptive step sizes.
result Improved convergence and robustness in sparse learning.