Related papers: Lattices with exponentially large kissing numbers …
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
In this paper, we draw a connection between ideal lattices and Gr\"{o}bner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in $\mathbb{Z}[x]/\langle f \rangle$ (Lyubashevsky \& Micciancio,…
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion…
This contains Part I of the book: Congruence lattices of finite lattices, which covers about 80 years of research and more than 250 papers.
This paper studies the structure of Lax pairs associated with integrable lattice systems (where space is a one-dimensional lattice, and time is continuous). It describes a procedure for generating examples of such systems, and emphasizes…
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated…
Lattice QCD has reached a mature status. State of the art lattice computations include $u,d,s$ (and even the $c$) sea quark effects, together with an estimate of electromagnetic and isospin breaking corrections for hadronic observables.…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
The existence of exponential dichotomies has been well-established as a powerful tool to study existence, stability, and bifurcations of coherent structures. Currently, the application of exponential dichotomies to elliptic problems posed…
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in…
We prove that the kissing number in 48 dimensions among antipodal spherical codes with certain forbidden inner products is 52\,416\,000. Constructions of attaining codes as kissing configurations of minimum vectors in even unimodular…
We show a new framework for constructing good distance lattices from high dimensional expanders. For error-correcting codes, which have a similar flavor as lattices, there is a known framework that yields good codes from expanders. However,…
Let $\xi$ be a real irrational number. We are interested in sequences of linear forms in 1 and $\xi$, with integer coefficients, which tend to 0. Does such a sequence exist such that the linear forms are small (with given rate of decrease)…
We develop a theory describing neutral atoms scattering at low energies in an optical lattice. We show that for a repulsive interaction, as the microscopic scattering length increases, the effective scattering amplitude approaches a…
The presence of large partial quotients can invalidate many classical limit theorems in the metric theory of continued fractions. A commonly employed strategy to overcome this problem is to discard the largest partial quotient when…
We show that a family of extremely thin sets satisfy the Erd\H{o}s similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…