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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for point counting

Study counts and equidistributes rational points in quaternionic Heisenberg groups.

problem Counting and equidistribution of rational points in quaternionic Heisenberg groups.
method Arithmetic group actions on quaternionic hyperbolic spaces, Mertens counting formula, Neville equidistribution theorem.
result Proved Mertens counting formula and Neville equidistribution theorem for rational points over definite quaternion algebras.

Estimates point counts in Teichmüller space for mapping class groups.

problem Counting points in Teichmüller space under mapping class group actions.
method Quantitative estimates with power saving error terms for Teichmüller metric balls.
result Effectivizes asymptotic counting results of Athreya et al.

The paper counts geodesic loops on surfaces without conjugate points.

problem Counting geodesic loops on surfaces of genus at least 2 without conjugate points.
method Proves asymptotic estimates for closed geodesic loops on compact surfaces with no conjugate points.
result Generalizes classical counting results and sector theorems for surfaces of strictly negative curvature.

We show how to define and count lattice points in the moduli space $\modm_{g,n}$ of genus g curves with n labeled points. This produces a polynomial with coefficients that include the Euler characteristic of the moduli space, and tautological intersection numbers on the compactified moduli space.

2008-01-30abs ↗pdf ↗

We strongly develop the relationship between complex hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on complex hyperbolic spaces, especially in dimension 22. We prove a Mertens' formula for the integer points over a quadratic imaginary num…

2014-02-28abs ↗pdf ↗

Counting lattice points in moduli space of Klein surfaces.

problem Count lattice points in moduli space of Klein surfaces.
method Introduced metric Möbius graphs, counted lattice points weighted by non-orientability measure, deduced recursion for volumes.
result Proved refined version of Norbury's recursion and computed refined Euler characteristic.

The study counts non-crossing permutations on surfaces of any genus.

problem Counting non-crossing permutations on surfaces of any genus.
method Polygon diagrams and arc diagrams are used to represent non-crossing permutations. The count of these diagrams exhibits interesting polynomial behavior, with leading coefficients related to intersection numbers on moduli spaces.
result The count of polygon diagrams is almost polynomial in the number of points, with leading coefficients related to intersection numbers on moduli spaces.

The number of diagrams of stationary points free vector fields in the 2-disk B2\mathbb{B}^{2} is counted in the article. It is shown that the number of such diagrams with 2k2k exceptional points on the boundary S1\mathbb{S}^{1} equals 3k2(Ck+2Ck1)3^{k-2}(C_{k}+2C_{k-1}), where CkC_{k} is the corresponding Catalan number. An algo…

2018-07-10abs ↗pdf ↗

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

The paper counts mapping classes by Nielsen-Thurston type, finding growth rates for different subsets.

problem Counting mapping classes in Teichmüller space with different subsets.
method Introduced complexity length to measure negative curvature of curve complexes.
result Growth rates for finite-order, reducible, and multitwists subsets.

In this paper a neuro-robotics model capable of counting using gestures is introduced. The contribution of gestures to learning to count is tested with various model and training conditions. Two studies were presented in this article. In the first, we combine different modalities of the robot's neural network, in the s…

2019-07-09abs ↗pdf ↗

We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top degree coefficients tautological intersection numbers on the compactified moduli spac…

2010-12-29abs ↗pdf ↗

Mirzakhani's thesis counts geodesics on hyperbolic surfaces, finding a specific asymptotic formula.

problem Counting simple closed geodesics on hyperbolic surfaces.
method Inspired by lattice point counting, uses principles of homogeneous dynamics.
result The number of simple closed geodesics of length ≤ L is asymptotic to L^(6g-6) times a constant.

The study counts ideal points in 2-bridge knot complements using knot diagrams.

problem Counting ideal points in 2-bridge knot complements.
method Using knot diagrams, the structure of Serre trees for essential surfaces is determined, leading to a formula for ideal points.
result A formula for the number of ideal points associated with each incompressible surface in 2-bridge knot complements.

The counting function on the natural numbers defines a discrete Morse-Smale complex with a cohomology for which topological quantities like Morse indices, Betti numbers or counting functions for critical points of Morse index are explicitly given in number theoretical terms. The Euler characteristic of the Morse filtra…

2016-08-22abs ↗pdf ↗

We study the combinatorial geometry of "lattice" Jenkins--Strebel differentials with simple zeroes and simple poles on CP1\mathbb{C}P^1 and of the corresponding counting functions. Developing the results of M. Kontsevich we evaluate the leading term of the symmetric polynomial counting the number of such "lattice" Jenki…

2012-12-07abs ↗pdf ↗

