Related papers: Building with Blocks: Enumerating Polyforms on Til…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
We consider endomorphism algebras of $n$-term silting complexes in derived categories of hereditary algebras, and we show that the module category of such an endomorphism algebra has a separated $n$-section. For $n=3$ we obtain a trisection…
We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…
Within the field of numerical multilinear algebra, block tensors are increasingly important. Accordingly, it is appropriate to develop an infrastructure that supports reasoning about block tensor computation. In this paper we establish…
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
Recent studies have revealed that neural networks learn interpretable algorithms for many simple problems. However, little is known about how these algorithms emerge during training. In this article, I study the training dynamics of a small…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC . We wish to…
The class of 2-dimensional non-integrable flat dynamical systems has a rather extensive literature with many deep results, but the methods developed for this type of problems, both the traditional approach via Teichm\"{u}ller geometry and…
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…
The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
We analyze the computational complexity of two 2-player games involving packing objects into a box. In the first game, players alternate drawing polycubes from a shared pile and placing them into an initially empty box in any available…