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.

169,291 papers · 148 categories

Trend · papers per month

75150225300 · Jun 202019922001200920182026
48 results for minimal configurations

We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of minimal configurations not realized by geodesics in any hyperbolic metric.

1999-03-22abs ↗pdf ↗

Solves Plateau-Douglas problem for singular configurations in general metric spaces.

problem Existence of minimal surfaces for singular configurations.
method Generalized approach via minimal sequences in metric spaces.
result Existence of minimal surfaces for singular configurations in general metric spaces.

The study finds optimal minimum distances for Green's energy points on compact manifolds.

problem Finding optimal minimum distances for Green's energy points on compact Riemannian manifolds.
method Analyzing point configurations minimizing discrete energy with the Green's function for the Laplacian.
result Every point in a minimizing configuration lies inside a harmonic ball, and the minimum distance has optimal asymptotic order.

Minimal non-arithmetic hyperbolic 3-orbifold found with least volume.

problem Finding the hyperbolic 3-orbifold with minimal volume among non-arithmetic ones.
method Utilized the tetrahedral Coxeter group and horoball configuration to prove minimal volume.
result The 1-cusped quotient of hyperbolic space by the tetrahedral Coxeter group has minimal volume.

Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the number of intersections along them.

2001-06-24abs ↗pdf ↗

Researchers find optimal configurations of complex knots and links.

problem Finding the most efficient configurations of complex knots and links.
method Minimizing Möbius and Minimum Distance energies by describing them with a small number of free parameters.
result Optimal geometries for Hopf links, Borromean rings, and chain links are found.

When using Traizet's regeneration technique to construct minimal surfaces, the simplest nontrivial configurations are given as the roots of polynomials that satisfy a hypergeometric differential equation. We exhibit examples of simple minimal surfaces exhibiting the same behavior.

2016-02-17abs ↗pdf ↗

Smectic liquid crystals are materials formed by stacking deformable, fluid layers. Though smectics prefer to have flat, uniformly-spaced layers, boundary conditions can impose curvature on the layers. Since the layer spacing and curvature are intertwined, the problem of finding minimal configurations for the layers bec…

2006-01-20abs ↗pdf ↗

Two surfaces minimize variance of Gaussian curvature.

problem Minimizing the variance of Gaussian curvature on triply periodic minimal surfaces.
method Interpreting branch values of Gauss map, expressing variance as integrals of exponentials of Green's functions, analyzing Hessian.
result The P and D surfaces are local minimizers of the variance of Gaussian curvature.

Researchers analyze geodesic complexity in robot paths on tree graphs.

problem Understanding optimal paths for robots on tree graphs.
method Examined geodesic complexity in ordered and unordered configuration spaces of graphs in 1\ell_1 and 2\ell_2 metrics, finding explicit geodesics and families.
result Geodesic complexity matches topological complexity in all cases studied.

Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…

2012-12-19abs ↗pdf ↗

Bayesian optimization (BO) aims to minimize a given blackbox function using a model that is updated whenever new evidence about the function becomes available. Here, we address the problem of BO under partially right-censored response data, where in some evaluations we only obtain a lower bound on the function value. T…

2013-10-07abs ↗pdf ↗

Kernel-based algorithm optimizes cellular network configuration through multi-task learning.

problem Optimizing network configuration based on field experience and minimizing exploration cost.
method Kernel-based multi-BS contextual bandit algorithm leveraging conditional kernel embedding for multi-task learning.
result The proposed algorithm reduces exploration cost and improves network performance.

The paper proves the openness of K-semistability for Fano varieties.

problem Stability of K-semistability in families of log Fano pairs.
method By showing the stability threshold is a constructible function and proving special test configurations arise from log canonical places.
result The stability threshold is a constructible function on fibers, and any minimizer of the stability threshold exists.

In this note we complete the discussion of minimality of symplectic fiber sums. We find, that for fiber sums along spheres the minimality of the sum is determined by the cases discussed by M. Usher and one additional case: If the sum is the result of the rational blow-down of a symplectic -4-sphere in X, then it is non…

2010-05-06abs ↗pdf ↗

