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

Trend · papers per month

94188282376 · Jun 202019922001200920182026
48 results for maximal domain

Study examines maximal domains of radial harmonic functions across different curvature types.

problem Understanding maximal domains of radial harmonic functions in various curvature settings.
method Analysis of harmonic spaces with positive, zero, and negative curvature.
result Characterization of maximal domains for radial harmonic functions in different curvature contexts.

The study classifies area-maximizing hypersurfaces with singularities and exterior domains.

problem Classifying area-maximizing hypersurfaces with singularities and exterior domains.
method Complete classification for entire area maximizing hypersurfaces with isolated singularities. Construction of an example. Partial result on asymptotic behavior for exterior domains. Solvability of exterior Dirichlet problems.
result Complete classification and partial results on asymptotic behavior for area maximizing hypersurfaces.

Proves local maximizers for higher Ekeland-Hofer capacities in 4D star-shaped domains.

problem Finding local maximizers for higher Ekeland-Hofer capacities in specific domains.
method Analogous to 4D local Viterbo conjecture, proving maximizers for rational ellipsoids.
result Local maximizers of the k-th Ekeland-Hofer capacities are symplectomorphic to rational ellipsoids.

Proposes MEDM to balance entropy minimization and diversity maximization for better domain adaptation.

problem Trivial solutions in entropy minimization for unsupervised domain adaptation.
method Introduces diversity maximization to balance with entropy minimization, controlled by deep embedded validation.
result MEDM outperforms state-of-the-art methods on four domain adaptation datasets.

