Search

We can obtain a two-fold symmetric figure by folding a square sheet of paper in the middle and then cutting along some curves drawn on the paper. By making two perpendicular folds through the centre of the paper and then cutting, we can obtain a four-fold symmetric figure. We can also get an eight-fold symmetric figure by making a fold bisecting an angle made by the two perpendicular folds before cutting. But it is not possible to obtain a three-fold, five-fold or six-fold symmetric figure in this way; we need to make more folds before cutting. Making a three-fold (respectively five-fold and six-fold) figure involves the division of the angle at the centre (360°) of a square sheet of a paper into six (respectively ten and twelve) equal parts. In other words, we need to construct the angles 60°, 36° and 30°. But these angles cannot be obtained by repeated bisections of 180° by simple folding as in the making of two-fold, four-fold and eight-fold figures. In [1], we see that each of the constructions of 60° and 30° applies the fact that sin 30° = ½ and takes only a few simple folding steps. The construction of 36° is more tedious (see, for example, [2] and [3]) as sin 36° is not a simple fraction but an irrational number. In this Article, we show how to make, by paper-folding and cutting a regular pentagon, a five-pointed star and create any five-fold figure as we want. The construction obtained by dividing the angle at the centre of a square paper into ten equal parts is called a pentagon base. We gained much insight from [2] and [3] when developing the method for making the pentagon base to be presented below.

The theory of quadratic equations (with real coefficients) is an important topic in the secondary school mathematics curriculum. Usually students are taught to solve a quadratic equation ax2 + bx + c = 0 (a ≠ 0) algebraically (by factorisation, completing the square, quadratic formula), graphically (by plotting the graph of the quadratic polynomial y = ax2 + bx + c to find the x-intercepts, if any), and numerically (by the bisection method or Newton-Raphson method). Less well-known is that we can indeed solve a quadratic equation geometrically (by geometric construction tools such as a ruler and compasses, R&C for short). In this article we describe this approach. A more comprehensive discussion on geometric approaches to quadratic equations can be found in [1]. We have also gained much insight from [2] to develop our methods. The tool we use is a set square rather than the more common R&C. But the methods to be presented here can also be carried out with R&C. We choose a set square because it is more convenient (one tool is used instead of two).

Let $T:= T(A, {\mathcal D})$ be a disk-like self-affine tile generated by an integral expanding matrix $A$ and a consecutive collinear digit set ${\mathcal D}$, and let $f(x)=x^{2}+px+q$ be the characteristic polynomial of $A$. In the paper, we identify the boundary $\partial T$ with a sofic system by constructing a neighbor graph and derive equivalent conditions for the pair $(A,{\mathcal D})$ to be a number system. Moreover, by using the graph-directed construction and a device of pseudo-norm $\omega$, we find the generalized Hausdorff dimension $\dim_H^{\omega} (\partial T)=2\log \rho(M)/\log |q|$ where $\rho(M)$ is the spectral radius of certain contact matrix $M$. Especially, when $A$ is a similarity, we obtain the standard Hausdorff dimension $\dim_H (\partial T)=2\log \rho/\log |q|$ where $\rho$ is the largest positive zero of the cubic polynomial $x^{3}-(|p|-1)x^{2}-(|q|-|p|)x-|q|$, which is simpler than the known result., Comment: 26 pages, 11 figures

We consider the disklikeness of the planar self-affine tile T T generated by an integral expanding matrix A A and a consecutive collinear digit set D = { 0 , v , 2 v , ⋯ , ( | q | − 1 ) v } ⊂ Z 2 {\mathcal {D}}= \{0, v, 2v, \cdots , (|q|-1)v \}\subset {\Bbb {Z}}^2 . Let f ( x ) = x 2 + p x + q f(x)=x^{2}+ p x+ q be the characteristic polynomial of A A . We show that the tile T T is disklike if and only if 2 | p | ≤ | q + 2 | 2|p|\leq |q+2| . Moreover, T T is a hexagonal tile for all the cases except when p = 0 p=0 , in which case T T is a square tile. The proof depends on certain special devices to count the numbers of nodal points and neighbors of T T and a criterion of Bandt and Wang (2001) on disklikeness.

We study the connectedness of the planar self-affine sets $T(A,{\mathcal{D}})$ generated by an integer expanding matrix $A$ with $|\det(A)|=3$ and a non-collinear digit set ${\mathcal D}=\{0, v, kAv\}$ where $k\in {\mathbb Z}\setminus\{0\}$ and $v\in {\mathbb Z}^2$ such that $\{v, Av\}$ is linearly independent. By checking the characteristic polynomials of $A$ case by case, we obtain a criterion concerning only $k$ to determine the connectedness of $T(A,{\mathcal{D}})$., 13 pages, 10 figures

In the paper, we focus on the connectedness of planar self-affine sets $T(A,{\mathcal{D}})$ generated by an integer expanding matrix $A$ with $|\det (A)|=3$ and a collinear digit set ${\mathcal{D}}=\{0,1,b\}v$, where $b>1$ and $v\in {\mathbb{R}}^2$ such that $\{v, Av\}$ is linearly independent. We discuss the domain of the digit $b$ to determine the connectedness of $T(A,{\mathcal{D}})$. Especially, a complete characterization is obtained when we restrict $b$ to be an integer. Some results on the general case of $|\det (A)|> 3$ are obtained as well., 15 pages, 10 figures