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

Trend · papers per month

336699132 · May 202619922001200920172026
48 results for max-intersection completeness

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.

We prove that the supergravity r- and c-maps preserve completeness. As a consequence, any component H of a hypersurface {h=1} defined by a homogeneous cubic polynomial such that -d^2 h is a complete Riemannian metric on H defines a complete projective special Kahler manifold and any complete projective special Kahler m…

2011-01-26abs ↗pdf ↗

Completeness of surface metrics established for Sobolev spaces.

problem Ensuring completeness of reparametrization-invariant Sobolev metrics on surface spaces.
method Recasting completeness criteria for infinite-dimensional Riemannian manifolds and applying geometric estimates based on the Michael--Simon--Sobolev inequality.
result Established metric and geodesic completeness for specific Sobolev metrics on immersed surfaces, validating Mumford's conjecture.

Study disproves conjecture about metric completion of curve spaces.

problem Completeness properties of spaces of immersed curves with reparametrization-invariant metrics.
method Examined Sobolev-type metrics on real-valued immersed curves, demonstrating multiple distinct limit points.
result Metric completion of spaces of immersed open curves includes multiple distinct limit points, not a single point as previously conjectured.

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.

The first examples of complete projective connections are uncovered: normal projective connections on surfaces whose geodesics are all closed and embedded are complete, as are normal projective connections induced from complete affine connections with slowly decaying positive Ricci curvature.

2005-04-05abs ↗pdf ↗

We prove uniqueness of instantaneously complete Ricci flows on surfaces. We do not require any bounds of any form on the curvature or its growth at infinity, nor on the metric or its growth (other than that implied by instantaneous completeness). Coupled with earlier work, particularly [23, 11], this completes the well…

2013-05-08abs ↗pdf ↗

A very simple interpretation of matrix completion problem is introduced based on statistical models. Combined with the well-known results from missing data analysis, such interpretation indicates that matrix completion is still a valid and principled estimation procedure even without the missing completely at random (M…

2016-05-10abs ↗pdf ↗

Study complete gradient Ricci solitons with zero radial Weyl curvature.

problem Characterize complete gradient Ricci solitons with specific curvature properties.
method Classify complete gradient Ricci solitons with zero radial Weyl curvature for dimensions n4n \geq 4.
result Completely classified complete gradient Ricci solitons with zero radial Weyl curvature.

Type A surfaces are the locally homogeneous affine surfaces which can be locally described by constant Christoffel symbols. We address the issue of the geodesic completeness of these surfaces: we show that some models for Type A surfaces are geodesically complete, that some others admit an incomplete geodesic but model…

2016-11-03abs ↗pdf ↗

We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More s…

2012-11-17abs ↗pdf ↗

Complete shrinking soliton found on a specific complex surface.

problem Classifying complete shrinking gradient Kähler-Ricci solitons in two complex dimensions.
method Proved existence of a unique soliton with bounded scalar curvature on a specific blowup.
result Complete classification of such solitons in two complex dimensions.

Unified framework for nonconvex matrix completion with linearly parameterized factors.

problem Matrix completion with improved accuracy using linearly parameterized factors.
method Unified nonconvex optimization framework with Correlated Parametric Factorization condition.
result Uniform upper bounds for low-rank estimation at any local minimum.

Ancient solutions to Kähler Ricci flow classified completely.

problem Ancient solutions to Kähler Ricci flow with nonnegative bisectional curvature.
method Complete classification of κ-noncollapsed, complete ancient solutions.
result Classification of all ancient solutions to Kähler Ricci flow with nonnegative bisectional curvature.

Constructs complete Calabi-Yau metrics from smoothed Calabi-Yau intersections.

problem Creating complete Calabi-Yau metrics on non-compact manifolds.
method Extending Székelyhidi's work, constructing metrics with varying complex structures and possible singularities.
result Produces Calabi-Yau metrics with fibers having varying complex structures and possibly isolated singularities.

JULIA combines multi-linear and nonlinear models for tensor completion.

problem Complex patterns in real-world tensors require a unified model.
method JULIA unifies multi-linear and nonlinear models with flexible component assignment and efficient alternating optimization.
result JULIA outperforms existing methods in large-scale tensor completion.

Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining, computer…

2017-11-28abs ↗pdf ↗

Paper explores robustness of CCS model for matrix completion.

problem Robustness of cross-concentrated sampling model against sparse outliers.
method Proposes Robust CUR Completion (RCURC) algorithm for efficient non-convex iterative matrix completion.
result Empirical validation of RCURC's efficiency and robustness in synthetic and real datasets.

The purpose of this paper is to study complete λλ-surfaces in Euclidean space R3\mathbb R^3. A complete classification for 2-dimensional complete λλ-surfaces in Euclidean space R3\mathbb R^3 with constant squared norm of the second fundamental form is given.

2018-07-18abs ↗pdf ↗

The paper extends completeness notions to low-regularity spacetimes.

problem Defining completeness conditions for spacetimes with low-regularity metrics.
method Extending Beem's completeness notions to Lorentzian length spaces and proving relationships between them.
result Equivalence of completeness conditions for globally hyperbolic C1C^{1}-spacetimes under certain conditions.

The paper finds diffeomorphic complex intersections with distinct Hodge numbers.

problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.

The study extends stochastic completeness to landmark spaces with any number of landmarks.

problem Stochastic completeness for landmark spaces with arbitrary numbers of landmarks.
method Volume growth criterion and eigenvalue bounds for geodesic balls.
result Stochastic completeness for landmark spaces with any number of landmarks is proven.

Study on completeness of foliations and null Killing fields in Lorentzian manifolds.

problem Completeness of foliations and null Killing fields in Lorentzian manifolds.
method Analyzes different geometric settings and conditions for completeness, including totally geodesic lightlike foliations and specific affine structures.
result Characterizes completeness for null Killing fields and specific affine structures, and provides non-complete examples.

Study biderivations in complete Leibniz algebras, extending Lie algebra results.

problem Defining and studying biderivations in complete Leibniz algebras.
method Analyze biderivations according to two definitions, provide conditions for biderivations, and compare symmetric and skew-symmetric biderivations.
result Necessary and sufficient conditions for biderivations in Leibniz algebras are provided.

This paper is concerned with the completeness (with respect to the centroaffine metric) of hyperbolic centroaffine hypersurfaces which are closed in the ambient vector space. We show that completeness holds under generic regularity conditions on the boundary of the convex cone generated by the hypersurface. The main re…

2014-07-11abs ↗pdf ↗

In this paper we consider completed coverings that are branched coverings in the sense of Fox. For completed coverings between PL manifolds we give a characterization of the existence of a monodromy representation and the existence of a locally compact monodromy representation. These results stem from a characterizatio…

2014-06-25abs ↗pdf ↗

The purpose of this paper is to study complete self-shrinkers of mean curvature flow in Euclidean spaces. In the paper, we give a complete classification for 2-dimensional complete Lagrangian self-shrinkers in Euclidean space R4\mathbb R^4 with constant squared norm of the second fundamental form.

2018-02-07abs ↗pdf ↗