Related papers: On the area of empty axis-parallel rectangles amid…
We solve for the elementary excitation in infinite quasi-1D quantum lattices by extending the recently developed infinite quasi-1D entanglement perturbation theory. The wave function of an excited state is variationally determined by…
Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices are often observed to exhibit a high degree of…
The dispersion relation for magnetoplasmons in a planar superlattice with periodically alternating regions of gapless and gapped modications of graphene has been derived within the frame of the random-phase approximation. The contribution…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
In this short note we prove a sharp dispersive estimate $\|\mathrm{e}^{\mathrm{i} tH} f\|_\infty < t^{-d/3}\|f\|_1$ for any Cartesian product $\mathbb{Z}^d\mathop\square G_F$ of the integer lattice and a finite graph. This includes the…
We analyze diffusion of particles on a two dimensional square lattice. Each lattice site contains an arbitrary number of particles. Interactions affect particles only in the same site, and are macroscopically represented by the excess…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest empty box is of asymptotic order $1/n$ for $n\to\infty$ and…
Uniformly distributed point sets on the unit sphere with and without symmetry constraints have been found useful in many scientific and engineering applications. Here, a novel variant of the Thomson problem is proposed and formulated as an…
We study front propagation and diffusion in the reaction-diffusion system A $\leftrightharpoons$ A + A on a lattice. On each lattice site at most one A particle is allowed at any time. In this paper, we analyze the problem in the full range…
This paper examines the propagation of time-harmonic waves in a two-dimensional triangular lattice with a lattice constant $a = 1$. The sources are positioned along line segments within the lattice. Specifically, we investigate the discrete…
We use the finite lattice method to calculate the radius of gyration, the first and second area-weighted moments of self-avoiding polygons on the square lattice. The series have been calculated for polygons up to perimeter 82. Analysis of…
An analytical model is presented for a rectangular lattice of isotropic scatterers with electric and magnetic resonances. Each isotropic scatterer is formed by putting appropriately 6 $\Omega$-shaped perfectly conducting particles on the…
A method is proposed for exactly calculating the partition function of a rectangular Ising lattice with the presence of a uniform external field. This approach is based on the method of the transfer matrix developed about seventy years ago…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…
If the structure of spacetime is discrete, then Lorentz symmetry should only be an approximation, valid at long length scales. At finite lattice spacings there will be small corrections to the Dirac evolution that could in principle be…