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

137274410547 · Jun 202019922001200920172026
48 results for minimal order

Prove strong ribbon concordance induces a partial order on links, certify minimality for a handful of knots, and find minimal ribbon minimal knots.

problem Prove strong ribbon concordance induces a partial order on links.
method Use results from knot Floer homology to certify minimality under the ribbon partial order.
result Certify minimality for a handful of knots and find minimal ribbon minimal knots.

Minimal surfaces in third-order ODEs identified for linear second-order ODEs.

problem Characterizing minimal surfaces in third-order ODEs.
method Analyzing submanifolds of third-order ODEs as Riemannian manifolds.
result Linear second-order ODEs with y=±y+β(x)y''=\pm y+β(x) are the only minimal surfaces and totally geodesic.

If a knot has the Alexander polynomial not equal to 1, then it is linear nn-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot is quandle colorable. For twist knots, we study the minimal quandle orders in d…

2011-10-18abs ↗pdf ↗

A partial order on the set of prime knots can be defined by the existence of an epimorphism between knot groups. We prove that all the prime knots with up to 66 crossings are minimal. We also show that each fibered knot with the irreducible Alexander polynomial is minimal.

2014-12-10abs ↗pdf ↗

It is well-known that there is a faithful representation of braid groups on automorphism groups of free groups, and it is also well-known that free groups are bi-orderable. We investigate which n-strand braids give rise to automorphisms which preserve some bi-ordering of the free group rank n. As a consequence of our w…

2016-10-11abs ↗pdf ↗

New minimal surfaces in 4D space derived from parametric equations.

problem Deriving explicit parametric equations for higher-order Henneberg-type minimal surfaces in R4\mathbb{R}^4.
method Generalized Weierstrass--Enneper representation and differential geometric analysis.
result Explicit parametric equations and differential geometric characteristics of the Henneberg-type minimal surfaces in R4\mathbb{R}^4.

This is a preliminary note on a family of minimal surfaces in the 3-sphere defined by a compatible fourth order equation. The minimal surfaces are geometrically characterized either by having a surface of revolution like induced metric, or by having a flat structure 3-web. We observe that the structure equation un-coup…

2012-05-06abs ↗pdf ↗

First order methods can take extremely long to find global minima of non-convex functions.

problem Finding global minimizers of non-convex functions.
method Designing a family of non-convex functions and using statistical lower bounds for parameter estimation.
result First order methods can take exponential time to converge to a global minimizer.

Some elementary considerations are presented concerning Catenoids and their stability, separable minimal hypersurfaces, minimal surfaces obtainable by rotating shapes, determinantal varieties, minimal tori in S3, the minimality in Rnk of the ordered set of k orthogonal equal-length n-vectors, and U(1)-invariant minimal…

2019-03-28abs ↗pdf ↗

We consider two types of minimal Poincaré 44-complexes. One is defined with respect to the degree 11-map order. This idea was already present in our previous papers, and more systematically studied later by Hillman. The second type of minimal Poincaré 44-complexes were introduced by Hambleton, Kreck and Teichner. It…

2014-03-14abs ↗pdf ↗

This paper is devoted to a third order study of the end-point map in sub-Riemannian geometry. We first prove third order open mapping results for maps from a Banach space into a finite dimensional manifold. In a second step, we compute the third order term in the Taylor expansion of the end-point map and we specialize …

2019-07-25abs ↗pdf ↗

The minimal surface equation QQ in the second order contact bundle of R3R^3, modulo translations, is provided with a complex structure and a canonical vector-valued holomorphic differential form OmegaOmega on $Q\0$. The minimal surfaces MM in R3R^3 correspond to the complex analytic curves CC in QQ, where the derivati…

2002-01-18abs ↗pdf ↗

This paper addresses law invariant coherent risk measures and their Kusuoka representations. By elaborating the existence of a minimal representation we show that every Kusuoka representation can be reduced to its minimal representation. Uniqueness -- in a sense specified in the paper -- of the risk measure's Kusuoka r…

2012-10-26abs ↗pdf ↗

We define combinatorial analogues of stable and unstable minimal surfaces in the setting of weighted pseudomanifolds. We prove that, under mild conditions, such combinatorial minimal surfaces always exist. We use a technique, adapted from work of Johnson and Thompson, called thin position. Thin position is defined usin…

2018-02-16abs ↗pdf ↗