We propose a generalization of tropical curves by dropping the rationality and integrality requirements while preserving the balancing condition. An interpretation of such curves as critical points of a certain quadratic functional allows us to settle the existence and uniqueness problem. The machinery of dual polygons…

2018-12-01abs ↗pdf ↗

We present the first framework for Gaussian-process-modulated Poisson processes when the temporal data appear in the form of panel counts. Panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observati…

2018-03-12abs ↗pdf ↗

Study on symplectic semi-characteristic using cohomology and vector fields.

problem Defining and calculating the symplectic semi-characteristic of symplectic manifolds.
method Defined using even-degree primitive cohomology and proved a counting formula using vector fields.
result Established a counting formula for symplectic semi-characteristic and derived vanishing properties.

Study a market with uncertain informed traders, finding price impact depends on both asset value and informed trader count distribution.

problem Uncertain participation of informed traders in a market with limit orders.
method Characterized equilibrium by a fixed point integral equation, analyzed large order asymptotics, solved numerically.
result Equilibrium price impact depends on both asset value and distribution of informed traders, not just expected number of informed traders.

In this article we consider a variant of Rabinowitz Floer homology in order to define a homological count of discriminant points for paths of contactomorphisms. The growth rate of this count can be seen as an analogue of Givental's nonlinear Maslov index. As an application we prove a Bott-Samelson type obstruction theo…

2011-02-17abs ↗pdf ↗

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface SS, and fix a number of points FF on its boundary. We ask: how many configurations of disjoint arcs are there on SS whose boundary is FF? We find that thi…

2015-12-30abs ↗pdf ↗

New phases identified in neural scaling laws with compute limits.

problem Understanding neural scaling laws under compute constraints.
method Solved neural scaling model with stochastic gradient descent, derived loss curves, analyzed model-parameter-count phases.
result Identified 4 phases (+3 subphases) in data-complexity/target-complexity phase-plane, derived exponents.

This paper was motivated by work of Arnold where he explains how to count "snakes", i.e. Morse functions on the real axis with prescribed behavior at infinity. This leads immediately to a count of excellent Morse functions on the circle, where following Thom's terminology, excellent means that no two critical points li…

2005-12-21abs ↗pdf ↗

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence RnR_n \to \infty, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls B(0,Rn)BdαB(0,R_n) \subset B_d^α, the dd-dimensional Poincaré ball (unit d-ball with the Poincaré metric dαd_α correspondi…

2018-02-16abs ↗pdf ↗

The study counts critical points of Steklov eigenfunctions on manifolds.

problem Counting critical points of Steklov eigenfunctions on manifolds.
method Established an identity relating indexes of eigenfunctions and their restrictions to the boundary, and used it to count critical points.
result A precise count of interior critical points of Steklov eigenfunctions in terms of manifold's Euler characteristic and boundary sign changes.

The study counts critical points in knot cobordisms using abelian and metacyclic invariants.

problem Counting critical points in knot cobordisms.
method Using homological invariants from cyclic and metacyclic branched covering spaces.
result For each pair of integers g and n, there exists a ribbon knot K with at least n critical points of each index in any genus g cobordism from K to its reverse.

ENTED efficiently decomposes binary and count tensors using nonparametric Gaussian processes.

problem Handling high-dimensional and sparse binary and count data with traditional tensor decompositions.
method ENTED uses nonparametric Gaussian processes and sparse orthogonal variational inference to handle binary and count tensors.
result ENTED outperforms traditional methods in binary and count tensor completion tasks.

Firms miscount their customers who stop buying without saying goodbye.

problem Counting non-contractual customers accurately.
method Estimating repeat purchase probabilities and extrapolating to infinite time.
result The count of alive customers is only partially identified, with a wide range of estimates.

We compute the asymptotic growth rate of the number N(C, R) of closed geodesics of length less than R in a connected component C of a stratum of quadratic differentials. We prove that for any 0 < θ< 1, the number of closed geodesics of length at most R that spend at least θ-fraction of time outside of a compact subset …

2012-06-25abs ↗pdf ↗

Counting essential surfaces in 3-manifolds yields concise formulae and detailed asymptotics.

problem Counting isotopy classes of essential surfaces in 3-manifolds.
method Normal and almost normal surfaces, Ehrhart's lattice point counting, ideal triangulations, and new essential surface testing.
result Quasi-polynomial behavior of surface counts and concise formulae for surface numbers.

We obtain a growth estimate for the number of lattice points inside any Q-Gorenstein cone. Our proof uses the result of Futaki-Ono-Wang on Sasaki-Einstein metric for the toric Sasakian manifold associated to the cone, a Yau's inequality, and the Kawasaki-Riemann-Roch formula for orbifolds.

2013-05-21abs ↗pdf ↗