Generalizing a Non-Linear Infinite Series Finitely Bound Recursive Relation.

By Zachary Candelaria

Introduction/Background
Geometry is the study of shapes. This includes things like squares, circles, and triangles. These shapes are of a lower dimension than our 3 dimension, these two dimensional shapes are transformed into a higher dimension to show how our universe functions on a basic level. There are different types of geometry; such as topology, packing, and fractals. These genres of geometry have been used separately to help solve complex equations from Sphere-Packing randomness (Torquat, 2010), Poincar conjecture, or to describe the motion of an electron (Hirokazu & Georgios, 2013). When these functions of geometry are combined, their product can be complex, where they are dependent on knowing a single part of the whole. In other words this means that if these kinds of shapes can be generalized into ndimensional space. This type of math has lead to the creation of many fundamental theorems in the field of mathematics and in physics, with the most notable contribution in recent history being Einstein's theory of General Relativity. The idea for my project is that you have a circle inscribed into a square, in the remaining areas what are all the possible square(s)? This is a complex nonlinear function. This function is similar to a fractal but not the same, a fractal always changes by a constant factor, while in this case the square length gets changes by a function of the circle. While the squares will go on for an infinite amount of times, when time hits infinite the remaining space between the circle and the circumscribing square should filled. I.E the area of the circle plus the filling squares will equal the area of the square.

METHOD

The problem while appearing simple and trivial at first glance was shown to be a false conception. The first steps in approaching this problem were to identify any constants, statements about geometric properties, and possible functions.
The only constants that were found where: Radius Slope of a square from two opposite vertices. The starting functions that were used: Point Slope Equation of a circle Pythagorean theorem The first conjecture was: For any square, a vertex would have to lie on a right angle and on the circle. From that conjecture a general location for two vertices is discovered. While the vertex that lies on the right angle is static, the vertex that lies on the circle is dynamic, in the sense that it can move along the circle and remain a true statement. Because the slope between two opposite vertices of a square is always equal to one, as long as the coordinates of the vertex that lies on a right angle is known, the coordinates of the point that lies on the circle can be found; this conjecture will be labeled as the static-dynamic vertices (conjecture). From the Static-Dynamic Vertices conjecture the only problem left is how to find the static vertex location at each iteration. While being able to find all static vertices locations was assumed impossible, or too complex; a equation for all possible static vertices that lie on a side of the circumscribing square was possible.

RESULTS
Sum of Area
0.16 0.14 0.12 0.1 0.08 0.06 0.04 0.02 0 0 20 40 60 80 100 120

CONCLUSIONS
The results of this project while not as whole as hopefully intended, does show a convergence. The convergence of the sum of all the side lengths at infinite will equal 1. While not being able to show the hopeful intent of the sum of all possible squares at infinite times would equal difference in area between the circumscribing square and circle.

Like so:

Side Lengths
0.35 0.3 0.25 0.2 0.15

Ratio of Side length from n to n-1

1.2 1
0 0.1 0.05

20

40

60

80

100

120

QUESTION
At the Nth set how does the largest squares (that do not overlap) effect the remaining area of the initial square and previous set. How does it affect the convergence of the series. does

0.8 1.2 0.6

Sum Of Side Lengths

1
0.4 0.2 0 0 20 40 60 80 100 120 0.2 0 0 20 40 60 80 100 120 0.8 0.6 0.4

Hypothosis
As the sets go on to infinity the relation will approach 0, and the area will approach 4-pi.

References:References Hirokazu Miyake, Georgios A. Siviloglou, Colin J. Kennedy, William Cody Burton, Wolfgang Ketterle August 13, 2013 Realizing the Harper Hamiltonian with Laser-Assisted Tunneling in Optical Lattices MIT-Harvard Center for Ultracold Atoms, Research Laboratory of Electronics, Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA http://arxiv.org/pdf/1308.1431v3.pdf Torquat, S. (2010). Sphere-packing expert torquato links two math problems to physics. Retrieved from http://www.maa.org/news/mathnews/sphere-packing-expert-torquato-links-two-math-problems-tophysics Heriot-Watt University (2010) Non-Linear Recurrence Relations http://www.macs.hw.ac.uk/~jack/F12LE2/c4a.pdf Walter VAN ASSCHE, (2004) Analysis of Non-Linear Recurrence Relations for the Recurrence Coefficients of Generalized Charlier Polynomials www.atlantispress.com/php/download_paper.php?id=609

And a special thanks to Dr. Tony Pantziris.