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

Trend · papers per month

51102153204 · May 202619922001200920172026
48 results for geometric lattice

L-CNNs maintain gauge symmetry on non-Abelian lattice theories.

problem Applying convolutional neural networks to non-Abelian lattice gauge theories while preserving gauge symmetry.
method Developed a geometric formulation of L-CNNs that are equivariant under global symmetries and gauge transformations.
result Convolutional operations in L-CNNs are a specific case of gauge-equivariant neural networks on SU(NN) principal bundles.

The paper explores higher property T in lattices and its connections to geometric phenomena.

problem Understanding higher property T in lattices and related geometric phenomena.
method Operator-algebraic characterizations of higher property T and connections to lattice geometry.
result Unified framework for understanding higher property T and related geometric phenomena.

The paper introduces lattice homology for integrally closed submodules and applies it to geometric invariants.

problem Computing numerical invariants of geometric objects.
method Introduces lattice homology for integrally closed submodules and applies it to geometric invariants.
result Well-defined lattice homology associated to quotient modules of type M/NM/N.

Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

problem Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
method Proving non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
result Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

We prove general superrigidity results for actions of irreducible lattices on CAT(0) spaces; first, in terms of the ideal boundary, and then for the intrinsic geometry (including for infinite-dimensional spaces). In particular, one obtains a new and self-contained proof of Margulis' superrigidity theorem for uniform ir…

2005-04-12abs ↗pdf ↗

LatFormer improves geometric reasoning by incorporating lattice symmetry priors in attention mechanisms.

problem State-of-the-art models struggle with geometric reasoning tasks in the ARC and LARC datasets.
method Introduced LatFormer, a model that uses lattice symmetry priors in attention masks.
result LatFormer requires 2 orders of magnitude fewer data than standard attention mechanisms.

This paper solves PDEs for embedding discrete lattices into smooth manifolds.

problem Embedding discrete lattices into smooth manifolds while preserving geometric and topological properties.
method Rigorous mathematical framework and analysis of partial differential equations (PDEs).
result Existence and regularity of solutions to PDEs under initial boundary conditions.

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 ↗

Tropical geometry and weighted lattices improve curve and surface fitting.

problem Fitting max-\star tropical curves and surfaces to data.
method Max-\star algebra, weighted lattices, morphological adjunctions.
result Optimal piecewise-linear regression for max-\star curves and surfaces.

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly with covolume. We obtain similar results for isotropy subgroups in lattices. Ge…

2012-09-12abs ↗pdf ↗

We study lattices in non-positively curved metric spaces. Borel density is established in that setting as well as a form of Mostow rigidity. A converse to the flat torus theorem is provided. Geometric arithmeticity results are obtained after a detour through superrigidity and arithmeticity of abstract lattices. Residua…

2009-01-08abs ↗pdf ↗

The article classifies cubiquitous sublattices and applies them to branched covers.

problem Understanding cubiquitous sublattices as obstructions to rational homology 4-balls.
method Developed a geometric Wu obstruction to classify cubiquitous sublattices and applied it to branched covers.
result Completely classified which sublattices with orthogonal bases are cubiquitous.

Proves critical exponent for ΘΘ-positive representations in discrete subgroups.

problem Determining the critical exponent for ΘΘ-positive representations.
method Analyzes discrete subgroups ΓPSL(2,R)Γ\subset \mathsf{PSL}(2,\mathbb{R}) and their geometric properties.
result Equality of critical exponent holds if and only if ΓΓ is a lattice for geometrically finite ΓΓ.

We produce a family of new, non arithmetic lattices in PU(2,1). All previously known examples were commensurable with lattices constructed by Picard, Mostow and Deligne-Mostow, and fell into 9 commensurability classes. Our groups produce 5 new distinct commensurability classes. Most of the techniques are completely gen…

2014-01-01abs ↗pdf ↗

We consider a certain hybridization construction which produces a subgroup of PU(n,1){\rm PU}(n,1) from a pair of lattices in PU(n1,1){\rm PU}(n-1,1). Among the Picard modular groups PU(2,1,Od){\rm PU}(2,1,\mathcal{O}_d), we show that the hybrid of pairs of Fuchsian subgroups PU(1,1,Od){\rm PU}(1,1,\mathcal{O}_d) is a lattice when d=1d=1 and $d=7…

2018-06-04abs ↗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 ↗

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative differential geometry. Despite of the non-commutativity between functions and (gen…

2002-12-18abs ↗pdf ↗

By studying the action of the Weyl group of a simple Lie algebra on its root lattice, we construct torsion free subgroups of small and explicitly determined index in a large infinite class of Coxeter groups. One spin-off is the construction of hyperbolic manifolds of very small volume in up to 8 dimensions.

2008-02-21abs ↗pdf ↗

The aim of this note is to give a geometric proof for classical local rigidity of lattices in semisimple Lie groups. We are reproving well known results in a more geometric (and hopefully clearer) way.

2017-01-23abs ↗pdf ↗

We study geometric consistency relations between angles on 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical transformations of a remarkable ``ultra-local'' Poisson bracket algebra defined on di…

2008-01-02abs ↗pdf ↗

To every nn-dimensional lens space LL, we associate a congruence lattice L\mathcal L in Zm\mathbb Z^m, with n=2m1n=2m-1 and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on LL with the number of lattice elements of a given 1\|\cdot\|_1-length in L\mathcal L. As a consequence, we show th…

2013-11-27abs ↗pdf ↗

This paper proves that lattice point enumeration in moduli spaces satisfies topological recursion.

problem Enumeration of lattice points in moduli spaces of curves.
method Proves topological recursion for lattice point enumeration in moduli spaces.
result The enumeration satisfies local topological recursion.

The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and versions (necessarily modified from the Euclidean setting) of the empty circumsp…

2013-08-22abs ↗pdf ↗

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 ↗

The study finds conditions for groups acting on CAT(0) cube complexes to have infinite girth.

problem Conditions for groups acting on CAT(0) cube complexes to have infinite girth.
method Analyzes lattices in automorphism groups of finite dimensional CAT(0) cube complexes.
result Groups either have infinite girth or are {locally finite}-by-{virtually abelian}.

Geometric constraints help classify hyperbolic polytopes.

problem Classifying reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
method Established geometric constraints on compact Coxeter polytopes in hyperbolic spaces.
result Geometric constraints are useful for classifying hyperbolic polytopes.

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.

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 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 ↗

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.