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

Trend · papers per month

9182635 · Jun 202019922001200920172026
48 results for frequency comb

Combings of oriented compact 3-manifolds are homotopy classes of nowhere zero vector fields in these manifolds. A first known invariant of a combing is its Euler class, that is the Euler class of the normal bundle to a combing representative in the tangent bundle of the 3-manifold MM. It only depends on the Spinc^c-s…

2012-09-13abs ↗pdf ↗

In high frequency financial data not only returns but also waiting times between trades are random variables. In this work, we analyze the spectra of the waiting-time processes for tick-by-tick trades. The numerical problem, strictly related with the real inversion of Laplace transforms, is analyzed by using Tikhonov's…

2008-01-19abs ↗pdf ↗

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a polynomial algorithm which performs braid combing. This procedure can be applied to braid…

2017-12-05abs ↗pdf ↗

A closed formula is obtained for the integral Hˉg1κ1ψ2g2\int_{\mathcal{\bar{H}}_g^1}κ_{1}ψ^{2g-2} of tautological classes over the locus of hyperelliptic Weierstraß points in the moduli space of curves. As a corollary, a relation between Hodge integrals is obtained. The calculation utilizes the homeomorphism between the moduli…

2006-10-19abs ↗pdf ↗

The Theta invariant is the simplest 3-manifold invariant defined with configuration space integrals. It is actually an invariant of rational homology spheres equipped with a combing over the complement of a point. It can be computed as the algebraic intersection of three propagators associated to a given combing X in t…

2012-09-14abs ↗pdf ↗

This research connects combinatorial Teichmüller space geometry to Weil-Petersson geometry.

problem Understanding the geometry of combinatorial Teichmüller space.
method Developed a parallel between combinatorial Teichmüller space and Weil-Petersson geometry, using measured foliations and Fenchel-Nielsen coordinates.
result Established a geometric recursion and topological recursion for mapping class group invariants.

