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

Trend · papers per month

116231347462 · Jun 202019922001200920182026
48 results for lattice presentations

This paper finds upper bounds for lattice stick numbers of rational links with specific stick configurations.

problem Finding upper bounds for the lattice stick number of rational links with exactly 4 z-sticks.
method Using 2-circuit presentations, the paper constructs lattice stick numbers with exactly 4 z-sticks and derives upper bounds.
result Upper bounds for the lattice stick number of rational links with exactly 4 z-sticks are derived.

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

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 lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the trefoil knot 313_1 and the figure-8 knot 414_1 are the only knot types of lattice stic…

2015-12-11abs ↗pdf ↗

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.

Finite presentations for skein algebras linked to gauge field theory.

problem Understanding finite presentations for skein algebras and their relationship to gauge field theory.
method Provided finite presentations and deduced properties of stated skein algebras.
result Stated skein algebras are Koszul and isomorphic to quantum moduli algebras in gauge field theory.

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.

Study complex hyperbolic lattices and their subgroups, proving new finiteness properties.

problem Characterize subgroups of complex hyperbolic lattices.
method Analyzing homomorphisms and using arithmetic lattice properties.
result Deep subgroups of complex hyperbolic lattices admit homomorphisms to Z with specific kernel types.

A lattice based method will be presented for numerical investigations of Ricci flow. The method will be applied to the particular case of 2-dimensional axially symmetric initial data on manifolds with S^2 topology. Results will be presented that show that the method works well and agrees with results obtained using con…

2015-12-10abs ↗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.

The lattice stick number sL(K)s_L(K) of a knot KK is defined to be the minimal number of straight line segments required to construct a stick presentation of KK in the cubic lattice. In this paper, we find an upper bound on the lattice stick number of a nontrivial knot KK, except trefoil knot, in terms of the minimal c…

2012-09-01abs ↗pdf ↗

Knot lattice homology invariant of smooth knot type in rational homology spheres.

problem Invariance of knot lattice homology in rational homology spheres.
method Proving knot lattice homology invariant through doubly-filtered homotopy type.
result Knot lattice homology invariant of smooth knot type in rational homology spheres.

Study series invariants of plumbed 3-manifolds using root lattices.

problem Understanding invariants of plumbed 3-manifolds twisted by root lattices.
method Use formal series to study invariants, decompose Z^(q)\widehat{Z}(q), and compute in specific cases.
result Show that Z^(q)\widehat{Z}(q) is unique and decomposes into related series invariant under five Neumann moves.

Paper presents an efficient approach for integrating LSTM language models in LVCSR systems.

problem Difficulty in incorporating LSTM language models efficiently into LVCSR systems.
method First-pass decoding with LSTM-LM followed by lattice rescoring and hypothesis recombination.
result Competitive results on Hub5'00 and Librispeech corpora with runtime better than real-time.

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 ↗

Lat-Net compresses Lattice Boltzmann simulations using neural networks.

problem High computational and memory demands in fluid simulations.
method Convolutional autoencoders and residual connections in a fully differentiable scheme.
result Computational and memory efficient neural network that generalizes to large grid sizes and complex geometries.

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.

P. Buser and P. Sarnak showed in 1994 that the maximum, over the moduli space of Riemann surfaces of genus s, of the least conformal length of a nonseparating loop, is logarithmic in s. We present an application of (polynomially) dense Euclidean packings, to estimates for an analogous 2-dimensional conformal systolic i…

2003-02-25abs ↗pdf ↗

New method reconstructs strain and lattice spacing from neutron data.

problem Jointly reconstructing strain and lattice spacing from neutron data.
method Solves non-linear problem ensuring strain field equilibrium with knowledge of boundary conditions.
result Demonstrates ability to jointly reconstruct strain and lattice spacing from simulated data.

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 ↗

New framework for detecting complex interactions in multivariate data.

problem Insufficient pairwise measures fail to capture multivariate data complexities.
method Lattice theory and operator functions to derive higher-order information-theoretic measures.
result Streitberg Information fully characterizes all interactions among dd variables.

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).

Study on manifolds with higher-rank lattice actions in projective and conformal classes.

problem Global properties of manifolds with higher-rank lattice actions.
method Analysis of actions of cocompact lattices in higher-rank Lie groups on manifolds with projective or conformal structures.
result Manifolds with maximal real-rank are globally equivalent to their model spaces or their double covers.

Data compression speeds up machine learning loss calculations.

problem Computational demand in calculating mean squared error for large datasets.
method Use rank-1 lattices to compress data, assigning weights based on original data and responses.
result Our QMC data compression algorithms can lead to arbitrary high convergence rates for smooth functions.