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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for straight number

New families of knots with more straight segments than crossings.

problem Understanding knots with more straight segments than crossings.
method Presented two families of knots, computed straight number for one, and provided a theorem about alternating knots.
result Explicit computation of straight number for one family of knots and a general theorem about alternating knots.

This paper improves the efficiency of generative models by optimizing the straightness of Rectified Flow.

problem Improving the efficiency of generative models by reducing discretization error.
method Introducing a novel Piecewise Straightness parameter, γ2,T, to optimize the straightness of Rectified Flow.
result Minimizing curvature in Rectified Flow models leads to high-fidelity, one-step sampling.

Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.

problem Understanding minimal crossings of knot diagrams on a punctured sphere.
method Mathematical model of string figures using knot diagrams on xyzxyz-space with missing vertical lines, analyzing minimal crossings under Reidemeister moves.
result Minimal number of crossings of knot diagrams on a punctured sphere.

The paper triangulates Heisenberg groups with horizontal and straight simplexes.

problem Triangulating Heisenberg groups with specific regularity properties.
method Constructing triangulations with horizontal and straight simplexes on a polyhedral structure and extending to the whole Heisenberg group.
result Explicit examples of grid and triangulations provided.

Study on straight-line flows for generative modeling with theoretical obstructions.

problem Existence and obstructions of straight-line flows in generative modeling.
method Characterizations of straight-line flows through PDEs involving conditional statistics of stochastic processes.
result Sharp dichotomy in the existence of straight-line flows for targets with well-separated modes.

The lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the trefoil knot 313_1 and the figure-8 knot 414_1 are the only knot types of lattice stic…

2015-12-11abs ↗pdf ↗

We generalise a result of Garofalo and Pauls: a horizontally minimal smooth surface embedded in the Heisenberg group is locally a (straight) ruled surface, i.e. it consists of straight lines tangent to a horizontal vector field along a smooth curve. We show additionally that any horizontally minimal surface is locally …

2012-12-23abs ↗pdf ↗

The study proves a conjecture about arborescent links with many twigs.

problem Proving the meridional rank conjecture for arborescent links.
method Using an upper bound on the bridge number in terms of the maximal number of link components of the underlying tree.
result Proves the meridional rank conjecture for arborescent links with specific properties.

We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikov's property C, and Dranishnikov and Zarichnyi's straight finite decomposition complexity are preserved by constructions such as unions, free produc…

2013-09-24abs ↗pdf ↗

The lattice stick number sL(K)s_L(K) of a knot KK is defined to be the minimal number of straight line segments required to construct a stick presentation of KK in the cubic lattice. In this paper, we find an upper bound on the lattice stick number of a nontrivial knot KK, except trefoil knot, in terms of the minimal c…

2012-09-01abs ↗pdf ↗

Study of straight-line flows on a unique infinite surface.

problem Understanding straight-line flows on a specific infinite surface.
method Geometric description and characterization of periodic and drift orbits; use of rigid symmetries and Veech group.
result Complete characterization of periodic directions and proof of density of periodic and ergodic directions.

We study Fredholm properties and index formulas for Dirac operators over complete Riemannian manifolds with straight ends. An important class of examples of such manifolds are complete Riemannian manifolds with pinched negative sectional curvature and finite volume.

2010-11-10abs ↗pdf ↗

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a previous paper, it was proved that every knot and link has a quadruple crossing…

2012-11-12abs ↗pdf ↗

Negami found an upper bound on the stick number s(K)s(K) of a nontrivial knot KK in terms of the minimal crossing number c(K)c(K) of the knot which is s(K)2c(K)s(K) \leq 2 c(K). Furthermore McCabe proved s(K)c(K)+3s(K) \leq c(K) + 3 for a 22-bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we const…

2014-11-07abs ↗pdf ↗

Reintroduces straight-through estimators for binary neural networks.

problem Training neural networks with binary weights and activations is challenging due to gradient issues and discrete weight optimization.
method Derives ST methods as estimators in the SBN model, analyzes properties and estimation accuracy, explains latent weights and mirror descent method.
result Reintroduces ST methods as sound approximations and provides clearer application and improvements.

ProxQuant improves quantized neural networks using proximal operators.

problem Making neural networks work on devices with limited resources.
method Formulates quantized network training as a regularized learning problem and optimizes it via the prox-gradient method.
result ProxQuant outperforms state-of-the-art results on binary quantization and is on par with state-of-the-art on multi-bit quantization.

Fix a straight line L in Euclidean 3-space and consider the fibration of the complement of L by half-planes. A generic knot K in the complement of L has neither fiber quadrisecants nor fiber extreme secants such that K touches the corresponding half-plane at 2 points. Both types of secants occur in generic isotopies of…

