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

Trend · papers per month

2775538301,106 · Jun 202019922001200920172026
48 results for directional limit sets

Study on mapping class groups of non-orientable surfaces, proving some conjectures and refuting others.

problem Analogies between Fuchsian groups and mapping class groups of non-orientable surfaces.
method Analyzing limit sets, foliations, and geometric properties.
result Established parts of a conjecture about the limit set and provided evidence for and against the analogy.

Paper confirms Thom's conjecture for nonlinear evolutions on manifolds.

problem Thom's gradient conjecture for nonlinear evolution equations.
method Extending and settling the conjecture in infinite dimensional problems using Łojasiewicz, L. Simon, and Kurdyka-Mostowski-Parusinski's foundational works.
result Uniqueness of the limiting direction and characterization of convergence rates for both classical and infinite dimensional settings.

The paper generalizes the Hausdorff dimension of limit sets for self-joinings of hyperbolic groups.

problem Calculating the Hausdorff dimension of limit sets for self-joinings of hyperbolic groups.
method The paper generalizes a classical result by considering self-joinings of convex cocompact groups and proving new inequalities for the Hausdorff dimension of directional limit sets.
result For k3k \leq 3, the paper establishes bounds on the Hausdorff dimension of directional limit sets for self-joinings of convex cocompact groups.

This paper is devoted to the framework of direct limit of anchored Banach bundles over a convenient manifold which is a direct limit of Banach manifold. In particular we give a criterion of integrability for distributions on such convenient manifolds which are locally direct limits of particular sequences of Banach anc…

2014-08-16abs ↗pdf ↗

Study relaxes identification assumptions for natural direct effects in non-randomized settings.

problem Identifying causal direct effects under unmeasured confounding.
method Developed relaxed conditions for identifying natural direct effects in non-randomized settings.
result Identified natural direct effect under unmeasured confounding conditions.

We study direct limits (G,K)=lim(Gn,Kn)(G,K) = \varinjlim (G_n,K_n) of compact Gelfand pairs. First, we develop a criterion for a direct limit representation to be a multiplicity--free discrete direct sum of irreducible representations. Then we look at direct limits G/K=limGn/KnG/K = \varinjlim G_n/K_n of compact riemannian symmetric spaces, …

2008-01-25abs ↗pdf ↗

Survey on Nambu-Poisson structures in infinite dimensions.

problem Generalization of Poisson and Nambu-Poisson structures in infinite dimensions.
method Study properties of associated characteristic distribution and projective/direct limits.
result Properties and limits of Nambu-Poisson structures in convenient setting.

New method for community detection in sparse directed SBMs with exact recovery guarantees.

problem Exact recovery in sparse directed SBMs, especially with growing communities.
method Two-stage procedure: neighborhood-smoothing followed by KK-means clustering.
result Exact recovery of all community labels with probability tending to one under mild sparsity and separation conditions.

Cohomology fractals are visual representations of cohomology classes on hyperbolic 3-manifolds.

problem Visualizing cohomology classes on hyperbolic 3-manifolds.
method Cohomology fractals are images associated to cohomology classes. They are related to limit sets of Kleinian groups but differ in key aspects. An implementation using ideal triangulations and ray-casting is presented.
result Cohomology fractals allow for real-time zooming in any direction at arbitrary depth.

If G1,...,GnG_1,...,G_n are limit groups and SG1×...×GnS\subset G_1\times...\times G_n is of type $\FP_n(\mathbb Q)$ then SS contains a subgroup of finite index that is itself a direct product of at most nn limit groups. This settles a question of Sela.

2007-04-30abs ↗pdf ↗

This paper deals with Prym eigenforms which are introduced previously by McMullen. We prove several results on the directional flow on those surfaces, related to complete periodicity (introduced by Calta). More precisely we show that any homological direction is algebraically periodic, and any direction of a regular cl…

2013-01-04abs ↗pdf ↗

The paper extends Nambu-Poisson structures to infinite dimensions.

problem Extending Nambu-Poisson structures to infinite dimensional settings.
method Adapting finite dimensional Nambu-Poisson structures to a convenient manifold setting.
result Classical results in finite dimensions can be extended to infinite dimensions for partial Nambu structures.

