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 · Dec 200419922001200920172026
22 results for K2

This study uses deep learning to infer stellar parameters from short TESS and K2 observations.

problem Inferring precise stellar parameters from short-duration TESS and K2 observations.
method Developed a machine learning algorithm to infer asteroseismic parameters from one-month-long TESS observations of red giants.
result The algorithm can accurately infer ΔνΔν and νmaxν_{\mathrm{max}} for approximately 50% of TESS samples and ΔΠ1ΔΠ_{1} for about 200 young red-giants from K2.

Special curves and their characterizations are one of the main area of mathematicians and physicians. As a special curve we will mainly focus on Mannheim curve which has the following relation: k1=β(k1^2+k2^) where k1 and k2 are curvature and torsion, respectively. In the present paper we define Mannheim curves for 4-d…

2011-11-02abs ↗pdf ↗

Let G be a split semi-simple algebraic group over Q. Let S be a decorated surface, that is a topological oriented surface with a finite set of marked points on the boundary, considered modulo isotopy. We introduce a moduli space D(G,S) and define a collection of special rational coordinate systems on it. The moduli spa…

2014-10-13abs ↗pdf ↗

Let k be a knot in S3. In [8], H.N. Howards and J. Schultens introduced a method to construct a manifold decomposition of double branched cover of (S3, k) from a thin position of k. In this article, we will prove that if a thin position of k induces a thin decomposition of double branched cover of (S3,k) by Howards and…

2010-01-06abs ↗pdf ↗

Complicated generative models often result in a situation where computing the likelihood of observed data is intractable, while simulating from the conditional density given a parameter value is relatively easy. Approximate Bayesian Computation (ABC) is a paradigm that enables simulation-based posterior inference in su…

2015-02-09abs ↗pdf ↗

In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…

2016-01-17abs ↗pdf ↗

We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen ss-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension 2L2^{|L|}. The basic properties of the ss-invariant all extend to the case of links; in particular, a…

2011-07-23abs ↗pdf ↗

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all l…

2005-11-05abs ↗pdf ↗

The authors examine topological properties of the 7-dimensional Eschenburg biquotients diag(z^k1,z^k2,z^k3)\SU(3)/diag(z^l1,z^l2,z^l3). A subfamily of these spaces carry a 3-Sasakian metric. The authors show that among this subfamily there exist many 3-Sasakian spaces which are homeomorphic but not diffeomorphic. In ad…

2004-12-18abs ↗pdf ↗

We identify the Variational Principle governing inifinity-Harmonic maps, that is solutions to the Infinity-Laplacian. The system was first derived in the limit of the p-Laplacian as p->inifinity in [K2] and is recently studied in [K3]. Here we show that it is the "Euler-Lagrange PDE" of vector-valued Calculus of Variat…

2012-05-21abs ↗pdf ↗

Bayesian network framework assesses urban risks across multiple domains.

problem Complex interdependencies in urban systems.
method Bayesian Belief Networks (BBNs) with DAGs, Hill-Climbing search, BIC, K2 scoring, synthetic data, SMOTE.
result Identifies key risk factors and quantifies likelihood of cascading failures.

Model learns brevity by exposing to easy problems, improving efficiency without explicit length penalties.

problem Excessive verbosity in step-by-step reasoning models trained with RLVR.
method Retaining and up-weighting moderately easy problems as implicit length regularizers.
result Model generates solutions that are, on average, nearly twice as short without explicit length penalties.