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

336698131 · May 202619922001200920172026
48 results for strictly upper triangular

Study finds conditions for operator fields to be in strictly upper triangular form in small dimensions.

problem Jordan-Chevalley decomposition for operator fields in small dimensions.
method Tensorial conditions and proof of conjecture for higher order brackets.
result Proves Tempesta-Tondo conjecture for higher order brackets.

Solves problem of describing transformations for upper triangular Toeplitz operators.

problem Describing coordinate transformations preserving upper triangular Toeplitz form of operator fields.
method Implicit formulas involving matrix-valued functions for describing transformations and Nijenhuis operators.
result Formulas for coordinate transformations and Nijenhuis operators in upper triangular Toeplitz form.

The paper proves positivity of a L2L^2-torsion function for certain 3-manifolds.

problem Positivity of a L2L^2-torsion function for 3-manifolds.
method Analyzes the representation variety and uses properties of the fundamental group.
result The L2L^2-torsion function is strictly positive for 3-manifolds with infinite fundamental group.

It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular 2x22x2 matrices. In this work, we propose to generalize this result by considering the representations…

2007-09-14abs ↗pdf ↗

Polynomial density theorem for specific subgroup orbits in quotient spaces.

problem Effective density of orbits in arithmetic quotients of SL2(C)\operatorname{SL}_2(\mathbb C) and SL2(R)imesSL2(R)\operatorname{SL}_2(\mathbb R) imes\operatorname{SL}_2(\mathbb R).
method Use of Margulis function, incidence geometry tools, and spectral gap of ambient space.
result Proved effective density theorems with polynomial error rate.

Paper studies simplified trisections and their equivalence classes.

problem Understanding right-left equivalence of simplified (2,0)(2, 0)-trisections.
method Analyzes simplified trisection diagrams and upper-triangular handle-slides.
result At least two simplified (2,0)(2, 0)-trisections can be right-left equivalent without being related by automorphisms or handle-slides.

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering lines and circles in the plane. Finally, we give matrix generators in $\mathrm{…

2018-08-23abs ↗pdf ↗

The fundamental group of every surface that is not the projective plane or Klein bottle has a representation to a torsion-free group of upper-triangular matrices in SL(2,R) with no simple loop (i.e. a nontrivial element representing a simple closed curve) in the kernel.

2017-04-04abs ↗pdf ↗

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pur…

2014-05-21abs ↗pdf ↗

Algorithm learns non-Gaussian graphical models via Hessian scores and triangular transport.

problem Learning graph structure from non-Gaussian data.
method Score based on integrated Hessian information, coupled with triangular transport map.
result Algorithm successfully recovers graph structure for non-Gaussian data.

Regarding the Specht modules associated to the two-row partition (n,n)(n,n), we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the A1A_1-web basis (i.e. cup diagrams), and prove that the entries in this matrix are positive in the upper-triangular portion with respect to a ce…

2019-11-12abs ↗pdf ↗

Smooth resolutions found for quotient of R^2 by infinite discrete groups.

problem Symplectic resolutions of quotient spaces by infinite discrete subgroups.
method Constructing smooth symplectic resolutions for R^2 under infinite discrete subgroups of GL_2(R).
result Minimal resolutions of Du Val singular varieties are symplectic resolutions of R^2/G.

We study the large scale geometry of the upper triangular subgroup of PSL(2,Z[1/n]), which arises naturally in a geometric context. We prove a quasi-isometry classification theorem and show that these groups are quasi-isometrically rigid with infinite dimensional quasi-isometry group. We generalize our results to a lar…

2003-01-16abs ↗pdf ↗

Upper bounds for volumes of hyperbolic polyhedra and links are derived.

problem Finding upper limits for volumes of generalized hyperbolic polyhedra and links.
method Application of Belletti's theorem and analysis of polyhedra with triangular faces and trivalent vertices.
result Improved upper bounds for volumes of hyperbolic polyhedra and links are derived.

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.

We investigate the resonance varieties, lower central series ranks, and Chen ranks of the pure virtual braid groups and their upper-triangular subgroups. As an application, we give a complete answer to the 1-formality question for this class of groups. In the process, we explore various connections between the Alexande…

2016-02-13abs ↗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 ↗

Let T be the nilpotent group of 4 x 4 real upper triangular matrices. In this note we show that the Euler equations of certain left-invariant riemannian metrics on T have a horseshoe. We also show, with the aid of a numerical computation of a Melnikov-type integral, that the Euler equations of the sub-riemannian Carnot…

2007-09-28abs ↗pdf ↗

Triangular flows ensure statistical consistency and fast rates in generative modeling.

problem Ensuring statistical consistency and fast rates in generative models.
method Statistical guarantees and sample complexity bounds for triangular flow models using empirical process theory.
result Established statistical consistency and finite sample convergence rates for Kullback-Leibler estimator of Knöthe-Rosenblatt measure coupling.

In this paper, we present a structurally flat triangular form which is based on the extended chained form. We provide necessary and sufficient conditions for an affine input system with two inputs to be static feedback equivalent to the proposed triangular form, and thus a sufficient condition for an affine input syste…

2020-02-04abs ↗pdf ↗

Paper uses GNNs to efficiently detect profitable triangular arbitrage opportunities.

problem Detecting profitable triangular arbitrage opportunities in dynamic markets.
method Formulate the problem as a graph-based optimization task and use a GNN architecture to capture complex relationships.
result GNN-based method achieves higher average yield with reduced computational time compared to traditional methods.

The group of real 4 by 4 upper triangular matrices with 1s on the diagonal has a left-invariant subRiemannian (or Carnot-Caratheodory) structure whose underlying distribution corresponds to the superdiagonal. We prove that the associated subRiemannian geodesic flow is not completely integrable. This provides the first …

1997-04-25abs ↗pdf ↗

Discretizes Helfrich-type energies on surfaces using triangular complexes.

problem Discretizing curvature energies on surfaces of specific type.
method Asymptotic lower bound combined with recovery sequence of triangulations and edge director fields.
result Valid discrete versions of integral curvature energies on surfaces.

We first show that there are in fact triangular arbitrage opportunities in the spot foreign exchange markets, analyzing the time dependence of the yen-dollar rate, the dollar-euro rate and the yen-euro rate. Next, we propose a model of foreign exchange rates with an interaction. The model includes effects of triangular…

2002-02-22abs ↗pdf ↗

We investigate triangular arbitrage within the spot foreign exchange market using high-frequency executable prices. We show that triangular arbitrage opportunities do exist, but that most have short durations and small magnitudes. We find intra-day variations in the number and length of arbitrage opportunities, with la…

2008-12-04abs ↗pdf ↗

The study investigates linearizability of Poisson structures on groupoids.

problem Linearizing Poisson structures on groupoids around the unit section.
method Extending the Lagrangian neighbourhood theorem to cosymplectic Lie algebroids, integrating triangular Lie bialgebras to symplectic LA-groupoids.
result Poisson structures on groupoids are linearizable under certain conditions.

New method for conditional sampling using M-GANs, likely-free inference.

problem Conditional sampling of probability measures.
method Developed a novel computational approach called M-GANs based on block triangular transport.
result Accurate sampling of conditional measures in various applications.

New method uses neural maps to efficiently sample lattice QCD distributions.

problem Challenges in sampling Boltzmann distributions of lattice field theories.
method Sparse triangular transport maps exploiting conditional independence structure of lattice graphs.
result Sparse triangular maps achieve efficient sampling with linear time complexity in lattice size.

In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The operations used to perform this triangularization preserve the property that the entries …

2013-03-20abs ↗pdf ↗