Related papers: Fibonacci Rectangles
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
We study the Lipschitz simplicial volume, which is a metric version of the simplicial volume. We introduce the piecewise straightening procedure for singular chains, which allows us to generalize the proportionality principle and the…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and…
The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical…
In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.
We introduce a fractal version of the pinwheel substitution tiling. There are thirteen basic prototiles, all of which have fractal boundaries. These tiles, along with their reflections and rotations, create a tiling space which is mutually…
The aim of this work is to use Napoleon's Theorem in different regular polygons, and decide whether we can prove Napoleon's Theorem is only limited with triangles or it could be done in other regular polygons that can create regular…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…
We construct a unilateral lattice tiling of $\mathbb{R}^n$ into hypercubes of two differnet side lengths $p$ or $q$. This generalizes the Pythagorean tiling in $\mathbb{R}^2$. We also show that this tiling is unique up to symmetries, which…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
The main result in this paper is to supply a recursive formula, on the number of minimal primes, for the colength of a fractional ideal in terms of the maximal points of the value set of the ideal itself. The fractional ideals are taken in…
An interesting conic section problem involving the maximum generalized golden right triangle $T_2$ is solved, and two simple constructions of $T_2$ are shown.
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…
By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…
The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…
The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…