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

275582109 · May 202619922001200920172026
48 results for hyperbolic matrices

The paper uses Betti curves to confirm hyperbolic geometry in brain, climate, and financial networks.

problem Confirming the curvature of real-world networks using topology.
method Using Betti curves and integral Betti signatures derived from Persistent Homology to distinguish different geometric matrices.
result Integral Betti signatures effectively distinguish Euclidean, spherical, and hyperbolic geometric matrices.

We provide a simple way to obtain the meromorphic extension of Eisenstein series and Scattering matrices under conditions which generalize the case of discrete groups acting convex cocompactly on hyperbolic spaces.

1995-03-28abs ↗pdf ↗

Continuity of roots of hyperbolic polynomials with smooth coefficients.

problem Continuity of the solution map for hyperbolic polynomials.
method Proving continuity of the solution map from hyperbolic polynomials of degree d with C^d coefficients to their increasingly ordered roots.
result Continuity of the solution map for hyperbolic polynomials with C^d coefficients.

The paper establishes correspondences between quaternionic spinors, Minkowski flags, and hyperbolic horospheres.

problem Understanding geometric correspondences in 4D hyperbolic geometry.
method Explicit bijective correspondences using Clifford matrices and bilinear forms.
result Lambda lengths generalize to quaternionic values in 4D hyperbolic space and satisfy a non-commutative Ptolemy equation.

Using the representation of the isometries as 2x2 invertible matrices over the division algebra $\H$ of quaternions, we give an algebraic characterization of the dynamical types of the orientation-preserving isometries of the hyperbolic 5-space. We also determine the conjugacy classes and the conjugacy classes of centr…

2008-08-25abs ↗pdf ↗

In their precedent work, the authors constructed closed oriented hyperbolic surfaces with pseudo-Anosov homeomorphisms from certain class of integral matrices. In this paper, we present a very simple algorithm to compute the Teichmueller polynomial corresponding to those surface homeomorphisms by first constructing an …

2017-03-27abs ↗pdf ↗

Recently Kearton showed that any Seifert matrix of a knot is S--equivalent to the Seifert matrix of a prime knot. We show in this note that such a matrix is in fact S--equivalent to the Seifert matrix of a hyperbolic knot. This result follows from reinterpreting this problem in terms of Blanchfield pairings and by appl…

2007-04-25abs ↗pdf ↗

Geometric correspondence between spinors and horospheres in hyperbolic space.

problem Understanding the relationship between spinors and horospheres in hyperbolic geometry.
method Detailed exposition and step-by-step construction of the spinor--horosphere correspondence.
result Spinor--horosphere correspondence is a smooth, SL(2,C)SL(2,\mathbb{C})-equivariant bijection.

Paper builds neural networks on matrix manifolds using gyrovector spaces.

problem Lack of concepts in gyrovector spaces for matrix manifolds.
method Generalized gyrovector space concepts for SPD and Grassmann manifolds, proposing new neural network models.
result Demonstrated effectiveness in human action recognition and knowledge graph completion.

Researchers approximate partition functions on Riemannian spaces in the large N limit.

problem Computing normalization factors (partition functions) on Riemannian symmetric spaces is challenging.
method Approximation techniques in the large N limit, including saddle-point equations.
result Formulas for leading order terms in the large N limit of SPD matrices and related spaces.

The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entr…

2019-02-05abs ↗pdf ↗

Let SL(2, H\mathbb H) be the group of 2×22 \times 2 quaternionic matrices A=(abcd)A=\begin{pmatrix} a & b \\ c & d \end{pmatrix} with quaternionic determinant detA=adaca1b=1\det A=|ad-aca^{-1} b|=1. This group acts by the orientation-preserving isometries of the five dimensional (real) hyperbolic space. We obtain discreteness criteria f…

2017-08-19abs ↗pdf ↗

Let SL(2,H){\rm SL(2, \mathbb H)} be the group of 2×22 \times 2 quaternionic matrices with Dieudonné determinant 11. The group SL(2,H){\rm SL(2, \mathbb H)} acts on the five dimensional hyperbolic space by isometries. We investigate extremality of Jørgensen type inequalities in SL(2,H){\rm SL(2, \mathbb H)}. Along the way, we derive …

2015-03-30abs ↗pdf ↗

New proof for global rigidity of vertex scaling on polyhedral surfaces.

problem Global rigidity of vertex scaling on polyhedral surfaces.
method Elementary variational proof based on continuity of eigenvalues and extension of convex functions.
result Global rigidity of vertex scaling proved without involving 3D hyperbolic geometry.

This brief report (6 pages) was written in 1983 but never published. It concerns the hyperbolic 3-orbifolds obtained as quotients of hyperbolic 3-space by the group of invertible 2 by 2 matrices whose entries are integers in the imaginary quadratic extension of Q of discriminant D. For values D > -100 the topological t…

1999-06-10abs ↗pdf ↗