WSFN overcomes saddle points for non-convex functionals in Wasserstein space.

problem Minimizing non-convex functionals over the Wasserstein space with saddle point avoidance.
method WSFN is a second-order method that preconditions the Wasserstein gradient to avoid saddle points.
result WSFN escapes saddle regions and reaches a global minimizer in polynomial time.

Study of Dirichlet minimizers on manifolds with boundary and their asymptotic behavior.

problem Understanding the behavior of solutions to the Allen-Cahn equation on manifolds with boundary.
method Analyzing the asymptotic behavior of Dirichlet minimizers, relating Neumann data to boundary geometry, and using invertibility of the linearized Allen-Cahn operator.
result Computed expansions of the solution to high order and established a projection theorem about Allen-Cahn solutions near minimal surfaces.

Paper proves Simon's third gap conjecture for minimal surfaces in spheres.

problem Investigating the third gap problem in Simon's conjecture for minimal surfaces in unit spheres.
method Developed refined third-order Simons-type integral identities and established new lower bounds for curvature terms.
result Obtained positive gap results for the squared norm of the second fundamental form throughout the interval \(\left[\frac{5}{3},\frac{9}{5} ight]\).

A new method for the unsupervised learning of sparse representations using autoencoders is proposed and implemented by ordering the output of the hidden units by their activation value and progressively reconstructing the input in this order. This can be done efficiently in parallel with the use of cumulative sums and …

2016-05-05abs ↗pdf ↗

Characterizes symmetric Bernoulli distributions with minimal convex sums.

problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.

In this paper, we provide near-optimal accelerated first-order methods for minimizing a broad class of smooth nonconvex functions that are strictly unimodal on all lines through a minimizer. This function class, which we call the class of smooth quasar-convex functions, is parameterized by a constant γ(0,1]γ\in (0,1], wher…

2019-06-27abs ↗pdf ↗

Study uses renormalized area to determine metric expansion from minimal surfaces.

problem Recovering the expansion of asymptotically hyperbolic metrics from minimal surfaces.
method Uses renormalized area functional on minimal submanifolds to recover metric expansion.
result Proves rigidity for log-analytic metrics and determines obstruction tensor.

SVRN accelerates Newton methods by reducing variance and improving performance.

problem Improving the efficiency of Newton methods for large-scale optimization problems.
method Stochastic Variance-Reduced Newton (SVRN) algorithm that accelerates Subsampled Newton and Iterative Hessian Sketch algorithms.
result SVRN accelerates Newton methods by reducing the number of passes over the data, achieving a significant improvement in performance.

We give a local analytic characterization that a minimal surface in the 3-sphere $\, \ES^3 \subset \R^4$ defined by an irreducible cubic polynomial is one of the Lawson's minimal tori. This provides an alternative proof of the result by Perdomo (\emph{Characterization of order 3 algebraic immersed minimal surfaces of $…

2011-08-23abs ↗pdf ↗

Quantitative estimates for QQ-curvature near minimizing metrics on Riemannian manifolds.

problem Estimating the QQ-curvature near minimizing metrics on Riemannian manifolds.
method Proving quantitative estimates for the total kk-th order QQ-curvature functional near minimizing metrics.
result Existence of quantitative estimates for the QQ-curvature deficit controlling higher powers of the distance to the minimizing set.

BMM algorithm improves convergence for nonconvex optimization problems.

problem Constrained nonsmooth nonconvex optimization problems.
method Block majorization-minimization with diminishing radius.
result Improved convergence rate for nonconvex optimization problems.

In this paper, we introduce a partial order on neighborhood equivalence classes of maximally spread essential multibranched surfaces embedded in a 3-manifold. We show that if a maximally spread essential multibranched surface is atoroidal and acylindrical, then its equivalence class is minimal with respect to the parti…

2019-05-03abs ↗pdf ↗

Conditions for curves on a torus with specific pairwise intersections.

problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.

Optimizes CM for stochastic convex optimization with progressive precision.

problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.

SOR-Mamba improves Mamba for robust time series forecasting by minimizing channel order bias.

problem Robust time series forecasting with Mamba's sequential order bias.
method SOR-Mamba incorporates regularization to minimize channel order discrepancy and introduces CCM for channel correlation preservation.
result SOR-Mamba enhances robustness to channel order and improves forecasting accuracy.