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

Trend · papers per month

16314762 · Jun 202019922001200920172026
48 results for min-max width

The paper solves min-max widths on a 3-sphere and strengthens multiplicity theorems.

problem Which min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π?
method Homological min-max theory and stronger versions of multiplicity one theorems.
result Proves the 10th to 13th min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π.

The paper bounds the min-max width of embedded circles on spheres and manifolds.

problem Bounding the min-max width of embedded circles on spheres and manifolds.
method Inducing a sweepout by pairs of points in embedded circles from a given sweepout of the sphere by closed curves.
result Lower bounds for the Birkhoff min-max invariant of a Riemannian sphere in terms of the min-max width of its embedded circles.

New geometric invariant from min-max width of spheres on Riemannian 2-spheres.

problem Understanding the min-max width of spheres associated to distance functions.
method Application of min-max methods to pairs of points on Riemannian 2-spheres.
result The min-max width does not always equal half the length of a simple closed geodesic.

Study finds geodesic networks for surfaces with convex boundary.

problem Finding geodesic networks for surfaces with convex boundary.
method Investigates free boundary geodesic networks in surfaces with non-negative sectional curvature and convex boundary.
result Existence of a geodesic network realizing the first width of a surface with non-negative sectional curvature and strictly convex boundary.

How large can be the width of Riemannian three-spheres of the same volume in the same conformal class? If a maximum value is attained, how does a maximising metric look like? What happens as the conformal class changes? In this paper, we investigate these and other related questions, focusing on the context of Simon-Sm…

2018-09-10abs ↗pdf ↗

We compute the kk-width of a round 22-sphere for k=1,,8k=1,\ldots,8 and we use this result to show that unstable embedded closed geodesics can arise with multiplicity as a min-max critical varifold.

2016-01-06abs ↗pdf ↗

The paper proves the existence of boundary minimal hypersurfaces in compact manifolds with boundary.

problem Existence of boundary minimal hypersurfaces in compact manifolds with boundary.
method Min-max theory applied to local maximizers of width in conformal classes.
result Existence of a sequence of properly embedded equidistributed boundary minimal hypersurfaces.

We show that the sum of the Morse indices of the Willmore spheres realising the width of Willmore type sweep-outs is bounded by the number of the parameters of the min-max. As an application, we deduce that among the true Willmore spheres realising the min-max sphere eversion, at most one of them one has index 1, while…

2018-08-23abs ↗pdf ↗

In this paper, we show that a closed manifold Mn+1(n7)M^{n+1} (n \geq 7) endowed with a CC^\infty-generic (Baire sense) metric contains infinitely many singular minimal hypersurfaces with optimal regularity. Moreover, for 2n62 \leq n \leq 6, our argument also implies the denseness of the minimal hypersurfaces realizing min-m…

2019-01-24abs ↗pdf ↗

The paper develops a theory for free boundary minimal surfaces with genus at least one.

problem Finding minimal surfaces with specific genus and boundary conditions.
method Using sweepouts of surfaces of genus g≥1 and m≥1 ideal boundary components, the paper constructs a min-max theory for free boundary minimal surfaces.
result The width for the area functional can be achieved by a bubble tree limit of branched genus g free boundary minimal surfaces with nodes.

We prove a sharp area estimate for catenoids that allows us to rule out the phenomenon of multiplicity in min-max theory in several settings. We apply it to prove that i) the width of a three-manifold with positive Ricci curvature is realized by an orientable minimal surface ii) minimal genus Heegaard surfaces in such …

2016-01-18abs ↗pdf ↗

The paper finds a special hypersurface in a manifold with positive Ricci curvature.

problem Finding a special hypersurface in a manifold with positive Ricci curvature.
method Equivariant min-max method applied to GG-manifolds.
result The hypersurface is a multiplicity one minimal GG-hypersurface.

Study min-max theory for hypersurfaces with boundary constraints.

problem Finding minimal hypersurfaces with boundary constraints.
method Schoen-Simon-type regularity result for integral varifolds, proving existence of closed hypersurfaces with specific properties.
result Existence of a closed C1,1C^{1,1} hypersurface with codimension 7\geq 7 singular set in the interior.

We obtain in arbitrary codimension a removability result on the order of singularity of Willmore surfaces realising the width of Willmore min-max problems on spheres. As a consequence, out of the twelve families of non-planar minimal surfaces in R3\mathbb{R}^3 of total curvature greater than 12π-12π, only three of them …

