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

Trend · papers per month

124248371495 · May 202619922001200920172026
48 results for lattice structure

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

Study C\mathbb{C}-Fuchsian subgroups of non-arithmetic lattices.

problem Understand structure and fundamental domains of C\mathbb{C}-Fuchsian subgroups.
method General procedure to analyze structure and show fundamental domains lie on a complex geodesic.
result Fundamental domains of C\mathbb{C}-Fuchsian subgroups lie on a complex geodesic homeomorphic to the unit disk.

Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie algebra is an almost-direct product of the holonomy Lie algebra of the sublattice a…

2019-08-16abs ↗pdf ↗

New method uses neural maps to efficiently sample lattice QCD distributions.

problem Challenges in sampling Boltzmann distributions of lattice field theories.
method Sparse triangular transport maps exploiting conditional independence structure of lattice graphs.
result Sparse triangular maps achieve efficient sampling with linear time complexity in lattice size.

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

This paper investigates the geometry of compact contact manifolds that are uniformized by contact Lie groups, i.e., compact manifolds that are the quotient of some Lie group G with a left invariant contact structure and a uniform lattice subgroup. We re-examine Alexander's criteria for existence of lattices on solvable…

2009-04-20abs ↗pdf ↗

We study tt*-geometry on the classifying space for regular singular TERP-structures, e.g., Fourier-Laplace transformations of Brieskorn lattices of isolated hypersurface singularities. We show that (a part of) this classifying space can be canonically equipped with a hermitian structure. We derive an estimate for the h…

2007-12-21abs ↗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 ↗

Abstract framework for no-arbitrage concepts in topological vector lattices.

problem Generalization of no-arbitrage concepts in topological vector lattices.
method Imposing a structural condition on trading strategies and deriving abstract FTAP.
result NUPBR, NAA1_1, and NA1_1 may not be equivalent in general setting.

New combinatorial structure for hierarchically hyperbolic spaces.

problem Constructing new hierarchically hyperbolic spaces.
method Combinatorial hierarchical hyperbolicity criterion to construct and clarify HHS structures.
result HHSs admit a combinatorial structure, clarifying the application of the combinatorial HHS criterion.

Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize them. In this paper we consider every link in the cubic lattice. Lattice stick numb…

2014-02-07abs ↗pdf ↗

Deep convolutional neural networks (CNNs) have shown outstanding performance in the task of semantically segmenting images. However, applying the same methods on 3D data still poses challenges due to the heavy memory requirements and the lack of structured data. Here, we propose LatticeNet, a novel approach for 3D sema…

2019-12-12abs ↗pdf ↗

We announce results on the structure of CAT(0) groups, CAT(0) lattices and of the underlying spaces. Our statements rely notably on a general study of the full isometry groups of proper CAT(0) spaces. Classical statements about Hadamard manifolds are established for singular spaces; new arithmeticity and rigidity state…

2008-06-01abs ↗pdf ↗

We establish two exact sequences for the lattice cohomology associated with non-degenerate plumbing graphs. The first is the analogue of the surgery exact triangle proved by Ozsvath and Szabo for the Heegaard-Floer invariant HF^+; for the lattice cohomology over Z_2-coefficients it was proved by J. Greene. Here we prov…

2010-01-05abs ↗pdf ↗

Using nonlinear pde techniques, we construct a new family of globally smooth tt* structures. This includes tt* structures associated to the (orbifold) quantum cohomology of a finite number of complex projective spaces and weighted projective spaces. The existence of such "magical solutions" of the tt* equations, namely…

2010-10-10abs ↗pdf ↗

New method learns dependencies in high-dimensional data without graph assumptions.

problem Learning dependencies in nonparametric and high-dimensional settings.
method Neighbourhood lattice decomposition for nonparametric CI learning.
result Compact, non-graphical representation of CI exists in any graphical model.

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.

In this paper we prove that every H-type Lie algebra possesses a basis with respect to which the structure constants are integers. Existence of such an integral basis implies via the Mal'cev criterion that all simply connected H-type Lie groups contain cocompact lattices. Since the Campbell-Hausdorff formula is very si…

2001-01-28abs ↗pdf ↗

The lattice of integer flows of a graph is known to determine the graph up to 2-isomorphism (work of Su--Wagner and Caporaso--Viviani). In this paper we give an algorithmic construction of the graphic matroid $\calM(G)$ of a graph GG, given its lattice of integer flows $\calF(G)$. The algorithm can then be applied to …

2016-11-19abs ↗pdf ↗

In this continuation of \cite{BM}, we prove the following: Let ΓSL(2,C)Γ\subset \text{SL}(2,{\mathbb C}) be a cocompact lattice, and let ρ:ΓGL(r,C)ρ: Γ\rightarrow \text{GL}(r,{\mathbb C}) be an irreducible representation. Then the holomorphic vector bundle EρSL(2,C)/ΓE_ρ\longrightarrow \text{SL}(2,{\mathbb C})/Γ associated to ρρ is polystab…

2013-03-13abs ↗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.