Related papers: The Penrose Lattice revisited
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…
An intriguing correspondence between certain finite planar tessellations and the Descartes circle arrangements is presented. This correspondence may be viewed as a visualization of the spinor structure underlying Descartes circles.
We report an attempt to calculate the deep inelastic scattering structure functions from the hadronic tensor calculated on the lattice. We used the Backus-Gilbert reconstruction method to address the inverse Laplace transformation for the…
A family of sequences produced by a non-homogeneous linear recurrence formula derived from the geometry of circles inscribed in lenses is introduced and studied. Mysterious ``underground'' sequences underlying them are discovered in this…
We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…
Pseudoinverses are ubiquitous tools for handling over- and under-determined systems of equations. For computational efficiency, sparse pseudoinverses are desirable. Recently, sparse left and right pseudoinverses were introduced, using…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…
A new Poisson structure on a subspace of the Kupershmidt algebra is defined. This Poisson structure, together with other two already known, allows to construct a trihamiltonian recurrence for an extension of the periodic Toda lattice with…
The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…
It is shown that the descending plane partitions of Andrews can be geometrically realized as cyclically symmetric rhombus tilings of a certain hexagon where an equilateral triangle of side length 2 has been removed from its centre. Thus,…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
Gyroscopic metamaterials --- mechanical structures composed of interacting spinning tops --- have recently been found to support one-way topological edge excitations. In these structures, the time reversal symmetry breaking that enables…
We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…
We introduce stripe-like quasi-nondiffracting lattices that can be generated via spatial spectrum engineering. The complexity of the spatial shapes of such lattices and the distance of their almost diffractionless propagation depend on the…
Classical results on aperiodic tilings are rather complicated and not widely understood. Below, an alternative approach is discussed in hope to provide additional intuition not apparent in classical works.
Lattice color groups are introduced and used to study the partitioning of a periodically- or quasiperiodically-ordered set of points into N symmetry-related subsets. Applications range from magnetic structure to superlattice ordering in…
This paper is based on the study of random lozenge tilings of non-convex polygonal regions with interacting non-convexities (cuts) and the corresponding asymptotic kernel as in [3] and [4] (discrete tacnode kernel). Here this kernel is used…
A transfer-matrix algorithm is presented herein as a beginning to study the transmission characteristics of coherent light through three-dimensional periodic microstructures, in which the structures are treated as two-dimensional-layer…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…