Related papers: Bicolored tilings and the Scott map

An additive map $T$ acting between spaces of vector-valued functions is said to be biseparating if $T$ is a bijection so that $f$ and $g$ are disjoint if and only if $Tf$ and $Tg$ are disjoint. Note that an additive bijection retains…

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…

The family of mappings of the plane possessing a biquadratic invariant, which is known collectively as QRT maps, is composed of two involutions, one preserving a vertical shift and the other preserving a horizontal shift in the plane. In…

Two new series of substitution tilings are introduced in which the tiles appear in infinitely many orientations. It is shown that several properties of the well-known pinwheel tiling do also hold for these new examples, and, in fact, for…

Replacing configurations of points by configurations of tubular neighbourhoods (or discs) in a manifold, we are able to define a natural scanning map that is equivariant under the action of the diffeomorphism group of the manifold. We also…

The generic singularities and bifurcations are classified for one-parameter families of curves with frames in a space form, the Euclidean space, the elliptic space or the hyperbolic space via projective geometry. Two kinds of frames are…

We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…

The existence of translated curves for quasiperiodically forced maps is established, under very mild regularity hypotheses, for rotation numbers of constant type. Among the translated curves, the invariant curves are characterized as the…

The familiar trace of a square matrix generalizes to a trace of an endomorphism of a dualizable object in a symmetric monoidal category. To extend these ideas to other settings, such as modules over non-commutative rings, the trace can be…

We study tilings of polygons $R$ with arbitrary convex polygonal tiles. Such tilings come in continuous families obtained by moving tile edges parallel to themselves (keeping edge directions fixed). We study how the tile shapes and areas…

Let T be a tile in the Cartesian plane made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be…

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…

For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph…

This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…

In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…

Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…

The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The…

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…

The species of finite topological spaces admits two graded bimonoid structures, recently defined by F. Fauvet, L. Foissy, and the second author. In this article, we define a doubling of this species in two different ways. We build a…