We study direct limits of embedded Cantor sets and embedded \sier curves. We show that under appropriate conditions on the embeddings, all limits of Cantor spaces give rise to homeomorphic spaces, called ωω-Cantor spaces, and similarly, all limits of \sier curves give homeomorphic spaces, called to ωω-\sier curves. W…

2019-08-09abs ↗pdf ↗

We review recent work on the compactification of the moduli space of Hitchin's self-duality equation. We study the degeneration behavior near the ends of this moduli space in a set of generic directions by showing how limiting configurations can be desingularized. Following ideas of Hitchin, we can relate the top bound…

2015-02-05abs ↗pdf ↗

The study connects Hilbert entropy to non-differentiability points of limit sets in flag spaces.

problem Understanding non-differentiability points in limit sets of convex projective structures.
method Introduces hyperplane conicality for θθ-Anosov representations and uses it to prove properties of boundary maps.
result Hilbert entropy is linked to the Hausdorff dimension of non-differentiability points in flag spaces.

We study direct limits (G,K)=lim(Gn,Kn)(G,K) = \varinjlim (G_n,K_n) of Gelfand pairs of the form Gn=NnKnG_n = N_n\rtimes K_n with NnN_n nilpotent, in other words pairs (Gn,Kn)(G_n,K_n) for which Gn/KnG_n/K_n is a commutative nilmanifold. First, we extend the criterion of \cite{W3} for a direct limit representation to be multiplicity free. Then w…

2008-01-25abs ↗pdf ↗

By the work of Hong and Tian it is known that given a holomorphic vector bundle E over a compact Kahler manifold X, the Yang-Mills flow converges away from an analytic singular set. If E is semi-stable, then the limiting metric is Hermitian-Einstein and will decompose the limiting bundle into a direct sum of stable bun…

2011-04-25abs ↗pdf ↗

Reconstructing polytopes with fixed facet directions from support function evaluations.

problem Reconstructing polytopes with known facet directions from limited data.
method Least-squares estimate via convex quadratic program, combinatorial characterization for uniqueness, algorithm convergence.
result The least-squares estimate for a fixed simplicial normal fan is a convex quadratic program, and the solution is unique under certain conditions.

Study homeomorphism groups of ordinals, proving strong distortion and normal generators.

problem Understanding algebraic and geometric properties of homeomorphism groups of ordinals.
method Analyzing successor ordinals with connections to permutation groups and manifolds.
result Proves strong distortion and normal generators for homeomorphism groups of ordinals.

Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be used for classification, feature selection and hypothesis generation, while reveal…

2017-04-09abs ↗pdf ↗

Attention learns PCA on Gaussian data, proving its connection to principal component analysis.

problem Principal component analysis on Gaussian data.
method Analysis of attention mechanisms through PCA, covering finite and infinite prompt regimes.
result Attention aligns with principal eigenvectors of covariance matrices, converging to optimal solutions in the infinite-prompt limit.

New stochastic gradient descent with random search directions improves efficiency and convergence.

problem Efficiency and convergence of stochastic gradient descent methods.
method Developed a new class of stochastic gradient descent algorithms with random search directions.
result Established almost sure convergence and provided Lp\mathbb{L}^p rates of convergence.

Extends Dirac structures to infinite dimensions, focusing on convenient Lie algebroids and manifolds.

problem Extending classical geometrical results from finite to infinite dimensions.
method Introduces partial Dirac structures on convenient Lie algebroids and manifolds, explores their properties and limits.
result Classical geometrical results can be extended to infinite dimensional contexts.

Study sets a nontrivial upper limit on return forecasting accuracy.

problem Establishing a practical upper limit for return forecasting accuracy.
method Defined a coin-flip oracle model to theoretically outperform practical models and used its RextOOS2R^2_{ ext{OOS}} as an upper bound.
result Theoretical upper bound on RextOOS2R^2_{ ext{OOS}} is a quadratic function of directional accuracy.

To estimate the conditional probability functions based on the direct problem setting, V-matrix based method was proposed. We construct V-matrix based constrained quadratic programming problems for which the inequality constraints are inconsistent. In particular, we would like to present that the constrained quadratic …

2018-08-27abs ↗pdf ↗

We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the…

2018-02-16abs ↗pdf ↗

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.