相关论文: Tiling the plane without supersymmetry

A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

We propose a generalization of non-commutative geometry and gauge theories based on ternary Z_3-graded structures. In the new algebraic structures we define, we leave all products of two entities free, imposing relations on ternary products…

In this paper, we improve a result by Chodosh and Ketover. We prove that, in an asymptotically flat $3$-manifold $M$ that contains no closed minimal surfaces, fixing $q\in M$ and a $2$-plane $V$ in $T_qM$ there is a properly embedded…

We prove that there are no networks homeomorphic to the Greek "theta" letter (a double cell) embedded in the plane with two triple junctions with angles of $120$ degrees, such that under the motion by curvature they are self-similarly…

Deforming fundamental domains of wallpaper groups provides a systematic way to generate non-convex blocks which admit topological interlocking assemblies (TIAs). We use this approach to construct TIAs that fully occupy the space between two…

We consider domino tilings of 3D cubiculated regions. The tilings have two invariants, flux and twist, often integer-valued, which are given in purely combinatorial terms. These invariants allow one to classify the tilings with respect to…

We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness…

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…

We study the tiling of a two-dimensional region of the plane by $K$-cell one-dimensional tiles, or $K$-mers. Unlike previous studies, which typically allowed for one single value of $K$ or sometimes a small assortment of fixed values, here…

We identify least-perimeter unit-area tilings of the plane by convex pentagons, namely tilings by Cairo and Prismatic pentagons, find infinitely many, and prove that they minimize perimeter among tilings by convex polygons with at most five…

Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…

A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

We call "flippable tilings" of a constant curvature surface a tiling by "black" and "white" faces, so that each edge is adjacent to two black and two white faces (one of each on each side), the black face is forward on the right side and…

In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…