Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Discrete Mathematics and Combinatorics
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
The Review: A Journal of Undergraduate Student Research
The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …
Counting The Moduli Space Of Pentagons On Finite Projective Planes, Maxwell Hosler
Counting The Moduli Space Of Pentagons On Finite Projective Planes, Maxwell Hosler
Senior Independent Study Theses
Finite projective planes are finite incidence structures which generalize the concept of the real projective plane. In this paper, we consider structures of points embedded in these planes. In particular, we investigate pentagons in general position, meaning no three vertices are colinear. We are interested in properties of these pentagons that are preserved by collineation of the plane, and so can be conceived as properties of the equivalence class of polygons up to collineation as a whole. Amongst these are the symmetries of a pentagon and the periodicity of the pentagon under the pentagram map, and a generalization of …
Stroke Clustering And Fitting In Vector Art, Khandokar Shakib
Stroke Clustering And Fitting In Vector Art, Khandokar Shakib
Senior Independent Study Theses
Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.
Multicolor Ramsey And List Ramsey Numbers For Double Stars, Jake Ruotolo
Multicolor Ramsey And List Ramsey Numbers For Double Stars, Jake Ruotolo
Honors Undergraduate Theses
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no matter how complex it is, we can always find a smaller substructure that has some sort of order. For a graph H, the k-color Ramsey number r(H; k) of H is the smallest integer n such that every k-edge-coloring of Kn contains a monochromatic copy of H. Despite active research for decades, very little is known about Ramsey numbers of graphs. This is especially true for r(H; k) when k is at least 3, also known as the multicolor Ramsey number of …