Physical Sciences and Mathematics Commons^™

Patterns Formed By Coins, Andrey M. Mishchenko

Journal of Humanistic Mathematics

This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non- overlapping circles. The first half of the article is an exposition of the two most important facts about circle packings, (1) that essentially whatever pattern we ask for, we may always arrange circles in that pattern, and (2) that under simple conditions on the pattern, there is an essentially unique arrangement of circles in that pattern. In the second half of the article, we consider related questions, but where we …

Some Geometry Of H(RN), Christopher Frayer

Furman University Electronic Journal of Undergraduate Mathematics

If X is a complete metric space, the collection of all non-empty compact subsets of X forms a complete metric space (H(X), h), where h is the Hausdorff metric. In this paper we explore some of the geometry of the space H(Rⁿ). Specifically, we concentrate on understanding lines in H(R). In particular, we show that for any two points A, B, ∈ H(Rⁿ), there exist infinitely many points on the line joining A and B. We characterize some points on the lines formed using closed …

Classification Of Spacetimes With Symmetry, Jesse W. Hicks

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Spacetimes with symmetry play a critical role in Einstein's Theory of General Relativity. Missing from the literature is a correct, usable, and computer accessible classification of such spacetimes. This dissertation fills this gap; specifically, we

i) give a new and different approach to the classification of spacetimes with symmetry using modern methods and tools such as the Schmidt method and computer algebra systems, resulting in ninety-two spacetimes;

ii) create digital databases of the classification for easy access and use for researchers;

iii) create software to classify any spacetime metric with symmetry against the new database;

iv) compare results of our …

The Exigency Of The Euclidean Parallel Postulate And The Pythagorean Theorem, Jerry Lodder

Geometry

No abstract provided.

Area And Volume Where Do The Formulas Come From?, Roger Yarnell

Masters Essays

No abstract provided.

Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.

CCE Theses and Dissertations

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …

Sisteme Vibrante Trilobice, Florentin Smarandache, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.