Related papers: Lattice Substitution Systems and Model Sets
Limit periodic point sets are aperiodic structures with pure point diffraction supported on a countably, but not finitely generated Fourier module that is based on a lattice and certain integer multiples of it. Examples are cut and project…
Aperiodic tiling --- a form of complex global geometric structure arising through locally checkable, constant-time matching rules --- has long been closely tied to a wide range of physical, information-theoretic, and foundational…
Phase transition of the Ising model is investigated on a planar lattice that has a fractal structure. On the lattice, the number of bonds that cross the border of a finite area is doubled when the linear size of the area is extended by a…
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…
This work presents a general thermodynamic approach to describe particle diffusion on a lattice, a model used to study transport processes in solids and on surfaces. By treating each lattice site as an open thermodynamic system, the effects…
The SU(3) chiral lagrangian for the lightest octets of mesons and baryons is constructed on a spacetime lattice. The lattice spacing acts as an ultraviolet momentum cutoff which appears directly in the Lagrangian so chiral symmetry remains…
Finite simplex lattice models are used in different branches of science, e.g., in condensed matter physics, when studying frustrated magnetic systems and non-Hermitian localization phenomena; or in chemistry, when describing experiments…
We present a one-dimensional model for diffusion in a fluctuating lattice; that is a lattice which can be in two or more states. Transitions between the lattice states are induced by a combination of two processes: one periodic…
A consistent formulation of a fully supersymmetric theory on the lattice has been a long standing challenge. In recent years there has been a renewed interest on this problem with different approaches. At the basis of the formulation we…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…
Glass-forming liquids have been extensively studied in recent decades, but there is still no theory that fully describes these systems, and the diversity of treatments is in itself a barrier to understanding. Here we introduce a new simple…
We devise a generic recipe for constructing $D$-dimensional lattice models whose $d$-dimensional boundary states, located on surfaces, hinges, corners, and so forth, can be obtained exactly. The solvability is rooted in the underlying…
Phase transitions are a central theme of statistical mechanics, and of probability more generally. Lattice spin models represent a general paradigm for phase transitions in finite dimensions, describing ferromagnets and even some fluids…
We study the structure of the set of priority-neutral matchings. These matchings, introduced by Reny (AER, 2022), generalize stable matchings by allowing for priority violations in a principled way that enables Pareto-improvements to stable…
In this paper, we study a famous discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
A universal topological marker has been proposed recently to map the topological invariants of Dirac models in any dimension and symmetry class to lattice sites. Using this topological marker, we examine the conditions under which the…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…