Search arXiv⌕ Search

arXiv · 1512.05842

Infinite friezes and triangulations of the strip

Abstract

The infinite friezes of positive integers were introduced by Tschabold as a variation of the classical Conway-Coxeter frieze patterns. These infinite friezes were further shown be to realizable via triangulations of the infinite strip by Baur, Parsons and Tschabold. In this paper, we show that the construction of Baur, Parsons and Tschabold can be slightly adapted in order to obtain a bijection between the infinite friezes and the so-called admissible triangulations of the infinite strip with no special marked points on the upper boundary. As a consequence, we obtain that the infinite friezes with enough ones are in bijection with the admissible triangulations of the infinity-gon.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Smith. 2015-12-18. Infinite friezes and triangulations of the strip. https://arxiv.org/abs/1512.05842

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