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

0111 · Mar 199919922001200920172026
9 results for half-integrable

Suppose that a hyperbolic knot in S3S^3 admits a finite surgery, Boyer and Zhang proved that the surgery slope must be either integral or half-integral, and they conjectured that the latter case does not happen. Using the correction terms in Heegaard Floer homology, we prove that if a hyperbolic knot in S3S^3 admits a …

2013-10-04abs ↗pdf ↗

The equations for a G_2-structure with torsion on a product M^7 = N^6 x S^1 are studied in relation to the induced SU(3)-structure on N^6. All solutions are found in the case when the Lee-form of the G_2-structure is non-zero and N^6 is a six-dimensional nilmanifold with half-integrable SU(3)-structure. Special propert…

2004-04-30abs ↗pdf ↗

For a hyperbolic knot in the 3-sphere, at most finitely many Dehn surgeries yield non-hyperbolic 3-manifolds. As a typical case of such an exceptional surgery, a toroidal surgery is one that yields a closed 3-manifold containing an incompressible torus. The slope corresponding to a toroidal surgery, called a toroidal s…

2003-12-10abs ↗pdf ↗

The discrete Nahm equations, a system of matrix valued difference equations, arose in the work of Braam and Austin on half-integral mass hyperbolic monopoles. We show that the discrete Nahm equations are completely integrable in a natural sense: to any solution we can associate a spectral curve and a holomorphic line-b…

1999-03-08abs ↗pdf ↗

Let DD be a diagram of an alternating knot with unknotting number one. The branched double cover of S3S^3 branched over DD is an L-space obtained by half integral surgery on a knot KDK_D. We denote the set of all such knots KDK_D by D\mathcal D. We characterize when KDDK_D\in \mathcal D is a torus knot, a satellite k…

2016-10-03abs ↗pdf ↗

New method combines QQA and gradient-based sampling for combinatorial optimization.

problem Scalability challenges in learning-based solvers for combinatorial optimization.
method Integrates gradient-based update through continuous relaxation with Quasi-Quantum Annealing (QQA) and parallel communication.
result Achieves superior speed-quality trade-offs for large-scale instances.

We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an nn-vertex complete graph that needs to be inferred from noisy edge measurements. The measurements are independent and distributed according to $\calP_n$ for edges in the cycle and $\calQ_n$ otherwise. This …

2018-04-15abs ↗pdf ↗