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

Trend · papers per month

4591136181 · Jun 202019922001200920182026
48 results for Lehmer Transform

New Lehmer constants computed for free groups, improving bounds.

problem Tackles Lehmer's problem on Mahler measures and Fuglede-Kadison determinants.
method Uses relations between Fuglede-Kadison determinants and random walks on Cayley graphs, and gluing formula for L2L^2-torsions.
result Computes new upper bound of 23\frac{2}{\sqrt{3}} for Lehmer's constants of torsion-free groups with non-cyclic free subgroups.

Lehmer's question is equivalent to one about generalized growth rates of Lefschetz numbers of iterated pseudo-Anosov surface homeomorphisms. One need consider only homeomorphisms that arise as monodromies of fibered knots in lens spaces L(n,1), n>0. Lehmer's question for Perron polynomials is equivalent to one about ge…

2005-09-03abs ↗pdf ↗

This paper addresses a long standing open problem due to Lehmer in which the triple 2,3,7 plays a notable role. Lehmer's problem asks whether there is a gap between 1 and the next smallest algebraic integer with respect to Mahler measure. The question has been studied in a wide range of contexts including number theory…

2002-04-02abs ↗pdf ↗

Complexity of signed graphs linked to Alexander polynomials and Lehmer's question.

problem Complexity of signed graphs and its relation to Alexander polynomials.
method Definition of graph complexity using Laplacian matrix and Mahler measure, linking to Alexander polynomials and Lehmer's question.
result Complexity growth of signed graphs is related to the growth rate of Alexander polynomials.

Study on mapping classes of real rational surface automorphisms, focusing on reducible maps and pseudo-Anosov maps.

problem Investigating the mapping classes of real rational surface automorphisms and their restrictions.
method Analysis of reducible maps, determination of pseudo-Anosov mapping classes, and comparison with Penner's construction.
result Realized Lehmer's number as the stretch factor of a pseudo-Anosov map on a specific surface.

SmartDCA improves investment returns by adjusting purchases based on prices.

problem Inefficiency of Dollar-Cost Averaging (DCA) in volatile markets.
method Developed SmartDCA, a more efficient investment strategy that adjusts purchases based on price levels, and analyzed its performance using mathematical inequalities and mean definitions.
result SmartDCA outperforms DCA in long-term investments, with higher performance gains for higher power values of ρρ.

Lueck expressed the Gromov norm of a knot complement in terms of an infinite series that can be computed from a presentation of the fundamental group of the knot complement. In this note we show that Lueck's formula, applied to torus knots, yields surprising power series expansions for the logarithm function. This gene…

2006-11-01abs ↗pdf ↗

This paper presents a construction of fibered links (K,Σ)(K,Σ) out of chord diagrams $\sL$. Let ΓΓ be the incidence graph of $\sL$. Under certain conditions on $\sL$ the symmetrized Seifert matrix of (K,Σ)(K,Σ) equals the bilinear form of the simply-laced Coxeter system (W,S)(W,S) associated to ΓΓ; and the monodromy of $(K,Σ)…

2002-04-02abs ↗pdf ↗

In this paper we prove that there is a direct relationship between Salem numbers and translation lengths of hyperbolic elements of arithmetic hyperbolic groups that are determined by a quadratic form over a totally real number field. As an application we determine a sharp lower bound for the length of a closed geodesic…

2015-06-11abs ↗pdf ↗

The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian group by graph automorphisms, with finite quotient) the Mahler measure of its Lap…

2017-01-21abs ↗pdf ↗

Study on instanton homology of pretzel knots and pillowcase Floer homology.

problem Investigating instanton knot homology and Floer homology for a family of pretzel knots.
method Analyzes the reduced singular instanton knot homology and computes bounding cochains in the pillowcase.
result Computed bounding cochains in the pillowcase, revealing a sharp experimental law and rigidity asymmetry.

Study extends geodesic ray transform results to orientable surfaces.

problem Characterize and stabilize mixed and transverse ray transforms on surfaces.
method Algebraic arguments applied to various geometries and ray transforms.
result Characterization of kernel and stability for mixed and transverse ray transforms on orientable surfaces.

The paper introduces models to learn generalized transformation equivariant representations.

problem Capturing intrinsic visual structures equivariant to various transformations.
method Deterministic and probabilistic AutoEncoding Transformations (AET and AVT) models trained to learn visual representations from generic groups of transformations.
result Generalized TERs (GTERs) that are equivariant to transformations in a more general fashion.

New filter bank sparsifying transforms outperform patch-based methods for image denoising.

problem Improving image denoising performance using data-adaptive sparsifying transforms.
method Proposes a new transform learning framework using undecimated perfect reconstruction filter banks, allowing independent filter length choice.
result Filter bank sparsifying transforms outperform existing patch-based methods for image denoising.

Proposes differential and integral invariants under Mobius transformation.

problem Handling non-rigid deformation in 2-D and 3-D shapes.
method Focuses on Mobius transformation, proposes differential and integral invariants.
result Proposes differential and integral invariants under Mobius transformation.

This paper investigates efficient Transformers and finds they scale with problem size.

problem Finding suitable replacements for standard Transformers in large-scale tasks.
method Modeling efficient Transformers (Sparse and Linear) as Dynamic Programming problems and analyzing their reasoning capabilities.
result Efficient Transformers scale with problem size, but can be more efficient for certain DP problems.

Study normal operators of double fibration transforms with conjugate points.

problem Normal operators of double fibration transforms with conjugate points.
method Stable conditions on the distribution of conjugate points, splitting into elliptic and Fourier integral operators.
result Normal operator splits into an elliptic pseudodifferential operator and Fourier integral operators.

Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.

problem Redundant attention heads in transformers degrade performance and efficiency.
method Transformer-MGK replaces redundant heads with a mixture of Gaussian keys.
result Transformer-MGK accelerates training and inference, reduces parameters and FLOPs, and achieves comparable or better accuracy.

Adversarial learning improves image augmentation for neural networks.

problem Improving data augmentation for neural networks with limited data.
method Adversarial learning using an encoder-decoder architecture with a spatial transformer network.
result Our approach outperforms previous generative data augmentation methods.

The paper examines how polarized curves behave near singular points.

problem Analyzing the behavior of polarized curves near singular points.
method Investigates the limiting behavior of Darboux and Calapso transforms of polarized curves in the conformal n-dimensional sphere.
result For a pole of first order, all transforms converge to the original curve. For a pole of second order, a generic Darboux transform converges, but a Calapso transform has a limit point or circle.

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

2012-11-10abs ↗pdf ↗

Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.

problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.

The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …

2014-12-18abs ↗pdf ↗

Geometric approach uses Bäcklund transformations to create integrable discrete analogs of surface nets.

problem Creating integrable discrete analogs of surface nets and conjugate nets.
method Interpreting classical differential geometry results through Bäcklund transformations and applying permutability properties.
result Integrable discrete analogs of asymptotic and conjugate nets are constructed.