2007-01-30abs ↗pdf ↗

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗pdf ↗

In this paper, we investigate the ruled surfaces generated by a straight line according to rotation minimizing frame (RMF). Using this frame of a straight line, we obtained the necessary and sufficient conditions when the ruled surface is developable. Also, we give some new results and theorems related to be the asympt…

2014-07-01abs ↗pdf ↗

The Dirichlet Laplacian in curved tubes of arbitrary cross-section rotating with respect to the Tang frame along infinite curves in Euclidean spaces of arbitrary dimension is investigated. If the reference curve is not straight and its curvatures vanish at infinity, we prove that the essential spectrum as a set coincid…

2004-12-07abs ↗pdf ↗

We investigate the structure of a Finsler manifold of nonnegative weighted Ricci curvature including a straight line, and extend the classical Cheeger-Gromoll-Lichnerowicz splitting theorem. Such a space admits a diffeomorphic, measure-preserving splitting in general. As for a special class of Berwald spaces, we can pe…

2012-03-01abs ↗pdf ↗

New insights into quantized neural networks reveal learning dynamics and generalization errors.

problem Understanding the impact of quantization hyperparameters on learning dynamics in high-dimensional models.
method Theoretical analysis and fixed-point analysis of STE dynamics in quantized models.
result STE training in quantized models converges to a plateau followed by a sharp drop in generalization error, influenced by quantization range.

A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight tubes, with K intersecting each tube in two arcs connecting the ends. We prove that t…

2009-01-11abs ↗pdf ↗

In this paper, on the first, we prove Δr=2HΔr=2H where ΔΔ is the Laplacian operator, r=(r1,r2,r3)r=\left( r_{1},r_{2},r_{3}\right) the position vector field and HH is the mean curvature vector field of a surface S\mathcal{S} in the 3-dimensional Heisenberg group H3.H_{3}. In the second, we classify the ruled surfaces by straight…

2016-05-17abs ↗pdf ↗

Study of rigid body displacements in a projective space over dual numbers with geometric interpretations.

problem Understanding rigid body displacements in a novel geometric space.
method Projective differential geometry over the ring of dual numbers.
result Existence of non-straight curves with multiple osculating tangents.

Paper justifies ST estimator using pWGF and proposes an improved variant.

problem Theoretical justification for ST estimator for discrete variables.
method Interpreted ST as pWGF simulation and proposed an improved estimator.
result Established theoretical foundation for ST estimator and improved variant.

The study compares different game-theoretic attribution methods and finds that interventional Shapley values yield less consistent results than Aumann-Shapley due to path symmetry.

problem Investigating the influence of path choice on game-theoretic attribution algorithms.
method Comparative analysis of interventional Shapley values and Generalized Integrated Gradients (GIG) methods.
result Interventional Shapley values yield less consistent attributions than Aumann-Shapley due to path symmetry and extended away from the training data manifold.

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c_3(…

2012-07-31abs ↗pdf ↗

New heat trace coefficients reveal curvature effects in polygonal domains.

problem Understanding heat trace behavior in polygonal domains with curved corners.
method Local heat trace expansion through order t1/2t^{1/2}, analyzing both Dirichlet and Neumann boundary conditions.
result Sharp sign law for the Dirichlet angular factor of the first corner-curvature heat invariant.

This paper justifies the use of straight-through estimator in training quantized neural nets.

problem Minimizing loss in quantized neural nets with vanishing gradients.
method Introduced straight-through estimator (STE) and proved its effectiveness in two-linear-layer network with binarized ReLU activations.
result Proved that the coarse gradient derived from STE is a descent direction for minimizing population loss.

The aim of this paper is to investigate properties preserved and co-preserved by coarsely nn-to-1 functions, in particular by the quotient maps XX/X\to X/\sim induced by a finite group GG acting by isometries on a metric space XX. The coarse properties we are mainly interested in are related to asymptotic dimension a…

2015-06-27abs ↗pdf ↗

The goal of this paper is to describe all local diffeomorphisms mapping a family of circles, in an open subset of $\r^3$, into straight lines. This paper contains two main results. The first is a complete description of the rectifiable collection of circles in $\r^3$ passing through one point. It turns out that to be r…

2003-01-20abs ↗pdf ↗

Study on linking numbers in random book embeddings of complete graphs.

problem Distribution and mean of linking numbers in random book embeddings of complete graphs.
method Analyzes a family of two-component links arising from random embeddings of complete graphs, using Eulerian numbers and linear growth in mean linking number.
result Mean of squared linking number over all random embeddings is $ rac{i}{6}$, where ii is the number of interior edges.