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

Trend · papers per month

17335066 · Jun 202019922001200920172026
48 results for Neumann--Zagier matrices

New formula for knot group representations and hyperbolic structures.

problem Understanding representations of knot groups and their geometric implications.
method Direct algebraic formula for geometric parameters of octahedral decompositions.
result Explicit criterion for critical points in Neumann-Zagier--Yokota potential function.

In the paper we define a "volume" for simplicial complexes of flag tetrahedra. This generalizes and unifies the classical volume of hyperbolic manifolds and the volume of CR tetrahedra complexes. We describe when this volume belongs to the Bloch group. In doing so, we recover and generalize results of Neumann-Zagier, N…

2011-01-14abs ↗pdf ↗

We establish an inequality which gives strong restrictions on when the standard definite plumbing intersection lattice of a Seifert fibered space over S2S^2 can embed into a standard diagonal lattice, and give two applications. First, we answer a question of Neumann-Zagier on the relationship between Donaldson's theore…

2018-07-26abs ↗pdf ↗

We define an extended Bloch group and show it is isomorphic to H3(PSL(2,C)δ;Z)H_3(PSL(2,C)^δ;Z). Using the Rogers dilogarithm function this leads to an exact simplicial formula for the universal Cheeger-Simons class on this homology group. It also leads to an independent proof of the analytic relationship between volume and Chern-S…

2002-12-10abs ↗pdf ↗

In a previous paper, we parametrized boundary-unipotent representations of a 3-manifold group into SL(n,C) using Ptolemy coordinates, which were inspired by A-coordinates on higher Teichmüller space due to Fock and Goncharov. In this paper, we parametrize representations into PGL(n,C) using shape coordinates which are …

2012-07-28abs ↗pdf ↗

We give a formula for the radial asymptotics to all orders of the special qq-hypergeometric series known as Nahm sums at complex roots of unity. This result is used in~\cite{CGZ} to prove one direction of Nahm's conjecture relating the modularity of Nahm sums to the vanishing of a certain invariant in KK-theory. The …

2018-12-18abs ↗pdf ↗

The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute A-polynomials by starting with a triangulation of a manifold, then using symplec…

2020-02-24abs ↗pdf ↗

Extending methods first used by Casson, we show how to verify a hyperbolic structure on a finite triangulation of a closed 3-manifold using interval arithmetic methods. A key ingredient is a new theoretical result (akin to a theorem by Neumann-Zagier and Moser for ideal triangulations upon which HIKMOT is based) showin…

2019-04-27abs ↗pdf ↗

Study on non-orientable hyperbolic 3-manifolds and their deformations.

problem Understanding the deformation space of non-orientable hyperbolic 3-manifolds.
method Computing the deformation space of pairs (M^3, Δ) and determining representations in Isom(H^3).
result Existence of deformations not realizable as pair deformations.

Since the set of volumes of hyperbolic 3-manifolds is well ordered, for each fixed g there is a genus-g surface bundle over the circle of minimal volume. Here, we introduce an explicit family of genus-g bundles which we conjecture are the unique such manifolds of minimal volume. Conditional on a very plausible assumpti…

2010-02-18abs ↗pdf ↗

