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

8.7%17.4%26.1%34.8% · Jun 199719922001200920172026
48 results for set union

This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…

2016-06-16abs ↗pdf ↗

New algorithms for set union in differential privacy improve efficiency and accuracy.

problem Efficiently discovering items from private user data in natural language processing.
method Developed algorithms that allow users to contribute items in a dependent fashion, guided by a policy with contractive properties.
result New algorithms significantly outperform existing mechanisms in terms of efficiency and accuracy.

Proves lower bounds on Hausdorff dimension of projections of invariant sets.

problem Lower bounds on Hausdorff dimension of projections of invariant sets.
method Transversal property of geodesics, (k+1)(k+1)-linear curved Kakeya estimate, Bourgain-Guth argument.
result Proves a lower bound on the Hausdorff dimension of projections of invariant sets.

The paper defines a preorder on links and explores its implications for symmetric unions.

problem Understanding the relationships between links and their symmetric unions.
method Defining a preorder relation and proving properties of links and their orbifold groups.
result If a link LL is a Montesinos link with r3r \geq 3 rational tangles, then LL' is either a Montesinos link with at most r+1r+1 rational tangles or a certain connected sum.

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

Study of symmetric unions of knots with new inequality and epimorphism results.

problem Understanding the genera of symmetric unions of knots.
method Introduced symmetric unions inspired by earlier work, showed an identity between twisted Alexander polynomials and genera, and established an epimorphism between knot groups.
result Obtained an inequality concerning the genera of symmetric unions and provided a positive answer to an old problem.

We classify the topological types for the unions of the totally geodesic 3-punctured spheres in orientable hyperbolic 3-manifolds. General types of the unions appear in various hyperbolic 3-manifolds. Each of the special types of the unions appears only in a single hyperbolic 3-manifold or Dehn fillings of a single hyp…

2017-08-11abs ↗pdf ↗

The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.

problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.

Study the boundaries of ε-neighborhoods of planar sets, showing their structure and curvature.

problem Understanding the structure and smoothness of boundaries of ε-neighborhoods of planar sets.
method Analyzing the global topological structure and smoothness of boundaries of ε-neighborhoods of compact planar sets.
result The boundary of ε-neighborhoods can be expressed as a disjoint union of Jordan curves and singularities.

The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.

problem Understanding the behavior of convex unions in simplicial pseudomanifolds.
method Generalization to simplicial pseudomanifolds, considering PL homeomorphisms and edge subdivisions.
result Unexpected behavior in convex unions and completions, including empty contraction spaces and large/small contraction spaces.

New method optimizes prediction set volume in conformal prediction.

problem Achieving volume optimality in conformal prediction without sacrificing coverage guarantees.
method Dynamic programming algorithm for finding near-optimal volume unions of k-intervals.
result Efficient algorithm finds unions of k-intervals with near-optimal volume for any distribution.

Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka 50 years ago. It is easy to see that every symmetric union represents a ribbon knot, but the converse is still an open problem. Besides existence it is natural to consider the question of un…

2007-05-31abs ↗pdf ↗

Let two Heegaard splittings V1W1V_1 \cup W_1 and V2W2V_2 \cup W_2 of a 3-manifold MM be given. We consider the union stabilization M=VWM=V \cup W which is a common stabilization of V1W1V_1 \cup W_1 and V2W2V_2 \cup W_2 having the property that V=V1V2V=V_1 \cup V_2. We show that any two Heegaard splittings of a 3-manifold have a uni…

2008-08-05abs ↗pdf ↗

In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model. For segmentation under this model, we de…

2015-12-21abs ↗pdf ↗

Examines insurance market development and similarity post-2004 EU enlargement.

problem Comparing insurance markets of EU old and new members post-enlargement.
method Analyzes data from 2004 to present to compare insurance markets.
result Identifies similarities and differences in insurance markets post-2004 enlargement.

Study shows limits of volume-constrained sets are finite unions of Wulff shapes.

problem Analyzing the behavior of sets with degenerating ellipticity.
method Proving rigidity of L1L^1-accumulation points of volume-constrained almost-critical sets.
result Limits of volume-constrained sets are finite unions of φφ-Wulff shapes.

