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

61122182243 · Jun 202019922001200920172026
48 results for Hartogs domains

Extends polydisk theorem to Hartogs domains over symmetric domains.

problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.

The Cartan-Hartogs domains are defined as a class of Hartogs type domains over irreducible bounded symmetric domains. For a Cartan-Hartogs domain ΩB(μ)Ω^{B}(μ) endowed with the natural Kähler metric g(μ),g(μ), Zedda conjectured that the coefficient a2a_2 of the Rawnsley's ε\varepsilon-function expansion for the Cartan-Harto…

2017-06-29abs ↗pdf ↗

The Fock-Bargmann-Hartogs domain Dn,m(μ)D_{n,m}(μ) (μ>0μ>0) in Cn+m\mathbf{C}^{n+m} is defined by the inequality w2<eμz2,\|w\|^2<e^{-μ\|z\|^2}, where (z,w)Cn×Cm(z,w)\in \mathbf{C}^n\times \mathbf{C}^m, which is an unbounded non-hyperbolic domain in Cn+m\mathbf{C}^{n+m}. Recently, Yamamori gave an explicit formula for the Bergman kernel of the…

2014-12-11abs ↗pdf ↗

The Cartan-Hartogs domains are defined as a class of Hartogs type domains over irreducible bounded symmetric domains. The purpose of this paper is twofold. Firstly, for a Cartan-Hartogs domain ΩBd0(μ)Ω^{B^{d_0}}(μ) endowed with the canonical metric g(μ)g(μ), we obtain an explicit formula for the Bergman kernel of the weighted…

2014-03-31abs ↗pdf ↗

Inspired by the work of Z. Lu and G. Tian [21] in the compact setting, in this paper we address the problem of studying the Szegö kernel of the disk bundle over a noncompact Kähler manifold. In particular we compute the Szegö kernel of the disk bundle over a Cartan-Hartogs domain based on a bounded symmetric domain. Th…

2014-10-06abs ↗pdf ↗

Rigidity theorem for Bergman metric on Hartogs domains over bounded homogeneous domains.

problem Proving rigidity of Bergman metric on Hartogs domains.
method Combining explicit formula for Bergman kernel and structural invariants of bounded homogeneous base.
result Conditions for Bergman metric to be Kähler-Einstein, homogeneous, and biholomorphic to Bn+m\mathbb B^{n+m} are equivalent.

An nn-dimensional Hartogs domain DFD_F with strongly pseudoconvex boundary can be equipped with a natural \K metric gFg_F. In this paper we prove that if gFg_F is an extremal \K metric then (DF,gF)(D_F, g_F) is biholomorphically isometric to the nn-dimensional complex hyperbolic space.

2007-05-15abs ↗pdf ↗

The Fock-Bargmann-Hartogs domain Dn,mD_{n,m} in Cn+m\mathbb{C}^{n+m} is defined by the inequality w2<ez2,\|w\|^2<e^{-\|z\|^2}, where (z,w)Cn×Cm(z,w)\in \mathbb{C}^n\times \mathbb{C}^m, which is an unbounded non-hyperbolic domain in Cn+m\mathbb{C}^{n+m}. This paper mainly consists of three parts. Firstly, we give the explicit expression o…

2018-12-18abs ↗pdf ↗

In this paper we address two problems concerning a family of domains $M_Ω(μ) \subset \C^n$, called Cartan-Hartogs domains, endowed with a natural Kaehler metric g(μ)g(μ). The first one is determining when the metric g(μ)g(μ) is extremal (in the sense of Calabi), while the second one studies when the coefficient a2a_2 in th…

2011-04-29abs ↗pdf ↗

An n-dimensional strictly pseudoconvex Hartogs domain D_F can be equipped with a natural Kaehler metric g_F. In this paper we prove that if m_0g_F is balanced for a given positive integer m_0 then m_0>n and (D_F, g_F) is holomorphically isometric to an open subset of the n-dimensional complex hyperbolic space.

2010-09-21abs ↗pdf ↗

100 years ago exactly, in 1906, Hartogs published a celebrated extension phenomenon (birth of Several Complex Variables), whose global counterpart was stated in full generality later by Osgood (1929): holomorphic functions in a connected neighborhood V(bD) of a connected boundary bD contained in C^n (n >= 2) do extend …

2006-10-31abs ↗pdf ↗

This paper consists of two results dealing with balanced metrics (in S. Donaldson terminology) on nonconpact complex manifolds. In the first one we describe all balanced metrics on Cartan domains. In the second one we show that the only Cartan-Hartogs domain which admits a balanced metric is the complex hyperbolic spac…

2010-10-05abs ↗pdf ↗

An nn-dimensional Hartogs domain DFD_F with strongly pseudoconvex boundary can be equipped with a natural Kaehler metric gFg_F. This paper contains two results. In the first one we prove that if gFg_F is an extremal Kaehler metric then (DF,gF)(D_F, g_F) is holomorphically isometric to an open subset of the nn-dimensional …

2008-05-09abs ↗pdf ↗

The Fock-Bargmann-Hartogs domain Dn,m(μ)D_{n,m}(μ) (μ>0μ>0) in Cn+m\mathbb{C}^{n+m} is defined by the inequality w2<eμz2,\|w\|^2<e^{-μ\|z\|^2}, where (z,w)Cn×Cm(z,w)\in \mathbb{C}^n\times \mathbb{C}^m, which is an unbounded non-hyperbolic domain in Cn+m\mathbb{C}^{n+m}. This paper introduces a Kähler metric αg(μ;ν)αg(μ;ν) (α>0)(α>0) on Dn,m(μ)D_{n,m}(μ), …

