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…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Distributive lattices”
Proves effective slope gaps for lattice surfaces.
problem Proving effective slope gaps for lattice surfaces.
method Proves effective slope gap distribution for square torus and general lattice surfaces.
result Effective slope gap distribution result for lattice surfaces.
New MCMC method samples from lattice distributions efficiently.
problem Sampling from probability distributions on lattice structures.
method Metropolis-Hastings algorithm with a pull-back measure.
result The method is uniformly ergodic under certain conditions.
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…
The paper proposes a method to sample quantum field configurations using neural operators and flows.
problem Sampling lattice field configurations from Boltzmann distributions in quantum field theories.
method Approximating a time-dependent neural operator to map between free and target theories, discretizing to a normalizing flow, and training to diffeomorphism.
result The method can generalize to larger lattice sizes when pre-trained on smaller ones, improving efficiency.
The moduli space of lattices of is a Riemann surface of finite hyperbolic area with the square lattice as an origin. We select a lattice from the induced uniform distribution and calculate the statistics of the Teichmüller distance to the origin. This in turn identifies distribution of the distance in Teic…
New method for geodesics of multivariate normals, derived from a Toda lattice.
problem Computing geodesics of multivariate normal distributions.
method Using block Cholesky decomposition and a natural Riemannian submersion, a new Toda lattice type Lax pair is derived.
result A new Toda lattice type Lax pair derived from geodesics and block Cholesky decomposition.
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.
Generalizes Kauffman's clock theorem to surfaces.
problem Proving a lattice structure on graph states in various surfaces.
method Using matchings and graph orientations, extending Propp's results.
result Two generalizations of Kauffman's theorem for more surfaces.
A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…
A new method called MCLMC avoids dissipation in sampling from canonical distributions.
problem Sampling from canonical distributions without dissipation.
method Microcanonical Langevin Monte Carlo (MCLMC) as a dissipation-free system of SDE.
result MCLMC converges faster than HMC for lattice φ^4 models.
Finitary estimates for the distribution of lattice orbits in homogeneous spaces I: Riemannian metricmath.DS
Effective estimates for lattice orbits in homogeneous spaces.
problem Distribution of lattice orbits in homogeneous spaces.
method Refined techniques on equidistribution of regions under flows.
result Effective convergence of orbit distribution to a limiting density.
Researchers compute gap distributions for saddle connection directions on specific translation surfaces.
problem Computing gap distributions for saddle connection directions on translation surfaces.
method Translation to dynamical question of return times to a transversal under the horocycle flow.
result Gap distributions have support at 0 and quadratic tail decay.
Paper solves NGCA for discrete distributions using LLL method.
problem Learning hidden non-Gaussian components in discrete distributions.
method Utilizes LLL lattice basis reduction method.
result Sample and computationally efficient algorithm for NGCA in discrete distributions.
Machine learning classifies topological phases in leaky photonic lattices.
problem Classifying topological phases in leaky photonic lattices using limited data.
method A fully connected neural network trained on bulk intensity measurements.
result Accurate determination of topological properties from intensity distributions.
We derive results on the distribution of directions of saddle connections on translation surfaces using only the Birkhoff ergodic theorem applied to the geodesic flow on the moduli space of translation surfaces. Our techniques, together with an approximation argument, also give an alternative proof of a weak version of…
Tropical Geometry and Piecewise-Linear Approximation of Curves and Surfaces on Weighted Latticescs.LG
Tropical geometry and weighted lattices improve curve and surface fitting.
problem Fitting max- tropical curves and surfaces to data.
method Max- algebra, weighted lattices, morphological adjunctions.
result Optimal piecewise-linear regression for max- curves and surfaces.
Improved sampling for gauge theory with SNFs.
problem Sampling from target probability distributions in gauge theory.
method Stochastic Normalizing Flows (SNFs) for lattice gauge theory.
result Promising scaling properties of SNFs with degrees of freedom.
We explore a simple lattice field model intended to describe statistical properties of high frequency financial markets. The model is relevant in the cross-disciplinary area of econophysics. Its signature feature is the emergence of a self-organized critical state. This implies scale invariance of the model, without tu…
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.
Hardness proof for agnostically learning halfspaces from worst-case lattice problems.
problem Agnostically learning halfspaces in the presence of noise.
method Reduction to worst-case lattice problems (GapSVP, SIVP).
result No efficient algorithm can achieve misclassification error better than 1/2 - γ under given hardness assumptions.
A number of recent papers have provided evidence that practical design questions about neural networks may be tackled theoretically by studying the behavior of random networks. However, until now the tools available for analyzing random neural networks have been relatively ad-hoc. In this work, we show that the distrib…
Random knotting in very long off-lattice self-avoiding polygonscond-mat.stat-mech
Study on knotting in very long polymer chains, finding Poisson distribution for prime knot types.
problem Understanding knotting in very long polymer chains.
method Generated and analyzed polygons of size using tree data structure and pivot algorithm. Used new knot diagram simplification and invariant-free classification.
result Number of prime summands of knot type in a random -gon is well described by a Poisson distribution.
Hard to estimate -accurate scores without strong assumptions.
problem Estimating the score of unknown data distributions accurately.
method Reduction to generating samples and leveraging lattice-based cryptography hardness.
result Score estimation is computationally hard even with polynomial sample complexity.
Novel method for learning Gaussian graphical models from paired data.
problem Learning Gaussian graphical models for dependent groups.
method Introducing twin order to explore the search space more efficiently.
result The twin order makes the model space a distributive lattice, leading to more efficient model exploration.
This paper studies posets associated with link diagrams and their algebraic properties.
problem Understanding the algebraic structure of posets derived from link diagrams.
method Associaed posets with link diagrams, proved distributivity, and described join irreducibles.
result Posets of Kauffman states are distributive lattices and isomorphic to coefficient quiver posets.
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 variables.
Investigates stochastic networks on disordered lattices, converging to Brownian web in 2D.
problem Stochastic networks on disordered lattices.
method Directed spanning forests on randomly perturbed lattices.
result DSF converges to Brownian web in 2D under diffusive scaling.
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.
We construct a Poincaré section for the horocycle flow on the modular surface , and study the associated first return map, which coincides with a transformation (the {\it BCZ map}) defined by Boca-Cobeli-Zaharescu. We classify ergodic invariant measures for this map and prove equidistribution of pe…
New property identifies arithmetic lattices from nonuniform lattices.
problem Characterizing arithmetic lattices among nonuniform lattices.
method Introduced Bounded Clustering (B-C) property.
result B-C property uniquely identifies arithmetic lattices.
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.
Arithmetic groupsmath.GT
Course on arithmetic lattices at EPFL.
problem Understanding arithmetic lattices.
method Introductory course on arithmetic lattices.
result Introduction to arithmetic lattices.
We give a simple example showing that a knot or link diagram that lies in the lattice is not necessarily the projection of a lattice stick knot or link in the lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the lat…
Develops a new sampling method for gauge theories.
problem Sampling from gauge theories.
method Gauge-equivariant flows for variables.
result Constructs a class of flows respecting matrix conjugation symmetry.
We continue the study of the distribution of closed geodesics on nilmanifolds constructed from a simply connected 2-step nilpotent Lie group with a left invariant metric and a lattice. We consider a Lie group with an associated 2-step nilpotent Lie algebra constructed from an irreducible representation of a compact sem…
New rigidity theorem for product of lattices.
problem Understanding quasi-isometry of product lattices.
method Demonstrated rigidity for product of non-uniform rank one lattice and nilpotent lattice.
result Any quasi-isometric group is an extension of a non-uniform rank one lattice by a nilpotent lattice.
We explore hybrid subgroups of certain non-arithmetic lattices in . 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 .
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…
SLR tackles sparse linear regression problems, showing hardness for efficient algorithms.
problem Sparse linear regression with noisy data and k-sparse solutions.
method Reduction from lattice problems to SLR instances, showing hardness.
result Hardness of SLR instances, even for isotropic Gaussian design matrices.
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 -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.
Comparison of Lattice-Free and Lattice-Based Sequence Discriminative Training Criteria for LVCSReess.AS
Sequence discriminative training criteria have long been a standard tool in automatic speech recognition for improving the performance of acoustic models over their maximum likelihood / cross entropy trained counterparts. While previously a lattice approximation of the search space has been necessary to reduce computat…
Vertex distortion measures how far lattice knots deviate from straight lines.
problem Measuring how much lattice knots deviate from straight paths.
method Analogous to smooth knots, study vertex distortion in lattice knots.
result Vertex distortion is 1 only for the unknot and can be arbitrarily high.
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…
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 …
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…
The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.
problem Residual finiteness of lattices in 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 and construction of surfaces with specific fundamental groups.