2019-04-22abs ↗pdf ↗

In this paper we consider min-max minimal surfaces in three-manifolds and prove some rigidity results. For instance, we prove that any metric on a 3-sphere which has scalar curvature greater than or equal to 6 and is not round must have an embedded minimal sphere of area strictly smaller than 4π and index at most one…

2011-05-23abs ↗pdf ↗

The paper explains how simple methods can converge to optimal solutions in complex neural games.

problem Finding optimal solutions in neural games with non-convex objectives.
method Theoretical framework using hidden convexity and overparameterization, with path-length bounds and PŁ conditions.
result Simple gradient methods can converge to Nash equilibria in non-convex min-max games under certain conditions.

Minimum width for ReLU networks on compact domain is exactly max{d_x, d_y, 2}

problem Characterizing the minimum width for ReLU networks to approximate functions on compact domains
method Analyzing the minimum width for LpL^p approximation of LpL^p functions from [0,1]d[0,1]^d to Rdy\mathbb R^{d_y} using ReLU-like activation functions
result The minimum width for LpL^p approximation on a compact domain is exactly max{d_x, d_y, 2} for ReLU-like activation functions

The paper proves the existence of GG-invariant minimal hypersurfaces on certain Riemannian manifolds.

problem Existence of GG-invariant minimal hypersurfaces on specific Riemannian manifolds.
method Adapted Almgren-Pitts min-max theory to a GG-equivariant version.
result Existence of nontrivial closed smooth embedded GG-invariant minimal hypersurfaces.

Paper proves rigidity of minimal disks in 3-balls with non-negative Ricci curvature.

problem Rigidity of free boundary minimal disks in 3-balls with non-negative Ricci curvature.
method Min-max methods and rigidity statements for half-balls with non-negative Ricci curvature.
result Existence and properties of minimal disks with least area in 3-balls.

Rigidity theorem for critical points of Allen-Cahn equation on S³.

problem Rigidity of critical points with low Morse index on S³.
method Analysis of nullity and symmetries of critical points, Frankel-type theorem for nodal sets.
result Critical points with index five are symmetric and vanish on a Clifford torus, realizing the fifth width of the min-max spectrum.

Adaptive kernels from neural networks improve model performance.

problem Improving neural network performance through adaptive kernels.
method Deriving adaptive kernels from infinite-width neural networks using feature learning and gradient flow training.
result Adaptive kernels achieve lower test loss compared to traditional kernels.

Our work proves convergence to low robust training loss for polynomial width ReLU networks.

problem Understanding why adversarial training leads to low robust training loss in over-parameterized neural nets.
method Extending convergence theory for standard supervised training to adversarial training, using tools from online learning and showing ReLU networks can approximate the step function.
result Convergence to low robust training loss for polynomial width ReLU networks under natural assumptions.

We study global variational properties of the space of solutions to ε2Δu+W(u)=0-\varepsilon^2Δu + W'(u)=0 on any closed Riemannian manifold MM. Our techniques are inspired by recent advances in the variational theory of minimal hypersurfaces and extend a well-known analogy with the theory of phase transitions. First, we show t…

2016-08-23abs ↗pdf ↗

Study on ground states of semilinear elliptic equations with various potential wells.

problem Characterizing ground states of semilinear elliptic equations with arbitrary potential wells.
method Analyzing solutions in convex domains and manifolds with non-negative Ricci curvature, using Morse theory and min-max methods.
result Ground states are mountain-pass type with Morse index 1 in convex domains and manifolds with non-negative Ricci curvature.

We prove that any manifold diffeomorphic to S3S^3 and endowed with a generic metric contains at least two embedded minimal two-spheres. The existence of at least one minimal two-sphere was obtained by Simon-Smith in 1983. Our approach combines ideas from min-max theory and mean curvature flow. We also establish the exi…

2017-08-22abs ↗pdf ↗

Equity-Transformer solves NP-hard min-max routing problems efficiently.

problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.

Adaptive momentum method solves non-convex min-max problems.

problem Non-convex min-max optimization problems in training generative adversarial networks.
method Proposes an adaptive momentum algorithm for non-convex min-max optimization.
result Establishes non-asymptotic convergence rates for the proposed algorithm.

New methods solve min-max problems on manifolds using Riemannian Hamiltonians.

problem Min-max optimization on Riemannian manifolds.
method Riemannian Hamiltonian methods (RHM) to minimize the Hamiltonian function.
result RHM leads to correct search directions and global optimality in min-max problems.