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.

169,181 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Jan 199419922001200920182026
48 results for Niemeier lattices

Hybrid subgroups found in non-arithmetic PU(2,1) lattices.

problem Exploring hybrid subgroups in non-arithmetic PU(2,1) lattices.
method Exploring hybrid subgroups of certain non-arithmetic lattices in PU(2,1). Showing that Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).
result Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).

This work compares lattice-free and lattice-based training criteria for LVCSR.

problem Improving acoustic model performance in speech recognition.
method Direct comparison of lattice-free and lattice-based sequence discriminative training criteria using GPU.
result Lattice-free MMI performance is comparable to lattice-based criteria, while lattice-based sMBR remains superior.

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 ↗

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.

The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.

problem Residual finiteness of lattices in PU(2,1)~\widetilde{\mathrm{PU}(2,1)} and existence of smooth projective surfaces.
method Proved residual finiteness of certain lattices and constructed surfaces using central extensions.
result First examples of residually finite lattices in PU(2,1)~\widetilde{\mathrm{PU}(2,1)} and construction of surfaces with specific fundamental groups.

The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain t…

2012-05-23abs ↗pdf ↗

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.

Classifies knots by lattice size, finding unknot ratios and crossing numbers.

problem Understanding the distribution of knots within different lattice sizes.
method Introduced a new knot classification by lattice size, analyzed ratios of unknots and knots with more than 10 crossings, and compared with theoretical estimates.
result Ratio of unknots decreases exponentially with lattice size, and computational results match theoretical estimates.

Let GG be a simply connected, solvable Lie group and ΓΓ a lattice in GG. The deformation space D(Γ,G)\mathcal{D}(Γ,G) is the orbit space associated to the action of $\Aut(G)$ on the space X(Γ,G)\mathcal{X}(Γ,G) of all lattice embeddings of ΓΓ into GG. Our main result generalises the classical rigidity theorems of Mal'tsev…

2011-11-23abs ↗pdf ↗

Improved lattice field theory simulations with local-Autoregressive Conditional Normalizing Flow.

problem Efficiently sampling lattice field theories with computational challenges.
method Integrates locality into autoregressive conditional normalizing flows.
result Autocorrelation times improved by orders of magnitude for φ4φ^{4} theory on a 2D lattice.

We construct an infinite commutative lattice of groups whose dual spaces give Kauffman finite-type invariants of long virtual knots. The lattice is based "horizontally" upon the Polyak algebra and extended "vertically" using Manturov's functorial map ff. For each nn, the nn-th vertical line in the lattice contains a…

2013-03-29abs ↗pdf ↗

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple cubic, face centered cubic and body centered cubic lattices are determined. Our r…

2012-03-14abs ↗pdf ↗

Researchers reinterpret complex hyperbolic orbifolds using line arrangements.

problem Understanding complex hyperbolic orbifolds and their representations.
method Using line arrangements and branched covers over blow-ups of projective 2-space.
result New representations of 3-manifolds and additional Deligne-Mostow lattices identified.

The paper classifies a specific type of hyperbolic lattices using geometric properties.

problem Classifying (1,2)(1{,}2)-reflective anisotropic hyperbolic lattices of rank 44.
method Using geometric properties of the fundamental polyhedron of a cocompact reflection group in three-dimensional Lobachevsky space.
result A classification of (1,2)(1{,}2)-reflective anisotropic hyperbolic lattices of rank 44.

The study finds surface subgroups in cocompact lattices of H2nH^{2n} for n2n\geq2.

problem Proving the existence of surface subgroups in cocompact lattices of H2nH^{2n} for n2n\geq2.
method Analyzing cocompact lattices in SO(2n,1)\mathrm{SO}(2n,1) for n2n\geq2.
result The existence of surface subgroups within any cocompact lattice ΓΓ in SO(2n,1)\mathrm{SO}(2n,1) for n2n\geq2.

Researchers create a fundamental domain for all Deligne-Mostow lattices in PU(2,1).

problem Building a fundamental domain for all Deligne-Mostow lattices in PU(2,1).
method Using Thurston's approach, the team constructed a fundamental domain for lattices with 2-fold symmetry, completing the list of commensurability classes.
result Fundamental domains were created for all commensurability classes of Deligne-Mostow lattices in PU(2,1).

Study uses instanton Floer theory to find definite lattices from certain 4-manifolds.

problem Determining definite lattices from smooth 4-manifolds bounded by homology 3-spheres.
method Extends Froyshov's methods using instanton Floer theory.
result Identifies specific definite lattices for +1 surgery on the (2,5) torus knot.

Improved speech recognition for voice assistants by analyzing speech data.

problem Reducing false triggers in speech-enabled assistants.
method Post-processing LVCSR hypothesis lattice with a Bidirectional Lattice Recurrent Neural Network (LatticeRNN).
result LatticeRNN significantly improves detection accuracy over traditional methods.