For any flat projective family $(\mX,\mL)\rightarrow C$ such that the generic fibre $\mX_η$ is a klt Q-Fano variety and $\mL|_{\mX_η}\sim_{Q}-K_{X_η}$, we use the techniques from the minimal model program (MMP) to modify the total family. The end product is a family such that every fiber is a klt Q-Fano variety. Moreov…

2011-11-23abs ↗pdf ↗

We study a recent general criterion for the injectivity of the conformal immersion of a Riemannian manifold into higher dimensional Euclidean space, and show how it gives rise to important conditions for Weierstrass-Ennerper lifts defined in the unit disk D\mathbb{D} endowed with a conformal metric. Among the corollar…

2015-08-03abs ↗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 disproves compactness for high-energy Willmore immersions and finds minimal bubbles on Willmore surfaces.

problem Compactness for high-energy Willmore immersions of Willmore energy above 16π16\pi.
method Explicit construction of minimal bubbles and analysis of limit sequences of Willmore immersions.
result Compactness for immersed Willmore tori of energy below 12π12\pi is proven.

In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, it is the minimal number k such that there are k different motion planning rules,…

2001-11-18abs ↗pdf ↗

BONSAI optimizes parameters while respecting a default configuration, reducing unnecessary changes.

problem Standard BO pushes weakly relevant parameters to the boundary, making it hard to distinguish between important and spurious changes.
method BONSAI is a default-aware BO policy that prunes low-impact deviations from a default configuration while controlling acquisition value loss.
result BONSAI matches the GP-UCB regret rate while recovering the minimal-0\ell_0 solution, reducing the number of non-default parameters in recommended configurations.

Study of convergence of point-object configurations to a charged dust continuum.

problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.

In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy …

2004-02-13abs ↗pdf ↗

Study finds minimal length networks connecting three points in Heisenberg group.

problem Finding minimal length networks connecting three points in the Heisenberg group.
method Proved existence of minimal horizontal triods, formulated curve shortening flow, used numerical experiments.
result Characterized and deformed minimal horizontal triods into critical points for length functional.

We consider a generic configuration of regions, consisting of a collection of distinct compact regions {Ωi}\{Ω_i\} in Rn+1\mathbb{R}^{n+1} which may be either smooth regions disjoint from the others or regions which meet on their piecewise smooth boundaries Bi\mathcal{B}_i in a generic way. We introduce a skeletal linking …

2014-02-22abs ↗pdf ↗

This paper details a series of experiments in searching for minimal energy configurations for knots and links using the computer program KnotPlot. The most interesting phenomena found in these experiments is the dependence of the trajectories of energy descent upon the initial geometric conditions of the knotted embedd…

2012-02-10abs ↗pdf ↗

Most known examples of doubly periodic minimal surfaces in R3\mathbb{R}^3 with parallel ends limit as a foliation of R3\mathbb{R}^3 by horizontal noded planes, with the location of the nodes satisfying a set of balance equations. Conversely, for each set of points providing a balanced configuration, there is a correspo…

2016-04-26abs ↗pdf ↗

Constructs classifiers for neural networks with specific data configurations.

problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.

We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in Rn\mathbb{R}^n. Besides identifying a condition on the structure of the domain which ensures the existence of minimizing configurations, we describe the structure of such minima, as well as their regularity…

2015-05-04abs ↗pdf ↗

Positive configurations of points in the affine building were introduced in \cite{Le} as the basic object needed to define higher laminations. We start by giving a self-contained, elementary definition of positive configurations of points in the affine building and their basic properties. Then we study the geometry of …

2015-10-31abs ↗pdf ↗

We derive a dimensionally-reduced limit theory for an nn-dimensional nonlinear elastic body that is slender along kk dimensions. The starting point is to view an elastic body as an nn-dimensional Riemannian manifold together with a not necessarily isometric W1,2W^{1,2}-immersion in nn-dimensional Euclidean space. The…

2012-01-17abs ↗pdf ↗

Framework optimizes expensive manufacturing processes efficiently.

problem Optimizing input parameters for advanced manufacturing methods.
method Bayesian optimization with tailored acquisition function and parallel acquisition.
result Framework efficiently finds optimal parameters with minimal process cost.