New study shows acceleration in hyperbolic spaces is impossible for strongly geodesically convex functions.

problem Acceleration in hyperbolic spaces for strongly geodesically convex functions is impossible.
method Perturbing hard functions with sums of bump functions chosen by a resisting oracle.
result Acceleration is unachievable for any deterministic algorithm in hyperbolic spaces for strongly geodesically convex functions.

Develops a new model to track financial market interconnectedness over time.

problem Investigating time-varying financial market interconnectedness.
method Hidden Markov graphical model with state-dependent generalized hyperbolic distributions.
result Identifies different degrees of network connectivity of returns over time.

Characterizes Coxeter groups with convex cocompact representations in projective space.

problem Understanding representations of Coxeter groups as convex cocompact reflection groups.
method Investigates representations of Coxeter groups into GL(n,R) as geometric reflection groups in projective space.
result Characterizes Coxeter groups that admit convex cocompact representations and describes the spaces of such representations.

Unified framework for Riemannian deep learning across manifold-valued representations.

problem Deep learning on manifold-valued representations often relies on Euclidean approximations or costly geometric operations.
method Develops reusable neural modules, manifold-specific network architectures, and geometric designs.
result Generalizes batch normalization and multinomial logistic regression to broader classes of manifolds.

Unified framework for Riemannian deep learning across manifold-valued representations.

problem Deep learning on manifold-valued data lacks reusable modules, specific network architectures, and efficient geometric operations.
method Develops reusable neural modules, manifold-specific network architectures, and geometric designs for broad classes of Lie groups and gyrogroups.
result Generalizes batch normalization and multinomial logistic regression to Riemannian manifolds, including SPD and hyperbolic spaces.

Free Random Projection enhances reinforcement learning by naturally incorporating hierarchical structure.

problem Improving reinforcement learning algorithms for better generalization and adaptability.
method Introduces Free Random Projection, a method that uses free probability theory to create random orthogonal matrices encoding hierarchical structure.
result Empirically shows consistent improvement in generalization over standard methods on multi-environment benchmarks.

Let RR be an infinite commutative ring with identity and n2n\geq 2 be an integer. We prove that for each integer i=0,1,,n2,i=0,1,\cdots ,n-2, the L2L^{2}-Betti number bi(2)(G)=0,b_{i}^{(2)}(G)=0,  \ when G=GLn(R)G=\mathrm{GL}_{n}(R) the general linear group, SLn(R)\mathrm{SL}_{n}(R) the special linear group, % E_{n}(R) the group generated by…

2017-03-01abs ↗pdf ↗

IPMs struggle with hyperbolic spaces due to polynomially growing barrier parameters.

problem IPMs' efficiency is hindered in hyperbolic spaces.
method Analyzing the barrier parameter growth in hyperbolic and Hadamard spaces.
result The barrier parameter grows polynomially with the domain's diameter in hyperbolic spaces.

The systole of a hyperbolic surface is bounded by a logarithmic function of its genus. This bound is sharp, in that there exist sequences of surfaces with genera tending to infinity that attain logarithmically large systoles. These are constructed by taking congruence covers of arithmetic surfaces. In this article we p…

2015-12-21abs ↗pdf ↗

The paper deals with a formally self-adjoint first order linear differential operator acting on m-columns of complex-valued half-densities over an n-manifold without boundary. We study the distribution of eigenvalues in the elliptic setting and the propagator in the hyperbolic setting, deriving two-term asymptotic form…

2014-03-11abs ↗pdf ↗

We simplify matrix computations for block matrices, especially useful for covariance and correlation matrices.

problem Complex computations for block matrices, especially for covariance and correlation matrices.
method Obtained a canonical representation for block matrices, facilitating computation of various matrix operations.
result Simplified computation of matrix operations for block matrices, particularly useful for covariance and correlation matrices.

Computes isotropy subgroups of orthogonal matrices acting on Hermitian matrices.

problem Computing isotropy subgroups of orthogonal matrices acting on Hermitian matrices.
method Algorithm for solving a matrix equation to compute isotropy subgroups.
result Computed isotropy subgroups of orthogonal matrices acting on Hermitian matrices.

Researchers extend ResNets to Riemannian manifolds, improving performance over existing methods.

problem Learning on Riemannian manifolds, especially for hierarchical graphs and manifold-valued data.
method Geometrically principled extension of ResNets to general Riemannian manifolds.
result Riemannian ResNets outperform existing manifold neural networks in relevant metrics and training dynamics.

Study on random matrices in deep neural networks using Gaussian data.

problem Distribution of singular values in product of random matrices in deep learning.
method Free probability theory combined with standard techniques of random matrix theory.
result Justification for applying free probability theory to non-independent random data matrices.

Study on random matrices in deep neural networks with IID entries.

problem Distribution of singular values in product of random matrices for deep neural networks.
method Random matrix theory with a streamlined approach for non-Gaussian data.
result Generalization of macroscopic universality property to non-Gaussian data.