The invariant ΘΘ is an invariant of rational homology 3-spheres MM equipped with a combing XX over the complement of a point. It is related to the Casson-Walker invariant λλ by the formula Θ(M,X)=6λ(M)+p1(X)/4Θ(M,X)=6λ(M)+p_1(X)/4, where p1p_1 is an invariant of combings that is simply related to a Gompf invariant. In [arXiv:1209.32…

2014-02-10abs ↗pdf ↗

We assume the market price to diffuse in a hierarchical comb of barriers, the heights of which represent the importance of new information entering the market. We find fat tails with the desired exponent for the price change distribution, and effective multifractality for intermediate times.

2002-05-04abs ↗pdf ↗

The paper computes the Kauffman bracket skein module of (2,2p+1)(2, 2p+1)-torus knots using braids.

problem Computing the Kauffman bracket skein module of (2,2p+1)(2, 2p+1)-torus knots.
method Using geometric mixed braids and parting/combing techniques, the paper establishes a relation between the module and the genus 2 handlebody, and computes the module using a basis of the handlebody's module.
result A basis for the Kauffman bracket skein module of (2,2p+1)(2, 2p+1)-torus knots is found.

Let BnB_n denote the classical braid group on nn strands and let the {\em mixed braid group} Bm,nB_{m,n} be the subgroup of Bm+nB_{m+n} comprising braids for which the first mm strands form the identity braid. Let Bm,=nBm,nB_{m,\infty}=\cup_nB_{m,n}. We will describe explicit algebraic moves on Bm,B_{m,\infty} such that equivale…

2004-05-26abs ↗pdf ↗

Simplified combinatorial descriptions of branched spines for 3-manifolds using primary MP move and sliding moves.

problem Combinatorial descriptions of branched spines for 3-manifolds and their equivalence relations.
method Demonstrated that 16 MP moves on branched spines are derived from a primary MP move, pure sliding moves, and their inverses.
result Simpler combinatorial descriptions for closed 3-manifolds and combed 3-manifolds.

This work studies the entity-wise topical behavior from massive network logs. Both the temporal and the spatial relationships of the behavior are explored with the learning architectures combing the recurrent neural network (RNN) and the convolutional neural network (CNN). To make the behavioral data appropriate for th…

2017-05-02abs ↗pdf ↗

Spaces containing compact subsets with polyhedral complements are studied.

problem Characterizing and understanding spaces with specific topological properties.
method Introduced coronated polyhedra and used them to derive new cohomology and homotopy sequences.
result Spaces with the specified property have well-defined cohomology and homotopy sequences.

This paper is a systematic approach to the construction of coronas (i.e. Higson dominated boundaries at infinity) of combable spaces. We introduce three additional properties for combings: properness, coherence and expandingness. Properness is the condition under which our construction of the corona works. Under the as…

2017-11-18abs ↗pdf ↗

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions, one can restrict to simplicial spheres of particular shapes, called "round" and "u…

2015-07-06abs ↗pdf ↗

In this note it is shown that Berwald spaces admitting the same norm-preserving torsion-free affine connection have the same (weighted) Ricci curvatures. Combing this with Szabó's Berwald metrization theorem one can apply the Cheeger-Gromoll splitting theorem in order to get a full structure theorem for Berwald spaces …

2015-02-12abs ↗pdf ↗

The paper finds minimum Steklov eigenvalues on combinatorial graphs.

problem Finding the minimum Steklov eigenvalues on combinatorial graphs.
method Extending Friedman's nodal domain theory for Laplacian eigenfunctions to Steklov eigenfunctions.
result The minimum of the imthi^{ m th} Steklov eigenvalue on a connected combinatorial graph is essentially attained by a star or a regular comb with minimal brooms.

HyFAD improves time series imputation by combining time and frequency diffusion.

problem Improve time series imputation by handling frequency-sensitive denoising and balancing global and local dynamics.
method HyFAD is a hybrid time-frequency diffusion model with frequency-aware embedding, built on DDPM paradigm.
result HyFAD achieves state-of-the-art performance in time series imputation.

SSMs have a built-in bias towards low-frequency components, which can be adjusted.

problem Frequency bias in SSMs affects their performance on long-range sequences.
method Proposed two mechanisms to tune frequency bias: scaling initialization or applying a Sobolev-norm-based filter.
result Tuning frequency bias improves SSMs' performance on long-range sequence learning tasks.

In this paper we describe braid equivalence for knots and links in a 3-manifold MM obtained by rational surgery along a framed link in S3S^3. We first prove a sharpened version of the Reidemeister theorem for links in MM. We then give geometric formulations of the braid equivalence via mixed braids in S3S^3 using the…

2013-11-08abs ↗pdf ↗

The paper examines how parabolic frequency behaves under Ricci flow and Ricci-harmonic flow on manifolds.

problem Understanding the behavior of parabolic frequency under Ricci flow and Ricci-harmonic flow.
method Investigates the monotonicity of parabolic frequency for solutions of linear and heat equations with bounded curvatures.
result Establishes monotonicity results for parabolic frequency under specific curvature conditions.

New method constrains CNN filter frequencies to improve robustness.

problem CNN bias towards low frequency components, leading to poor performance in scenario transformations.
method Frequency domain regularization by constraining filter spectra, training valid frequency range end-to-end.
result Demonstrated effectiveness in defending adversarial perturbations, reducing generalization gap, and improving transfer learning.

Study uses multi-kernel Hawkes models to analyze high-frequency price dynamics.

problem Understanding responsive speeds of market participants in high-frequency trading.
method Multi-kernel Hawkes models with conditional Hessian analysis for optimization.
result Existence of multi-kernels (UHF, VHF, HF) in high-frequency price dynamics.

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

Proves monotonicity of parabolic frequency on all manifolds without curvature assumptions.

problem Monotonicity of parabolic frequency on manifolds.
method Analyzes parabolic frequency function on manifolds, proving monotonicity without curvature assumptions.
result Monotonicity of parabolic frequency on all manifolds, no curvature assumption needed.

Proposes a conservative LR estimator for infrequent data near a frequency threshold.

problem Overestimation of likelihood ratios for infrequent data near a frequency threshold.
method Conservative likelihood ratio estimator for frequencies slightly above a threshold.
result Improves prediction accuracy in named entity context prediction.

Deeper neural networks learn lower frequency functions faster, according to a new principle.

problem Understanding why deeper learning is faster.
method Fourier analysis and filtering method to separate and analyze the frequency distribution of neural network outputs.
result Deeper hidden layers in neural networks bias towards lower frequency functions during training.