Generalizing of a Non-Linear Infinite Series Finitely bound recursive relation.

Zachary Candelaria
Tony Pantziris








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 n-dimensional 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 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 non-linear 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.


This figure shows the possible squares for sets n 0 4with in the range of 0 0 45

Question: At the Nth set how does the largest squares (that do not overlap) effect the remaining
area of the initial square and how does it affect the convergence of the series.
This study examined how to generalize all possible squares at set n. While the attempt at
making the generalization for all possible squares failed, a generalization for all possible squares
along a side of the circumscribing square. The way this was achieved was through the use of
recursive analysis and relations.
The problem while appearing simple and trivial at first glance was shown to be a fasle
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: m
y
x

Equation of a circle: R
2
X
2
Y
2

Pythagorean theorem: A
2
B
2
C
2

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.
The logic of the derivation of the discovered equation is:


s
n
1x
n

s
n
1x
n
1
n1
i
s
i
y
n
1A
n1
y
n

y
n
x
n
A
n1


Find x
n
Recursively

1 x
n
2
y
n
2
x
n
2
x
n
A
n1

2


*Condition that (x
n
,y
n
) is on the circle*

2x
n
2
2x
n
A
n1
A
n1
2
1 0
*use quadratic formula to get to main equation*


x
n

A
n1

2A
n1
2
2



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.






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/math-news/sphere-packing-expert-torquato-links-two-
math-problems-to-physics
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.atlantis-press.com/php/downloadpaper.php?id609