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

Trend · papers per month

199397596794 · Jun 202019922001200920182026
48 results for Levi-flat sets

We focus on the topology and dynamics of minimal sets and Levi-flats in surfaces of general type. Our method relies on the ergodic theory of Riemann surfaces laminations: we use harmonic measures and Lyapunov exponents. Our first result establishes that minimal sets have large Hausdorff dimension when a leaf is simply …

2012-03-28abs ↗pdf ↗

New condition extends Diederich-Fornæss index for pseudoconvex domains.

problem Determine sufficient conditions for Diederich-Fornæss index to be close to 1.
method Derive sufficient condition on Levi-flat sets of the boundary.
result Diederich-Fornæss index is 1 if Levi-flat sets are transversal to holomorphic tangent vector fields.

The paper constructs Levi flat structures using structure sheaves and differential complexes.

problem Global solvability and regularity of Levi flat structures.
method Employing formal integrability and differential complexes, the paper constructs a resolution for the structure sheaf.
result Global exactness and Sobolev regularity of the differential complex for Levi flat structures.

New result on Levi-flat hypersurfaces' normal bundles without positive curvature.

problem Understanding Levi-flat hypersurfaces' normal bundles and their curvature properties.
method Analyzing the normal bundle of Levi-flat real hypersurfaces in complex manifolds.
result The normal bundle to the Levi foliation does not admit a Hermitian metric with positive curvature.

Generalizes Dolbeault cohomology computation to Levi-flat CR structures on compact Lie groups.

problem Computing Dolbeault cohomology for Levi-flat CR structures on compact Lie groups.
method Algebraic classification of left-invariant CR structures combined with Pittie's result on compact Lie groups.
result Generalization of Dolbeault cohomology computation to Levi-flat CR structures.

Local conditions on boundaries of CC^\infty Levi-flat hypersurfaces, in case the boundary is a generic submanifold, are studied. For nontrivial real analytic boundaries we get an extension and uniqueness result, which forces the hypersurface to be real analytic. This allows us to classify all real analytic generic bou…

2006-12-03abs ↗pdf ↗

A local uniqueness property of holomorphic functions on real-analytic nowhere minimal CR submanifolds of higher codimension is investigated. A sufficient condition called almost minimality is given and studied. A weaker necessary condition, being contained a possibly singular real-analytic Levi-flat hypersurface is stu…

2006-06-06abs ↗pdf ↗

We address the problem of existence and uniqueness of a Levi-flat hypersurface MM in CnC^n with prescribed compact boundary SS for n3n\ge3. The situation for n3n\ge3 differs sharply from the well studied case n=2n=2. We first establish necessary conditions on SS at both complex and CR points, needed for the existence…

2009-04-02abs ↗pdf ↗

Study relationships between submanifolds and ambient Kahler 4-manifolds' fundamental groups.

problem Relationships between submanifolds and fundamental groups of Kahler 4-manifolds.
method Analyzes fundamental groups of embedded Levi-flat or pseudoconvex submanifolds in Kahler 4-manifolds.
result Fundamental group of M4M^4 determined by the fundamental group of compact embedded Levi-flat or pseudoconvex submanifolds.

Let ΩΩ be a pseudoconvex domain with C2C^2-smooth boundary in CPn\mathbb CP^n. We prove that the ˉNeumannoperator\bar\partial-Neumann operator Nexistsfor exists for (p,q)formson-forms on Ω.Furthermore,thereexistsa. Furthermore, there exists a t_0>0suchthattheoperators such that the operators N,, \bar\partial^*N,, \bar\partial N$ and the Bergman projection are regular in the Sobolev …

2003-05-14abs ↗pdf ↗

Paper constructs solutions for a class of overdetermined systems.

problem Constructing solutions for a class of overdetermined systems.
method Resolution of the solution sheaf, sufficient condition for global exactness, gluing techniques, local solvability of the Treves complex.
result Obtained a sufficient condition for global exactness, leading to gluing techniques for local solutions.

The purpose of this article is to classify the real hypersurfaces in complex space forms of dimension 2 that are both Levi-flat and minimal. The main results are as follows: When the curvature of the complex space form is nonzero, there is a 1-parameter family of such hypersurfaces. Specifically, for each one-parameter…

1999-09-27abs ↗pdf ↗

We establish a version of the complex Frobenius theorem in the context of a complex subbundle S of the complexified tangent bundle of a manifold, having minimal regularity. If the subbundle S defines the structure of a Levi-flat CR-manifold, it suffices that S be Lipschitz for our results to apply. A principal tool in …

2007-10-11abs ↗pdf ↗

The paper establishes boundary estimates for solutions to elliptic equations on Hermitian manifolds.

problem Boundary estimates for solutions to fully non-linear elliptic equations on Hermitian manifolds.
method Unified approach using quantitative boundary estimates, gradient estimates, and existence results.
result Established gradient estimates and unified approach to Dirichlet problem solutions.

New deep learning model for matching sets of items, preserving exchangeability.

problem Matching two different sets of items while preserving exchangeability.
method Exchangeable deep neural networks architecture and efficient training framework.
result Significant improvements in fashion set recommendation and group re-identification.

New set type with no uniformly perfect subsets.

problem Understanding compact sets without uniformly perfect subsets.
method Introduced hereditarily non uniformly perfect sets and compared them with other types of sets.
result Example of a compact set with Hausdorff dimension 2 and positive logarithmic capacity is hereditarily non uniformly perfect.

The paper analyzes set-to-set matching with neural networks, focusing on theoretical generalization.

problem Theoretical analysis of set-to-set matching with neural networks.
method Generalization error analysis of set-to-set matching with neural networks.
result Theoretical insights into the behavior of set-to-set matching models.

Generative model learns to autoencode and generate sets of images.

problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.

Maps sets to probability distributions to minimize information loss.

problem Learning to map sets to probability distributions to preserve information.
method Relates set operations to probability distribution interpolations and demonstrates a preliminary solution.
result Experimental results show the effectiveness of the set embedding approach.

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.

Bayesian optimization for set inputs using approximate set kernels.

problem Permutation-invariant optimization over sets with black-box functions.
method Developed a Bayesian optimization method with set kernel, efficient approximate set kernel, and constrained acquisition function.
result Our method outperforms other methods in numerical experiments.

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.

Deep Sets approximates functions on sets with high-dimensional latent space.

problem Modeling functions of sets (permutation-invariant functions).
method Deep Sets, a method known to be a universal approximator for continuous set functions.
result Deep Sets' universal approximation property is only guaranteed with a sufficiently high-dimensional latent space.

Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.

problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.

A stability-based method selects the most desirable conformal prediction set.

problem Selecting the most desirable conformal prediction set from multiple valid sets invalidates coverage guarantees.
method A stability-based approach that ensures coverage for the selected prediction set.
result The stability-based approach maintains coverage guarantees for the selected prediction set.

This work establishes properties on diffeological structures for set-valued maps and measures.

problem Establish rigorous properties on diffeological structures for set-valued maps and measures.
method Using diffeologies, the authors link various structures including set-valued maps, relations, gradients, measures, and shape analysis.
result Established rigorous properties on sample diffeologies.

MAGIC generates image collages from set templates using attention and set representations.

problem Generating image collages from set templates is challenging for classical models.
method Memory Attentive Generation of Image Collages (MAGIC) using Set-Transformer layers and set-pooling.
result MAGIC can generate image collages from set templates in one forward pass.