In this paper we study the maximal stable domains on minimal catenoids in Euclidean and hyperbolic spaces and in H2×RH^2 \times R. We in particular investigate whether half-vertical catenoids are maximal stable domains (\emph{Lindelöf's property}). We also consider stable domains on catenoid-cousins in hyperbolic space. …

2009-07-24abs ↗pdf ↗

InfoOT improves data alignment by maximizing mutual information.

problem Optimal transport's limitations in handling clusters, outliers, and new data.
method InfoOT extends optimal transport by maximizing mutual information while minimizing distances.
result InfoOT outperforms optimal transport in domain adaptation, cross-domain retrieval, and single-cell alignment.

A characterization of maximal domains of existence of adapted complex structures for Riemannian homogeneous manifolds under certain extensibility assumptions on their geodesic flow is given. This is applied to generalized Heisenberg groups and naturally reductive Riemannian homogeneous spaces. As an application it is s…

2002-06-07abs ↗pdf ↗

Anosov representations lead to compact domains in flag manifolds.

problem Constructing cocompact domains of discontinuity for Anosov representations.
method Systematic approach to domains of discontinuity using flag manifolds.
result Every cocompact domain of discontinuity arises from a construction, with exceptions in low rank.

MDA learns domain-invariant features for better target domain classification.

problem Improving model performance on unseen target domains using multiple source domains.
method MDA learns a domain-invariant feature transformation with minimal divergence, maximal separability, and compactness.
result MDA achieves better generalization on unseen target domains compared to existing methods.

Maximal acceleration metrics limit spacetime curvature.

problem Bounding spacetime curvature under maximal acceleration.
method Developed a geometric framework for maximal acceleration metrics and associated connections, proving curvature bounds.
result Uniform bounds on curvature components follow from uniform bounds on maximal acceleration.

Given a smooth simply connected planar domain, the area is bounded away from zero in terms of the maximal curvature alone. We show that in higher dimensions this is not true, and for a given maximal mean curvature we provide smooth embeddings of the ball with arbitrary small volume.

2016-04-20abs ↗pdf ↗

The paper studies continuous submodular functions and their optimization.

problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.

A totally geodesic map f:X1X2f:\mathcal X_1\to\mathcal X_2 between Hermitian symmetric spaces is tight if its image contains geodesic triangles of maximal area. Tight maps were first introduced in [BIW09], and were classified in [Ham13, Ham14, HO14] in the case of irreducible domain. We complete the classification by analy…

2014-12-19abs ↗pdf ↗

Paper introduces a new Poisson kernel for strongly pseudoconvex domains.

problem Developing a new mathematical tool for strongly pseudoconvex domains.
method Introducing a maximal plurisubharmonic function called the pluricomplex Poisson kernel.
result The pluricomplex Poisson kernel shares properties with the classical Poisson kernel and reproduces pluriharmonic functions.

ImplicitCE recommends items to new users by co-embedding users and items.

problem Recommendation for new users with no feedback structure.
method End-to-end learning of embedding spaces and transformation function, maximizing correlations between model predictions and user affinities.
result ImplicitCE outperforms state-of-the-art algorithms on Twitter and DBLP datasets.

Paper finds space-like maximal surfaces with entire null lines in 3D space-time.

problem Existence of space-like maximal surfaces containing entire null lines.
method Analyzes surfaces in Lorentz-Minkowski 3-space, proving existence and properties.
result Embedded space-like maximal graphs containing entire null lines exist.

We describe a construction of Schottky type subgroups of automorphism groups of partially cyclically ordered sets. We apply this construction to the Shilov boundary of a Hermitian symmetric space and show that in this setting Schottky subgroups correspond to maximal representations of fundamental groups of surfaces wit…

2016-09-15abs ↗pdf ↗

The paper examines Euclidean domains with nearly maximal Yamabe quotients.

problem Understanding domains with nearly maximal Yamabe quotients in Euclidean space.
method Analyzes the properties of domains in R3\mathbb R^3 with nearly maximal Yamabe quotients, proving conditions for equality and comparing to quasi-conformal maps.
result Domains with nearly maximal Yamabe quotients are diffeomorphic to balls and are close to a ball in a metric space sense.

Paper tackles domain generalization by minimizing domain-based covariance.

problem Training data and test data have different distributions, leading to poor generalization.
method Find a central subspace minimizing domain-based covariance while preserving functional relationships.
result The proposed method achieves better generalization performance on unseen test datasets.

We define a family of four-point invariants for Shilov boundaries of bounded symmetric domains of tube type, which generalizes the classical four-point cross ratio on the unit circle. This generalization, which is based on a similar construction of Clerc and Ørsted, is functorial and well-behaved under products; these …

2009-08-27abs ↗pdf ↗

We study the canonical complexifications of non-compact Riemannian symmetric spaces G/K by the Grauert tube construction. We determine the maximal such complexification, a domain already constructed in another context by Akhiezer and Gindikin (Math. Ann., 1990), and show that this domain is Stein. We show there is an a…

2001-09-24abs ↗pdf ↗

SALT combines geometric and model-based alignment for domain adaptation.

problem Aligning source and target domains for unsupervised domain adaptation.
method SALT treats alignment as an auxiliary task, leveraging subspace geometry and gradient-based optimization.
result SALT achieves comparable or better performance than state-of-the-art methods.

A new method for unsupervised domain adaptation using Gaussian processes.

problem Reducing target domain error by aligning input and output distributions.
method Max-margin Gaussian process approach to achieve hypothesis consistency.
result Our method effectively minimizes maximum discrepancy and maximizes margins.

We consider a continuous curve of linear elliptic formally self-adjoint differential operators of first order with smooth coefficients over a compact Riemannian manifold with boundary together with a continuous curve of global elliptic boundary value problems. We express the spectral flow of the resulting continuous fa…

2005-04-07abs ↗pdf ↗

We show that the ball does not maximize the first nonzero Steklov eigenvalue among all contractible domains of fixed boundary volume in Rn\mathbb{R}^n when n3n \geq 3. This is in contrast to the situation when n=2n=2, where a result of Weinstock from 1954 shows that the disk uniquely maximizes the first Steklov eigenval…

2017-11-13abs ↗pdf ↗

In Euclidean and Hyperbolic space, and the hemisphere in SnS^n, geodesic balls maximize the gap λ2λ1λ_2 - λ_1 of Dirichlet eigenvalues, amoung domains with fixed λ1λ_1. We prove an upper bound on λ2λ1λ_2 - λ_1 for domains in manifolds with certain curvature bounds. The inequality is sharp on geodesic balls in spaceforms.

2015-03-24abs ↗pdf ↗

Study sharp upper bounds for Aharonov-Bohm eigenvalues on surfaces.

problem Finding sharp upper bounds for eigenvalues of magnetic Laplacian.
method Isoperimetric inequalities and bounds in terms of Gaussian curvature.
result Maximal first eigenvalue for geodesic disk on simply connected surfaces.

Learning multiple tasks across heterogeneous domains is a challenging problem since the feature space may not be the same for different tasks. We assume the data in multiple tasks are generated from a latent common domain via sparse domain transforms and propose a latent probit model (LPM) to jointly learn the domain t…

2012-06-27abs ↗pdf ↗

In this paper, it is shown that a Fuchsian group, acting on the upper half-plane model for H2\mathbb{H}^2, admits a Ford domain which is also a Dirichlet domain, for some center, if and only if it is an index 2 subgroup of a reflection group. This is used to exhibit an example of a maximal arithmetic hyperbolic reflect…

2009-11-25abs ↗pdf ↗

Domain adaptation (DA) is the task of classifying an unlabeled dataset (target) using a labeled dataset (source) from a related domain. The majority of successful DA methods try to directly match the distributions of the source and target data by transforming the feature space. Despite their success, state of the art m…

2018-03-20abs ↗pdf ↗