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

591418 · May 202619922001200920172026
48 results for nonuniform lattices

This paper studies the covolumes of nonuniform arithmetic lattices in PU(n, 1). We determine the smallest covolume nonuniform arithmetic lattices for each n, the number of minimal covolume lattices for each n, and study the growth of the minimal covolume as n varies. In particular, there is a unique lattice (up to conj…

2011-07-26abs ↗pdf ↗

For any n>1 we determine the uniform and nonuniform lattices of the smallest covolume in the Lie group Sp(n,1). We explicitly describe them in terms of the ring of Hurwitz integers in the nonuniform case with n even, respectively, of the icosian ring in the uniform case for all n>1.

2018-02-21abs ↗pdf ↗

Let ΓΓ be a nonuniform lattice acting on real hyperbolic n-space. We show that in dimension greater than or equal to 4, the volume of a representation is constant on each connected component of the representation variety of ΓΓ in SO(n,1). Furthermore, in dimensions 2 and 3, there is a semialgebraic subset of the repr…

2013-10-04abs ↗pdf ↗

If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct product SL(2,R)^m x SL(2,C)^n$, with m + n > 1. (In geometric terms, this can be in…

2007-05-30abs ↗pdf ↗

We prove noncoherence of certain families of lattices in the isometry group of the hyperbolic n-space for n greater than 3. For instance, every nonuniform arithmetic lattice in SO(n,1) is noncoherent, provided that n is at least 6.

2006-08-16abs ↗pdf ↗

We prove Zimmer's conjecture for C2C^2 actions by finite-index subgroups of SL(m,Z)\mathrm{SL}(m,\mathbb{Z}) provided m>3m>3. The method utilizes many ingredients from our earlier proof of the conjecture for actions by cocompact lattices in SL(m,R)\mathrm{SL}(m,\mathbb{R}) but new ideas are needed to overcome the lack of compactn…

2017-10-07abs ↗pdf ↗

If ΓΓ is any nonuniform lattice in the group PU(2,1){\rm PU}(2,1), let Γ\overlineΓ be the quotient of ΓΓ obtained by filling the cusps of ΓΓ (i.e. killing the center of parabolic subgroups). Assuming that such a lattice ΓΓ has positive first Betti number, we prove that for any sufficiently deep subgroup of finite index…

2014-10-30abs ↗pdf ↗

We determine the number of cusps of minimal Picard modular surfaces. The proof also counts cusps of other Picard modular surfaces of arithmetic interest. Consequently, for each N > 0 there are finitely many commensurability classes of nonuniform arithmetic lattices in SU(2, 1) that contain an N-cusped surface. We also …

2010-05-12abs ↗pdf ↗

New approach to nonuniform learnability using measure theory.

problem Nonuniform learnability of hypotheses with varying sample sizes.
method Measure theoretic approach to redefine nonuniform learnability, introducing a new algorithm (Generalize Measure Learnability).
result Achieved statistical consistency in learning countable hypothesis classes.

Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but injective exponential maps. A generalization of the thickness formula is obtaine…

2007-05-16abs ↗pdf ↗

New method shows Hessian estimator from random samples converges to true Hessian on complex manifolds.

problem Uncertainty in Hessian estimator accuracy on complex manifolds with boundaries and nonuniform sampling.
method Locally fitting quadratic polynomials, rigorous theoretical analysis under mild conditions.
result The Hessian estimator asymptotically converges to the true Hessian, even near boundaries.

The paper explores the dynamics of composite symplectic Dehn twists with nonuniform hyperbolicity.

problem Understanding the dynamics and properties of composite symplectic Dehn twists.
method Analyzing the form of nonuniform hyperbolicity, growth of Floer cohomology, and classification of symplectic mapping classes.
result Composite symplectic Dehn twists exhibit positive topological entropy and exponential growth in Floer cohomology.

Deep networks adapt to function regularity and data distribution.

problem Understanding deep learning's adaptability to function regularity and data distribution.
method Developed nonparametric approximation and estimation theories for a broad class of functions using deep ReLU networks.
result Deep neural networks are adaptive to different regularity of functions and nonuniform data distributions.

Improves statistical inference using machine learning predictions with imputed data.

problem Invalid statistical inference due to machine learning prediction errors.
method Bootstrap confidence intervals for nonuniform samples and arbitrary imputed features.
result Valid confidence intervals without assumptions on machine learning model quality.

ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.

problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.

Framework for designing nonlinearities in neural networks with slope constraints.

problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.

T-Rex uses EM to fit robust factor models in noisy data.

problem Robustly fitting factor models in high-dimensional data with heavy tails and outliers.
method Expectation-Maximization (EM) algorithm based on Tyler's M-estimator for elliptical distributions.
result Demonstrates robustness in direction-of-arrival estimation and subspace recovery.

This paper optimizes subsampling for large datasets using Poisson distribution.

problem Efficiently subsample large datasets for quasi-likelihood estimation.
method Derives optimal Poisson subsampling probabilities and develops a distributed subsampling framework.
result Consistent and asymptotically normal estimators are obtained.

Improved estimation for imbalanced data using log odds correction and optimal sampling.

problem Parameter estimation with nonuniform negative sampling for imbalanced data.
method Derive asymptotic distribution of IPW estimator, derive optimal sampling probability, propose likelihood-based estimator.
result Improved estimator has the smallest asymptotic variance.

This paper proposes BAT to balance accuracy and robustness in adversarial training.

problem Balancing accuracy and robustness in adversarial training models.
method Blind adversarial training (BAT) uses a cutoff-scale strategy to adaptively estimate a nonuniform budget for AEs.
result BAT improves the overall robustness of adversarial training models.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…

2011-11-21abs ↗pdf ↗

We give a simple example showing that a knot or link diagram that lies in the Z2{\mathbb{Z}}^2 lattice is not necessarily the projection of a lattice stick knot or link in the Z3{\mathbb{Z}}^3 lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the Z2{\mathbb{Z}}^2 lat…

2018-03-09abs ↗pdf ↗

We explore hybrid subgroups of certain non-arithmetic lattices in PU(2,1)\mathrm{PU}(2,1). We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in PU(1,1)\mathrm{PU}(1,1).

2019-05-29abs ↗pdf ↗

The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.

problem Locally finite 2-complexes and their automorphism groups contain incommensurable lattices.
method Constructing lattices in combinatorial models of Baumslag-Solitar groups and analyzing their properties.
result The constructed lattices are incommensurable and have specific properties like isomorphic Cayley graphs.

Proves a lattice version of the Atiyah-Singer index theorem.

problem Index problems of Wilson-Dirac operators on lattice approximations of manifolds.
method Formulates and proves a KK-theoretic formula for an index-type invariant.
result Main theorem gives a formula for an index-type invariant of operators on lattice approximations of closed integral affine manifolds.

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More specifically, we show that for a large class of arithmetic lattices in SO(n,1) it …

2018-09-07abs ↗pdf ↗