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

3671107142 · Jun 202019922001200920172026
48 results for Lattice reduction

The lattice cohomology of a plumbed 3--manifold MM associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of MM, and in the comparison of the topological properties with analytic ones when MM is realized as complex analytic singularity link. By defini…

2013-02-19abs ↗pdf ↗

We introduce the Koenigs lattice, which is a new integrable reduction of the quadrilateral lattice (discrete conjugate net) and provides natural integrable discrete analogue of the Koenigs net. We construct the Darboux-type transformations of the Koenigs lattice and we show permutability of superpositions of such trans…

2002-03-07abs ↗pdf ↗

In this paper we investigate flows on discrete curves in $\C^2$, $\CP^1$, and $\C$. A novel interpretation of the one dimensional Toda lattice hierarchy and reductions thereof as flows on discrete curves will be given.

2002-08-23abs ↗pdf ↗

The asymptotic lattices and their transformations are studied within the line geometry approach. It is shown that the discrete asymptotic nets are represented by isotropic congruences in the Plucker quadric. On the basis of the Lelieuvre-type representation of asymptotic lattices and of the discrete analog of the Mouta…

1999-09-16abs ↗pdf ↗

Paper improves distributed mean estimation and variance reduction without relying on input norm.

problem Distributed mean estimation and variance reduction with large input norms.
method Quantization and lattice theory connection for improved error bounds.
result Output error bounds depend only on input distance, not norm.

Reduces learning periodic neural networks to lattice problems, proving hardness under cryptographic assumptions.

problem Learning single periodic neurons in noisy environments.
method Reduction to worst-case lattice problems, using LLL algorithm.
result Polynomial-time algorithms for learning these functions are hard under cryptographic assumptions.

The main aim of this paper is the description of a large class of lattices in some nilpotent Lie groups, sometimes filiformes, carrying a flat left invariant linear connection anf often a left invariant symplectic form. As a consequence we obtain an infinity of, non homeomorphic, compact affine or symplectic manifolds.…

2012-08-13abs ↗pdf ↗

The paper introduces a method to decorrelate circular coordinates using lattice reduction.

problem Geometric correlation between circle-valued maps when multiple cohomology classes are used.
method Systematic procedure using the Lenstra--Lenstra--Lovász algorithm for constructing low energy torus-valued maps.
result A method to obtain less correlated maps from cohomology classes using integer linear combinations.

We study representations of lattices of PU(m,1) into PU(n,1). We show that if a representation is reductive and if m is at least 2, then there exists a finite energy harmonic equivariant map from complex hyperbolic m-space to complex hyperbolic n-space. This allows us to give a differential geometric proof of rigidity …

2003-09-11abs ↗pdf ↗

Google's multilingual speech recognition system combines low-level acoustic signals with language-specific recognizer signals to better predict the language of an utterance. This paper presents our experience with different signal combination methods to improve overall language identification accuracy. We compare the p…

2019-10-21abs ↗pdf ↗

We consider the multi-bump solutions of the following fractional Nirenberg problem \begin{equation}\label{01} (-Δ)^s u=K(x)u^{\frac{n+2s}{n-2s}}, \;\;\;\;u>0\;\;\text{ in }\mathbb{R}^n, \end{equation} where s(0,1)s\in (0,1) and n>2+2sn>2+2s. If KK is a periodic function in some kk variables with 1k<n2s21\leq k<\frac{n-2s}2, we pr…

2016-12-13abs ↗pdf ↗

We explain how the generalized Milnor-Wood inequality for reductive representations of a cocompact complex-hyperbolic lattice into a Hermitian Lie group translates, under the non-abelian Hodge correspondence, into various kinds of Milnor-Wood inequalities for Higgs bundles. This clarifies the relation between the repre…

2011-05-22abs ↗pdf ↗

We announce a generalization of Zimmer's cocycle superrigidity theorem proven using harmonic map techniques. This allows us to generalize many results concerning higher rank lattices to all lattices in semisimple groups with property (T)(T). In particular, our results apply to SP(1,n) and F420F_4^{-20} and lattices in tho…

2005-11-28abs ↗pdf ↗

We show that the smooth geometry of a hyperbolic 3-manifold emerges from a classical spin system defined on a 2d discrete lattice, and moreover show that the process of this "dimensional oxidation" is equivalent with the dimensional reduction of a supersymmetric gauge theory from 4d to 3d. More concretely, we propose a…

2012-03-26abs ↗pdf ↗

We consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector ββ^* from nn noisy linear observations Y=Xβ+WRnY=Xβ^*+W \in \mathbb{R}^n, for known XRn×pX \in \mathbb{R}^{n \times p} and unknown WRnW \in \mathbb{R}^n. Unlike most of the literature on this model we make no spa…

2018-03-18abs ↗pdf ↗

The paper extends a theorem to number fields without infinite places.

problem Finiteness properties of arithmetic approximate lattices.
method Geometric and homological finiteness properties for countable approximate groups.
result The finiteness length is finite and can be computed explicitly.

RCLA reduces noise in topological data analysis, preserving essential structure.

problem Noise in large datasets obscures topological features in persistent homology.
method Grid-based RCLA integrates data reduction and denoising with a threshold parameter.
result RCLA provides a theoretical guarantee and automatic parameter selection.

Study G2-instantons on specific Lie groups, finding conditions and structures.

problem Characterize G2-instantons on 2-step nilpotent Lie groups.
method Analyze connections arising from characteristic connections, use Lie group structure and torsion.
result Establish necessary and sufficient conditions for G2-instantons, define naturally reductive structures.

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 ↗

Skew parallelogram nets factorize, encompassing discrete differential geometry.

problem Factorization of polynomials in discrete differential geometry.
method Lax representation, Bäcklund transformations, factorization of polynomials.
result Skew parallelogram nets encompass all systems with polynomial representations.

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 ↗

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 ↗

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 ↗

We show that the set of even positive definite lattices that arise from smooth, simply-connected 4-manifolds bounded by a fixed homology 3-sphere can depend on more than the ranks of the lattices. We provide two homology 3-spheres with distinct sets of such lattices, each containing a distinct nonempty subset of the ra…

2018-08-30abs ↗pdf ↗