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…
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.
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.
Study Poisson boundaries of building lattices and generalize rigidity results.
problem Understanding Poisson boundaries of building lattices and their rigidity properties.
method Proved Poisson boundaries and used them to generalize rigidity results.
result Generalized rigidity results for morphisms and cocycles from lattices in buildings to groups with negative curvature.
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…
L-CNNs learn gauge invariant quantities on lattices.
problem Learning gauge invariant quantities on lattices.
method Novel convolutional layer preserving gauge equivariance and forming Wilson loops.
result L-CNNs can approximate any gauge covariant function on the lattice.
Study answers arithmeticity question for normal subgroup of lattices.
problem Arithmeticity of discrete subgroups of semisimple Lie groups with dense commensurators.
method Examined normal subgroups of lattices in semisimple Lie groups.
result Positive answer to Greenberg-Shalom's question for lattices.
Discrete knot theory models use lattice-filtered graphs to detect merging knot components.
problem Detecting merging knot components in discrete models.
method Lattice-filtered move graphs to model knot types, identifying connected components and merge scales.
result Merge scale defined by connected components of lattice-filtered move graphs, with specific examples for the figure-eight knot.
Complete classification of Deligne-Mostow lattice representations into PGL(3,C).
problem Classifying representations of Deligne-Mostow lattices into PGL(3,C).
method Formal computations in SAGE and MAPLE.
result Local rigidity for all representations with chosen generators.
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…
New research shows certain arithmetic lattices can't be LERF.
problem Determining if arithmetic lattices are LERF.
method Analyzing trialitarian arithmetic lattices in PSO7,1(R). result Trialitarian arithmetic lattices in PSO7,1(R) are not LERF. 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.
Study lattice paths from twist knots and double twist knots.
problem Understanding combinatorics of twist knots and double twist knots.
method Analyzing quiver generating series of HOMFLY-PT polynomial limits.
result Lattice path models for twist knots and double twist knots.
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…
We prove that any action of a higher rank lattice on a Gromov-hyperbolic space is elementary. More precisely, it is either elliptic or parabolic. This is a large generalization of the fact that any action of a higher rank lattice on a tree has a fixed point. A consequence is that any quasi-action of a higher rank latti…
New bounds on diameters and generators for specific lattices and graphs.
problem Finding bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.
method Analyzing arithmetic lattices from Eichler orders in quaternion algebras, applying techniques to definite quaternion algebras.
result Bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.
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 BSΔE on lattices for asset price analysis.
problem Optimal investment and market equilibrium analysis in asset price models.
method Backward stochastic difference equations on lattices.
result Applications to optimal investment and market equilibrium analysis.
Study C-Fuchsian subgroups of non-arithmetic lattices.
problem Understand structure and fundamental domains of C-Fuchsian subgroups. method General procedure to analyze structure and show fundamental domains lie on a complex geodesic.
result Fundamental domains of C-Fuchsian subgroups lie on a complex geodesic homeomorphic to the unit disk. Study area-minimizing subgraphs in integer lattices.
problem Finding the most efficient subgraphs in integer lattices.
method Formulated functions of bounded variations, classified subgraphs in 2D, proved properties in higher dimensions.
result Classified area-minimizing subgraphs in 2D integer lattice up to isomorphisms.
Equivariant neural networks improve performance and generalization in lattice field theory tasks.
problem Improving neural network performance and generalization in lattice field theory.
method Investigation of translationally equivariant neural networks in a two-dimensional scalar field model.
result Equivariant neural networks significantly outperform non-equivariant ones in various tasks, including physical parameters and lattice sizes.
New minimal surfaces found using Toda lattice and integrable systems.
problem Constructing new minimal surfaces with specific genus.
method Using Toda lattice and integrable systems techniques.
result New singly periodic minimal surfaces with genus j(j+1)/2−1. 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 hyperbolic lattice is called \textit{1.2-reflective} if the subgroup of its automorphism group generated by all 1- and 2-reflections is of finite index. The main result of this article is a complete classification of 1.2-reflective maximal anisotropic lattices of rank 4.
Lattice formulation captures Atiyah-Patodi-Singer index.
problem Capturing index of Dirac operators in lattice gauge theory.
method Generalized spectral flow for non-product structure near boundaries.
result Correctly captures continuum index for small lattice spacings.
The study connects lattices, Garside structures, and weakly modular graphs.
problem Exploring combinatorial non-positive curvature in various simplicial complexes.
method Analyzing lattices with Z-actions and their quotients. result Lattices and their quotients give rise to weakly modular graphs.
We show the rank (i.e. minimal size of a generating set) of lattices cannot grow faster than the volume.
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.
Novel trading strategy for generalized lattice markets ensures positive profits.
problem Trading in markets with serially correlated returns and asset correlation.
method Multi-double linear policies in a generalized lattice market model.
result Proposed policies ensure positive expected profits in a lattice market.
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…
Classifies lattices from knot surgeries, defining a concordance invariant.
problem Classifying lattices from knot surgeries.
method Classifies lattices as the intersection form of a four manifold with boundary.
result Defines a concordance invariant and generalizes a theorem on lens space surgeries.
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…
Principal binets generalize curvature line surfaces to square lattices and are a discrete integrable system.
problem Discretizing curvature line surfaces on square lattices.
method Showed principal binets as a multi-dimensional consistent system.
result Principal binets generalize to higher-dimensional square lattices and are integrable.
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/N. 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.
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.
Unified framework for complex financial networks using lattice theory.
problem Complex financial networks with multiple currencies and dependencies.
method Recast classical financial clearing model into lattice liability networks.
result Lattice-valued clearing sections form a complete lattice, enabling tractable analysis.
Course on arithmetic lattices at EPFL.
problem Understanding arithmetic lattices.
method Introductory course on arithmetic lattices.
result Introduction to arithmetic lattices.
The lattice stick number sL(L) of a link L is defined to be the minimal number of straight line segments required to construct a stick presentation of L in the cubic lattice. Hong, No and Oh found a general upper bound sL(K)≤3c(K)+2. A rational link can be represented by a lattice presentation with exa…
We give a simple example showing that a knot or link diagram that lies in the Z2 lattice is not necessarily the projection of a lattice stick knot or link in the Z3 lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the Z2 lat…
We introduce a criterion that a given bihamiltonian structure allows a local coordinate system where both brackets have constant coefficients. This criterion is applied to the bihamiltonian open Toda lattice in a generic point, which is shown to be locally isomorphic to a Kronecker odd-dimensional pair of brackets with…
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…
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.
We prove that the rank (that is, the minimal size of a generating set) of lattices in a general connected Lie group is bounded by the co-volume of the projection of the lattice to the semi-simple part of the group. This was proved by Gelander for semi-simple Lie groups and by Mostow for solvable Lie groups. Here we con…
The study examines how perturbations of lattice actions on group boundaries behave.
problem Understanding how perturbations of lattice actions on group boundaries affect semi-conjugacy.
method Analyzes continuous factorization of perturbed actions onto original actions by semi-conjugacy.
result Perturbations of lattice actions on group boundaries can be C0 semi-conjugate or not. We define and prove properties of link lattice complexes for plumbed links.
problem Understanding the homology and formality of plumbed L-space links.
method Define and analyze link lattice complexes, proving homotopy equivalence and formality properties.
result Link lattice complexes are homotopy equivalent to link Floer complexes for plumbed links.
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.
In the present article, we provide examples of fake quadrics, that is, minimal complex surfaces of general type with the same numerical invariants as the smooth quadric in $\PP ^3$ which are quotients of the bidisc by an irreducible lattice of automorphisms. Moreover, we list classes of arithmetic lattices over a real …