2015-12-31abs ↗pdf ↗

Let $D_F = \{(z_0, z) \in {\C}^{n} | |z_0|^2 < b, \|z\|^2 < F(|z_0|^2) \}$ be a strongly pseudoconvex Hartogs domain endowed with the \K metric gFg_F associated to the \K form ωF=i2ˉlog(F(z02)z2)ω_F = -\frac{i}{2} \partial \bar{\partial} \log (F(|z_0|^2) - \|z\|^2). This paper contains several results on the Riemannian geometry of thes…

2008-03-25abs ↗pdf ↗

In this paper we study Kaehler manifolds that are strongly not relative to any projective Kaehler manifold, i.e. those Kaehler manifolds that do not share a Kaehler submanifold with any projective Kaehler manifold even when their metric is rescaled by the multiplication by a positive constant. We prove two results whic…

2016-08-10abs ↗pdf ↗

Employing Morse theory for the global control of monodromy and the method of analytic discs for local extension, we establish a version of the global Hartogs extension theorem in a singular setting: for every domain D of an (n-1)-complete normal complex space X of pure dimension n >= 2 and for every compact set K in D …

2007-04-24abs ↗pdf ↗

Vanishing result for cohomology leads to extension theorem for pluriharmonic functions.

problem Extension of pluriharmonic functions on complex manifolds.
method Vanishing result for Bott-Chern cohomology combined with Ehrenpreis technique.
result Hartogs extension theorem for pluriharmonic functions on cohomologically (n1)(n-1)-complete manifolds.

Study on when Bergman metrics of domains are induced by balls.

problem When does a domain's Bergman metric match a ball's up to a constant factor?
method Holomorphic isometric immersions, Calabi's diastasis criterion, explicit Bergman kernel formulas, algebraic arguments.
result For strictly pseudoconvex domains in \(\mathbb{C}^2\), if the immersion extends smoothly and transversally past the boundary and the scaling factor meets certain conditions, the domain is biholomorphic to the ball.

Paper extends Ohsawa-Takegoshi theorem to more general domains, proving removable singularities for plurisubharmonic functions.

problem Removable singularities of plurisubharmonic functions on complex domains.
method Extending Ohsawa-Takegoshi L2L^2 extension theorem to more general bounded complete Kähler domains.
result Proves removable singularities for plurisubharmonic functions across compact complete pluripolar sets.

We prove that a real-valued function (that is not assumed to be continuous) on a real analytic manifold is analytic whenever all its restrictions to analytic submanifolds homeomorphic to the 2-sphere are analytic. This is a real analog for the classical theorem of Hartogs that a function on a complex manifold is comple…

2018-12-03abs ↗pdf ↗

This is the first of a series of papers, in which we study the plurigenera, the Kodaira dimension and more generally the Iitaka dimension on compact almost complex manifolds. Based on the Hodge theory on almost complex manifolds, we introduce the plurigenera, Kodaira dimension and Iitaka dimension on compact almost com…

2018-08-02abs ↗pdf ↗

Method generates intermediate domains to align source and target domains.

problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.

CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.

problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.

DCASE 2022 Task 2 tackles domain shifts in ASD for machine condition monitoring.

problem Domain shifts change acoustic characteristics, affecting ASD performance.
method Domain generalization techniques to detect anomalies across unknown domains.
result Two types of domain generalization techniques were identified and analyzed.

Adaptive multi-domain learning reduces parameter count for efficient deep learning.

problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.

Recently multi-domain recommender systems have received much attention from researchers because they can solve cold-start problem as well as support for cross-selling. However, when applying into multi-domain items, although algorithms specifically addressing a single domain have many difficulties in capturing the spec…

2018-12-15abs ↗pdf ↗

Proposes novel losses for fine-grained categorical domain adaptation.

problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.

Improves unsupervised domain adaptation by mixing source and target domains.

problem Improves unsupervised domain adaptation by mixing source and target domains.
method Enforces training constraints across domains using mixup formulation and feature-level consistency regularizer.
result Significantly improves state-of-the-art performance on image classification and human activity recognition tasks.

We address the problem of domain generalization where a decision function is learned from the data of several related domains, and the goal is to apply it on an unseen domain successfully. It is assumed that there is plenty of labeled data available in source domains (also called as training domain), but no labeled dat…

2018-07-09abs ↗pdf ↗

MetFA aligns source and target domains for cross-device image classification.

problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.

In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain…

2019-09-08abs ↗pdf ↗

CSD learns a common component for domain generalization, outperforming existing methods.

problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.

A new method uses normalizing flows for gradual domain adaptation.

problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.

We propose a method to infer domain-specific models such as classifiers for unseen domains, from which no data are given in the training phase, without domain semantic descriptors. When training and test distributions are different, standard supervised learning methods perform poorly. Zero-shot domain adaptation attemp…

2018-07-09abs ↗pdf ↗

Study shows how many domains are needed for generalization, using a new measure called domain shattering dimension.

problem How many domains are needed for domain generalization?
method Introduced a new combinatorial measure called the domain shattering dimension to model domain sample complexity.
result Established a tight quantitative relationship between domain shattering dimension and classic VC dimension.

TAROT enhances robustness and domain adaptability with domain-invariant features.

problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.

A new model for imputing missing values in time series data across domains.

problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.