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

223446669892 · Jun 202019922001200920172026
48 results for Lehmer's problem

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.

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 ↗

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

2018-05-13abs ↗pdf ↗

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 ↗

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 ρρ.

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 ↗

We reformulate Lehmer's question from 1933 and a question due to Schinzel and Zassenhaus from 1965 in terms of a comparison of the Mahler measures and the houses, respectively, of monic integer reciprocal and skew-reciprocal polynomials of the same degree. This entails that understanding the difference between orientat…

2018-12-12abs ↗pdf ↗

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 ↗

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 ↗

We survey the status of some decision problems for 3-manifolds and their fundamental groups. This includes the classical decision problems for finitely presented groups (Word Problem, Conjugacy Problem, Isomorphism Problem), and also the Homeomorphism Problem for 3-manifolds and the Membership Problem for 3-manifold gr…

2014-05-24abs ↗pdf ↗

Optimal transport reformulates multiple quantile hedging problem.

problem Multiple quantile hedging problem in incomplete markets.
method Reformulated as Monge optimal transport problem, introduced Kantorovitch version, proved no duality gap.
result Multiple quantile hedging problem can be seen as semi-discrete optimal transport problem.

This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the optimization problems which yield to the eigenvalue and generalized eigenvalue problems. We also prov…

2019-03-25abs ↗pdf ↗

This paper solves the Christoffel problem in hyperbolic space and its equivalent on spheres.

problem Prescribing curvatures for convex hypersurfaces in hyperbolic space.
method Proving a full rank theorem to establish the existence of solutions.
result Existence of solutions to the Christoffel problem and its equivalent Nirenberg-Kazdan-Warner problem on spheres.

In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…

2016-09-18abs ↗pdf ↗

Study proves only origin-centered spheres solve certain curvature problems.

problem Proving uniqueness of solutions to curvature problems.
method Using the Heintze-Karcher inequality, the study proves the uniqueness of smooth, strictly convex solutions to a class of Minkowski type problems.
result Only origin-centered spheres solve isotropic and LpL_p-Gaussian-Minkowski problems.

MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.

problem Solving math problems expressed in natural language.
method MathChat is a conversational framework combining an LLM agent and a user proxy agent for collaborative problem-solving.
result MathChat improves tool-using prompting methods by 6% on difficult math problems.

The paper solves a generalized Christoffel-Minkowski problem using a curvature flow.

problem Solving the (p,q)-Christoffel-Minkowski problem.
method Investigating the problem via an expanding curvature flow.
result Existence and uniqueness of smooth solutions to the (p,q)-Christoffel-Minkowski problem.

A new method solves complex control problems with random coefficients.

problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.

This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some necessary definitions and motivations, problems and some discussions of them. For ea…

2007-04-22abs ↗pdf ↗

We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…

2013-05-20abs ↗pdf ↗

We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…

2019-09-04abs ↗pdf ↗

Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types…

2019-09-06abs ↗pdf ↗

This paper solves the dual Minkowski problem for q-torsional rigidity.

problem The dual Minkowski problem for q-torsional rigidity.
method Introduced the p-th dual q-torsional measure and solved the p-th dual Minkowski problem for q-torsional rigidity using a Gauss curvature flow.
result Existence of smooth even and non-even solutions to the p-th dual Minkowski problem for q-torsional rigidity.

Study on geometric variational problems for existence, regularity, and uniqueness of solutions.

problem Geometric variational problems, focusing on existence, regularity, and uniqueness of solutions.
method Formulated in Federer and Fleming's theory of currents, discussed the existence theory, and presented core ideas of the (interior) regularity theory for area-minimizing currents and optimal transport paths. Two original results on generic uniqueness of solutions were presented.
result Generic uniqueness of solutions for both Plateau's problem and optimal branched transport problem.