Let FgF_g denote a closed oriented surface of genus gg. A set of simple closed curves is called a filling of FgF_g if its complement is a disjoint union of discs. The mapping class group Mod(Fg)\text{Mod}(F_g) of genus gg acts on the set of fillings of FgF_g. The union of the curves in a filling forms a graph on the surfa…

2015-03-16abs ↗pdf ↗

For an infinite cardinal κκ let 2(κ)\ell_2(κ) be the linear hull of the standard othonormal base of the Hilbert space 2(κ)\ell_2(κ) of density κκ. We prove that a non-separable convex subset XX of density κκ in a locally convex linear metric space if homeomorphic to the space (i) 2f(κ)\ell_2^f(κ) if and only if XX can be…

2013-05-07abs ↗pdf ↗

New theorem shows shapes close to balls, flow converges to balls in 2D and 3D.

problem Understanding the asymptotic behavior of volume-preserving mean curvature flow.
method Proved a new quantitative Alexandrov theorem and used it to show flow convergence.
result Weak solutions of volume-preserving mean curvature flow converge to disjoint balls in R^2 and R^3.

Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same subspace must be identified in order to obtain accurate estimates of the subspace s…

2013-03-19abs ↗pdf ↗

An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm investigated the latter question by introducing a notion of symmetric equivalence…

2018-04-24abs ↗pdf ↗

Study flat flow solutions to Mullins-Sekerka and area-preserving curvature flows on planar flat torus.

problem Behavior of flat flow solutions on planar flat torus.
method Sharp quantitative Alexandrov inequality derivation for periodic smooth sets.
result Flat flows converge to specific configurations exponentially fast.

Extended symmetric union with multiple tangle regions and Alexander polynomial properties.

problem Characterizing knots with multiple tangle regions.
method Generalizing the symmetric union construction to include multiple tangle regions and analyzing the Alexander polynomial.
result The Alexander polynomial of the constructed knot is the product of the Alexander polynomials of the tangles and the square of the partial knot's Alexander polynomial.

Three disjoint rays in euclidean 3-space form Borromean rays provided their union is knotted, but the union of any two components is unknotted. We construct infinitely many Borromean rays, uncountably many of which are pairwise inequivalent. We obtain uncountably many Borromean hyperplanes.

2012-11-27abs ↗pdf ↗

In various situations in Floer theory, one extracts homological invariants from "Morse-Bott" data in which the "critical set" is a union of manifolds, and the moduli spaces of "flow lines" have evaluation maps taking values in the critical set. This requires a mix of analytic arguments (establishing properties of the m…

2017-11-27abs ↗pdf ↗

We study Cohen-Macaulay actions, a class of torus actions on manifolds, possibly without fixed points, which generalizes and has analogous properties as equivariantly formal actions. Their equivariant cohomology algebras are computable in the sense that a Chang-Skjelbred Lemma, and its stronger version, the exactness o…

2009-12-03abs ↗pdf ↗

The paper improves support recovery in high-dimensional precision matrix estimation using meta learning.

problem Support recovery in high-dimensional precision matrix estimation with reduced sample complexity.
method Pooling samples from different tasks and using an improper 1\ell_1-regularized log-determinant Bregman divergence to estimate a single precision matrix.
result The support of the improperly estimated single precision matrix is equal to the true support union with high probability.

CITE algorithm provides anytime-valid certification of model outputs.

problem Challenges in controlling error levels in LLM self-consistency.
method Certification by Intersection-union Testing with E-processes (CITE) algorithm.
result Provable control of false certification at any prescribed level under arbitrary stopping rules.

For an orientable surface SS of finite topological type with genus g3g \geq 3, we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of SS. The set constructed, and the method of rigid expansion, are closely related to Aramayona and Leiniger's finite rigid set, and in fact a …

2016-11-23abs ↗pdf ↗

We consider the "partial information decomposition" (PID) problem, which aims to decompose the information that a set of source random variables provide about a target random variable into separate redundant, synergistic, union, and unique components. In the first part of this paper, we propose a general framework for …

2019-08-23abs ↗pdf ↗