arXiv research

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

We show the rank (i.e. minimal size of a generating set) of lattices cannot grow faster than the volume.

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 paper proposes a method to sample quantum field configurations using neural operators and flows.

SGLRW improves robustness of stochastic gradient MCMC methods.

Computational Fluid Dynamics (CFD) is a hugely important subject with applications in almost every engineering field, however, fluid simulations are extremely computationally and memory demanding. Towards this end, we present Lat-Net, a method for compressing both the computation time and memory usage of Lattice Boltzm…

The study examines knot probabilities in confined lattice polygons.

Equivariant neural networks improve performance and generalization in lattice field theory tasks.

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

Improved neural network approximations for statistical systems.

Study on entanglement complexity of confined ring polymers in lattice tubes.

Data compression speeds up machine learning loss calculations.

Paper recovers lattice signal partitions efficiently.

Kronecker trend filtering improves lattice data smoothing.

Study on knotting in very long polymer chains, finding Poisson distribution for prime knot types.

In this paper we prove that for suitable sequences of congruence subgroups of Bianchi groups, including the standard exhaustive sequences of a congruence subgroup, and even symmetric powers of the standard representation of Sl_2(C) the size of the torsion part in the first homology grows exponentially. This extends res…

Translationally equivariant neural networks improve performance and generalization in physics problems.

New property identifies arithmetic lattices from nonuniform lattices.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

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…

Course on arithmetic lattices at EPFL.

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lat…

Median-of-means sampling outperforms mean-of-means for large sample sizes in numerical integration.

New rigidity theorem for product of lattices.

We explore hybrid subgroups of certain non-arithmetic lattices in $\mathrm{PU}(2,1)$. 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 $\mathrm{PU}(1,1)$.

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…

The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.

Proves a lattice version of the Atiyah-Singer index theorem.

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.

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.

Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.

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…

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…

New method finds lattice polygons that can be dissected into triangles with integer areas.

L-CNNs approximate gauge actions, revealing fixed points with no lattice artifacts.

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

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

Proves effective slope gaps for lattice surfaces.

Equivariant neural networks improve performance and generalization in complex scalar field theory tasks.

We study the arithmeticity of the Couwenberg-Heckman-Looijenga lattices in PU(n,1), and show that they contain a non-arithmetic lattice in PU(3,1) which is not commensurable to the non-arithmetic Deligne-Mostow lattice in PU(3,1).

Study answers arithmeticity question for normal subgroup of lattices.

One type of switch simplifies operations on lattice knots.

New lattices in higher dimensions have dense surface subgroups.

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