The Quantum Modularity Conjecture of Zagier predicts the existence of a formal power series with arithmetically interesting coefficients that appears in the asymptotics of the Kashaev invariant at each root of unity. Our goal is to construct a power series from a Neumann-Zagier datum (i.e., an ideal triangulation of th…

2015-11-18abs ↗pdf ↗

We provide a new topological interpretation of the symplectic properties of gluing equations for triangulations of hyperbolic 3-manifolds, first discovered by Neumann and Zagier. We also extend the symplectic properties to more general gluings of PGL(2,C) flat connections on the boundaries of 3-manifolds with topologic…

2014-03-20abs ↗pdf ↗

The paper studies Teichmüller TQFT for hyperbolic knots, proving exponential decay of partition functions.

problem Analyzing Teichmüller TQFT for hyperbolic knots with generalized FAMED triangulations.
method Introducing generalized FAMED property, proving exponential decay of partition functions in semi-classical limit.
result Partition functions decay exponentially with the volume of knot complements, and the 1-loop invariant emerges.

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.

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.

Study isotropy groups for complex orthogonal and skew-symmetric matrices.

problem Understanding isotropy subgroups of orthogonal similarity transformations.
method Analysis of group structure of nonsingular block matrices.
result Group structure of isotropy subgroups related to block Toeplitz matrices.

The paper deals with distribution of singular values of product of random matrices arising in the analysis of deep neural networks. The matrices resemble the product analogs of the sample covariance matrices, however, an important difference is that the population covariance matrices, which are assumed to be non-random…

2020-01-17abs ↗pdf ↗

Researchers develop geodesics for a new metric on correlation matrices.

problem Lack of intrinsic tools for statistical analyses of correlation matrices.
method Developed geodesics for the quotient-affine metric on full-rank correlation matrices.
result Provided fundamental Riemannian operations for the quotient-affine metric.

New methods for sketching non-PSD matrices improve regression and optimization tasks.

problem Efficiently handling non-PSD matrices in computations.
method Developed novel matrix sketching techniques for non-PSD and complex matrices.
result Improved performance in convex and non-convex optimization, regression, and vector-matrix-vector queries.

The gluing equations of a cusped hyperbolic 3-manifold MM are a system of polynomial equations in the shapes of an ideal triangulation $\calT$ of MM that describe the complete hyperbolic structure of MM and its deformations. Given a Neumann-Zagier datum (comprising the shapes together with the gluing equations in a …

2012-02-28abs ↗pdf ↗

We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…

2016-07-02abs ↗pdf ↗

Method estimates M-matrices in graphical models with improved accuracy.

problem Estimating M-matrices as precision matrices in Gaussian graphical models.
method Adaptive multiple-stage estimation method solving weighted ℓ1-regularized problems.
result Method outperforms state-of-the-art methods in precision matrix estimation and graph edge identification.

A framework estimates multiple precision matrices with shared structures.

problem Estimating multiple precision matrices with shared structures.
method Penalized likelihood framework with iterative algorithm alternating between convex and clustering problems.
result The method outperforms competitors and performs similarly to methods using prior information.

Proposes a new Sliced-Wasserstein distance for covariance matrices in M/EEG signals.

problem Efficiently dealing with distributions of covariance matrices in M/EEG multivariate time series.
method Defines a Sliced-Wasserstein distance for symmetric positive definite matrices and applies it to brain-age prediction and Brain Computer Interface applications.
result Demonstrates computational efficiency and strong theoretical guarantees for the proposed distance.

Study extends bounds on sample covariance matrices with general dependence.

problem Quantitative bounds on sample covariance matrices with i.i.d. columns.
method Extends previous work on deterministic equivalent to rectangular random matrices with general dependence structure.
result Proves quantitative bounds involving dimensions and spectral parameter, including closer proximity to real positive semi-line.

Kaleidoscope matrices improve model quality and inference speed.

problem Choosing structured linear transformations for efficiency and accuracy.
method Introduce kaleidoscope matrices that can capture any structured matrix with near-optimal space and time complexity. Learn these matrices automatically within end-to-end pipelines.
result Kaleidoscope matrices can improve model quality and inference speed.

Monge matrices and their permuted versions known as pre-Monge matrices naturally appear in many domains across science and engineering. While the rich structural properties of such matrices have long been leveraged for algorithmic purposes, little is known about their impact on statistical estimation. In this work, we …

2019-04-05abs ↗pdf ↗

A method learns matrix factorization from diverse matrices and applies the knowledge to unseen matrices.

problem Matrix factorization without shared rows or columns.
method Neural network meta-learned to minimize expected imputation error using MAP estimation.
result The method can impute missing values from unseen matrices efficiently.