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

Trend · papers per month

9192837 · Oct 201919922001200920172026
48 results for Hausdorff content

The study bounds Hausdorff measure of flat singular points in area-minimizing currents.

problem Bounding Hausdorff measure of flat singular points in area-minimizing currents.
method Proving locally finite (m2)(m-2)-dimensional Hausdorff measure and Minkowski content bounds.
result The set of flat singular points has locally finite (m2)(m-2)-dimensional Hausdorff measure.

We prove a new version of isoperimetric inequality: Given a positive real mm, a Banach space BB, a closed subset YY of metric space XX and a continuous map f:YBf:Y \rightarrow B with f(Y)f(Y) compact infFHCm+1(F(X))c(m)HCm(f(Y))m+1m,\inf_FHC_{m+1}(F(X))\leq c(m)HC_m(f(Y))^{\frac{m+1}{m}}, where HCmHC_m denotes the mm-dimensional Hausdorff content,…

2019-05-16abs ↗pdf ↗

The paper proves a theorem linking ball volume and Uryson width, with applications to 3-sphere metrics.

problem Relating volume of balls to Uryson width and Hausdorff content.
method Short proof and generalization of Guth's theorem, using Riemannian metrics and map diameter constraints.
result For any C>0C>0, there exists a 3-sphere metric with volume 1 and a map violating diameter constraints.

Perturbs area-minimizing hypersurfaces to reduce singular set's dimension.

problem Reduces the dimension of the singular set of area-minimizing hypersurfaces.
method Perturbs a smooth hypersurface to minimize the Minkowski dimension of the singular set.
result The singular set of the perturbed minimizing current has Minkowski dimension less than n-9.

We prove a version of the implicit function theorem for Lipschitz mappings f:Rn+mAXf:\mathbb{R}^{n+m}\supset A \to X into arbitrary metric spaces. As long as the pull-back of the Hausdorff content Hn\mathcal{H}_{\infty}^n by ff has positive upper nn-density on a set of positive Lebesgue measure, then, there is a local diff…

2018-09-18abs ↗pdf ↗

In this work we prove convergence results of sequences of Riemannian 44-manifolds with almost vanishing L2L^2-norm of a curvature tensor and a non-collapsing bound on the volume of small balls. In Theorem 1.1, we consider a sequence of closed Riemannian 44-manifolds, whose L2L^2-norm of the Riemannian curvature tenso…

2017-10-25abs ↗pdf ↗

This paper introduces Hausdorff measure and its applications in fractal geometry.

problem Defining and applying Hausdorff measure to fractal geometry.
method Definition of Hausdorff outer measure, Caratheodory's criterion, construction of Hausdorff measure, and introduction of Hausdorff dimension.
result Demonstrates the Hausdorff dimension of the Cantor ternary set.

Study of one-dimensional non-Hausdorff manifolds and their quotient to CW complexes.

problem Understanding and characterizing one-dimensional non-Hausdorff manifolds.
method Analyzing properties of connected non-Hausdorff manifolds and their quotient spaces to CW complexes.
result Existence of a quotient map from a connected non-Hausdorff manifold to an open one-dimensional CW complex.

Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.

problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.

Proposes a VAE variant for ordinal content factors.

problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.

Study of Calabi-Yau metrics on converging manifolds, resolving conjectures.

problem Understanding Calabi-Yau metrics on converging manifolds.
method Analysis of Gromov-Hausdorff limits of metrics on Calabi-Yau fibrations.
result Gromov-Hausdorff limit is homeomorphic to the base of the fibration and discriminant locus has high Hausdorff codimension.

The paper classifies Kleinian groups with Hausdorff dimension less than 1.

problem Classifying Kleinian groups with specific Hausdorff dimensions.
method Using Hou's result, the paper proves that all convex cocompact Kleinian groups of Hausdorff dimension less than 1 are Schottky groups.
result The classification of convex cocompact Kleinian groups of Hausdorff dimensions less than 1.

Upper bound for Hausdorff distance between hyperbolic space and its medianization.

problem Calculating the Hausdorff distance between hyperbolic space and its medianization.
method Using de Sitter space to model finite-dimensional hyperbolic space and its medianization, calculating the Hausdorff distance.
result An upper bound for the Hausdorff distance between hyperbolic space and its medianization is calculated.

Many businesses are using recommender systems for marketing outreach. Recommendation algorithms can be either based on content or driven by collaborative filtering. We study different ways to incorporate content information directly into the matrix factorization approach of collaborative filtering. These content-booste…

2012-10-20abs ↗pdf ↗

New Hausdorff integrations for Lie algebroids and symplectic groupoids.

problem Integrating Lie algebroids and symplectic groupoids.
method Hausdorff versions of Lie Integration Theorems 1 and 2, Lie equivalences, and algebraic approach to holonomy.
result Generalization of integration of subalgebroids to non-wide cases and detailed exploration of foliation groupoids.

Given a solution uu to a linear homogeneous second order elliptic equation with Lipschitz coefficients, we introduce techniques for giving improved estimates of the critical set $\Cr(u)\equiv \{x:|\nabla u|(x)=0\}$. The results are new even for harmonic functions on $\dR^n$. Given such a uu, the standard {\it first o…

2012-07-17abs ↗pdf ↗

In 1948 Feynman introduced functional integration. Long ago the problematic aspect of measures in the space of fields was overcome with the introduction of volume elements in Probability Space, leading to stochastic formulations. More recently Cartier and DeWitt-Morette focused on the definition of a proper integration…

2018-12-10abs ↗pdf ↗

A new model considers fatigue in online content recommendation systems.

problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.

New PCGML approach generates novel game content across multiple platformer domains.

problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.

We consider visual domains in which a class label specifies the content of an image, and class-irrelevant properties that differentiate instances constitute the style. We present a domain-independent method that permits the open-ended recombination of style of one image with the content of another. Open ended simply me…

2018-09-28abs ↗pdf ↗

New study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.

Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…

2018-10-15abs ↗pdf ↗

Study on heat content for submanifolds in sub-Riemannian geometry.

problem Understanding heat content for submanifolds in sub-Riemannian geometry.
method Existence of smooth tubular neighborhood, definition of relative heat content, approximation via smooth neighborhoods, asymptotic expansion analysis.
result Approximation of relative heat content fails to recover the exact expansion.

Study on Hausdorff dimension of Anosov subgroup limit sets under specific affine complexity.

problem Investigating the Hausdorff dimension of Anosov subgroup limit sets with self-affine complexity.
method Analyzing the Hausdorff dimension of projective limit sets Λ1(Γ)Λ^1(Γ) of Anosov subgroups ΓΓ under specific assumptions about their affine complexity.
result The Hausdorff dimension of Λ1(Γ)Λ^1(Γ) is determined by the critical exponent of the first simple root under partial quasi-self-similarity.

This work improves disentanglement by preventing style variables from encoding content-related features.

problem Disentanglement of content and style in data representations using Variational Autoencoders.
method Adversarial training with mutual information minimization to prevent content information leakage in style representations.
result The method efficiently separates content and style related attributes and generalizes to unseen data.