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

82164245327 · Jun 202019922001200920172026
48 results for admissible lattice points

Spin Lefschetz fibrations can represent any group and lattice point.

problem Representing groups and lattice points using Lefschetz fibrations.
method Proving any finitely presented group and admissible lattice point can be realized as a spin Lefschetz fibration.
result Spin Lefschetz fibrations can represent any group and lattice point.

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.

We address the problem of classifying discrete differential-geometric Poisson brackets (dDGPBs) of any fixed order on target space of dimension 1. It is proved that these Poisson brackets (PBs) are in one-to-one correspondence with the intersection points of certain projective hypersurfaces. In addition, they can be re…

2011-09-20abs ↗pdf ↗

New methods classify convex lattice polygons for affine dimers.

problem Not all convex lattice polygons are characteristic polygons of affine dimers.
method General constructions and algorithm for finding affine dimers with prescribed polygons.
result All lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.

Discrete knot theory models use lattice-filtered graphs to detect merging knot components.

problem Detecting merging knot components in discrete models.
method Lattice-filtered move graphs to model knot types, identifying connected components and merge scales.
result Merge scale defined by connected components of lattice-filtered move graphs, with specific examples for the figure-eight knot.

Growth rate of Dehn twist lattice points in Teichmüller space is slower than mapping class group lattice points.

problem Analyzing the growth rate of Dehn twist lattice points in Teichmüller space.
method Comparing growth rates of Dehn twist, mapping class group, and multi-twist lattice points.
result The growth rate of Dehn twist lattice points is coarsely asymptotic to $e^{ rac{h}{2}R}$, slower than the mapping class group.

A Teichmuller lattice is the orbit of a point in Teichmuller space under the action of the mapping class group. We show that the proportion of lattice points in a ball of radius r which are not pseudo-Anosov tends to zero as r tends to infinity. In fact, we show that if R is a subset of the mapping class group, whose e…

2009-01-18abs ↗pdf ↗

In this paper, first and second type admissible Mannheim partner curves are defined in pseudo-Galilean space G31G_3^1. Moreover, it is proved that the distance between the reciprocal points of both of first and second type admissible Mannheim curves and the torsions of these curves are constant. Furthermore, the relatio…

2010-01-14abs ↗pdf ↗

Research examines correlations of complex logarithms of lattice points, showing level repulsion and Poissonian behavior.

problem Analyzing correlations of complex logarithms of lattice points.
method Proving existence of pair correlation functions and examining behavior at various scalings.
result Level repulsion observed at linear scaling, Poissonian behavior at sublinear scalings.

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 ↗

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

Deep convolutional neural networks (CNNs) have shown outstanding performance in the task of semantically segmenting images. However, applying the same methods on 3D data still poses challenges due to the heavy memory requirements and the lack of structured data. Here, we propose LatticeNet, a novel approach for 3D sema…

2019-12-12abs ↗pdf ↗

The paper establishes inequalities for convex curves and applies them to lattice point estimates.

problem Estimating the number of lattice points on convex curves.
method Developed comparison theorems for affine curves and used them to estimate areas and lattice points.
result Established inequalities for areas of inscribed triangles in terms of affine curvature and distance.

We prove that a potential qq can be reconstructed from the Dirichlet-to-Neumann map for the Schrodinger operator Δg+q-Δ_g + q in a fixed admissible 3-dimensional Riemannian manifold (M,g)(M,g). We also show that an admissible metric gg in a fixed conformal class can be constructed from the Dirichlet-to-Neumann map for $Δ_…

2010-11-02abs ↗pdf ↗

Let $\A$ be a line arrangement in the complex projective plane $\PP^2$. Denote by MM its complement and by $\M$ the set of points in $\A$ with multiplicity at least 3. A rank one local system L\mathcal{L} on MM is admissible if roughly speaking the dimension of the cohomology groups Hm(M,L)H^m(M,\mathcal{L}) can be compu…

2012-07-18abs ↗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.

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 ↗

We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological question was recently solved, but the lattice point problem is still open.

2006-02-17abs ↗pdf ↗

We study the topology of admissible-loop spaces on a step-two Carnot group G. We use a Morse-Bott theory argument to study the structure and the number of geodesics on G connecting the origin with a 'vertical' point (geodesics are critical points of the 'Energy' functional, defined on the loop space). These geodesics t…

2013-11-26abs ↗pdf ↗

In a joint work with Saji, the second and the third authors gave an intrinsic formulation of wave fronts and proved a realization theorem of wave fronts in space forms. As an application, we show that the following four objects are essentially same; * conformally flat n-manifolds (n>=3) with admissible singular points …

2010-01-25abs ↗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 ↗

New method for geodesics of multivariate normals, derived from a Toda lattice.

problem Computing geodesics of multivariate normal distributions.
method Using block Cholesky decomposition and a natural Riemannian submersion, a new Toda lattice type Lax pair is derived.
result A new Toda lattice type Lax pair derived from geodesics and block Cholesky decomposition.

We prove that any action of a higher rank lattice on a Gromov-hyperbolic space is elementary. More precisely, it is either elliptic or parabolic. This is a large generalization of the fact that any action of a higher rank lattice on a tree has a fixed point. A consequence is that any quasi-action of a higher rank latti…

2016-07-07abs ↗pdf ↗

In this work we will build a fundamental domain for Deligne-Mostow lattices in PU(2,1) with 2-fold symmetry, which complete the whole list of Deligne-Mostow lattices in dimension 2. These lattices were introduced by Deligne and Mostow using monodromy of hypergeometric functions and have been reinterpreted by Thurston a…

2017-08-17abs ↗pdf ↗

Machine learning finds a compact fixed point action for SU(3) gauge theory.

problem Finding accurate and compact parametrizations of fixed point actions for SU(3) gauge theory.
method Used machine learning, specifically a gauge equivariant convolutional neural network.
result Obtained a superior parametrization of a fixed point action for SU(3) gauge theory.

Combining forecasts of 16 ED causes improves accuracy and stability.

problem Forecasting accuracy and stability for ED admissions is poor due to model uncertainty and limited data.
method High-dimensional forecast combinations of 16 cause-specific ED forecasts using extensive covariates.
result Forecast combinations yield forecast accuracies of 3.81%-23.54% across causes, outperforming individual models in 50% of scenarios.

We are concerned with unbounded sets of RN\mathbb{R}^N whose boundary has constant nonlocal (or fractional) mean curvature, which we call CNMC sets. This is the equation associated to critical points of the fractional perimeter functional under a volume constraint. We construct CNMC sets which are the countable union o…

2017-02-04abs ↗pdf ↗

CDP reduces point cloud dimensions by preserving detour-induced local non-convexity.

problem Preserving local non-convexity in point cloud dimensionality reduction.
method CDP builds a k-NN graph, identifies admissible pairs, aggregates normalized directions, and uses top-k eigenvectors for projection.
result CDP provides verifiable guarantees on post-projection distortion and direction energy.