Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of New Mexico (5)
- The College of Wooster (4)
- Hamilton College (2)
- University of Nebraska - Lincoln (2)
- Western Kentucky University (2)
-
- Western University (2)
- California State University, San Bernardino (1)
- Claremont Colleges (1)
- Dordt University (1)
- East Tennessee State University (1)
- Georgia Southern University (1)
- Ministry of Higher and Secondary Specialized Education of the Republic of Uzbekistan (1)
- Montclair State University (1)
- St. John Fisher University (1)
- Taylor University (1)
- The University of Akron (1)
- University of Central Florida (1)
- University of Kentucky (1)
- University of Mary Washington (1)
- University of Richmond (1)
- Virginia Commonwealth University (1)
- Publication Year
- Publication
-
- Branch Mathematics and Statistics Faculty and Staff Publications (5)
- Senior Independent Study Theses (4)
- Articles (2)
- Masters Theses & Specialist Projects (2)
- Undergraduate Student Research Internships Conference (2)
-
- All HMC Faculty Publications and Research (1)
- Central Asian Problems of Modern Science and Education (1)
- Computer Science Articles (1)
- Department of Math & Statistics Faculty Publications (1)
- Department of Mathematics Facuty Scholarship and Creative Works (1)
- Electronic Theses and Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Faculty Work Comprehensive List (1)
- Honors College Theses (1)
- Honors Theses (1)
- Honors Undergraduate Theses (1)
- Mathematics Student Projects (1)
- The Review: A Journal of Undergraduate Student Research (1)
- Theses and Dissertations--Mathematics (1)
- Undergraduate Research Posters (1)
- Williams Honors College, Honors Research Projects (1)
- Zea E-Books Collection (1)
- Publication Type
Articles 1 - 30 of 32
Full-Text Articles in Physical Sciences and Mathematics
Counting Conjugates Of Colored Compositions, Jesus Omar Sistos Barron
Counting Conjugates Of Colored Compositions, Jesus Omar Sistos Barron
Honors College Theses
The properties of n-color compositions have been studied parallel to those of regular compositions. The conjugate of a composition as defined by MacMahon, however, does not translate well to n-color compositions, and there is currently no established analogous concept. We propose a conjugation rule for cyclic n-color compositions. We also count the number of self-conjugates under these rules and establish a couple of connections between these and regular compositions.
The Traveling Salesman Problem At Taylor University, Jonathan Jinoo Pawley
The Traveling Salesman Problem At Taylor University, Jonathan Jinoo Pawley
Mathematics Student Projects
What is the shortest route to walk to every residence hall on campus, beginning and ending with the same hall? This question can be considered by applying the Traveling Salesman Problem, an easy to understand yet hard to solve problem in the realm of discrete combinatorial optimization. The Traveling Salesman Problem is useful as an introduction to optimization problems, and it also has immensely practical applications. This paper will serve as an introduction to the computational difficulty of the Traveling Salesman Problem and will also explore various approximation algorithms. We will subsequently apply our new understanding of the theory to …
Incorporating Perspectival Elements In A Discrete Mathematics Course, Calvin Jongsma
Incorporating Perspectival Elements In A Discrete Mathematics Course, Calvin Jongsma
Faculty Work Comprehensive List
Discrete mathematics is a vast field that can be explored along many different paths. Opening with a unit on logic and proof and then taking up some additional core topics (induction, set theory, combinatorics, relations, Boolean algebra, graph theory) allows one to bring in a wealth of relevant material on history, philosophy, axiomatics, and abstraction in very natural ways. This talk looks at how my 2019 textbook on discrete mathematics, focused in this way, came to be, and it highlights the various perspectival elements the book includes.
Strong Homotopy Lie Algebras And Hypergraphs, Samuel J. Bevins, Marco Aldi
Strong Homotopy Lie Algebras And Hypergraphs, Samuel J. Bevins, Marco Aldi
Undergraduate Research Posters
We study hypergraphs by attaching a nilpotent strong homotopy Lie algebra. We especially focus on hypergraph theoretic information that is encoded in the cohomology of the resulting strong homotopy Lie algebra.
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 …
Categorical Aspects Of Graphs, Jacob D. Ender
Categorical Aspects Of Graphs, Jacob D. Ender
Undergraduate Student Research Internships Conference
In this article, we introduce a categorical characterization of directed and undirected graphs, and explore subcategories of reflexive and simple graphs. We show that there are a number of adjunctions between such subcategories, exploring varying combinations of graph types.
Spectral Graph Theory And Research, Nathan H. Kershaw, Lewis Glabush
Spectral Graph Theory And Research, Nathan H. Kershaw, Lewis Glabush
Undergraduate Student Research Internships Conference
Our topic of study was Spectral Graph Theory. We studied the algebraic methods used to study the properties of graphs (networks) and became familiar with the applications of network analysis. We spent a significant amount of time studying the way virus’s spread on networks, with particular applications to Covid-19. We also investigated the relationship between graph spectra and structural properties.
Partial Representations For Ternary Matroids, Ebony Perez
Partial Representations For Ternary Matroids, Ebony Perez
Electronic Theses, Projects, and Dissertations
In combinatorics, a matroid is a discrete object that generalizes various notions of dependence that arise throughout mathematics. All of the information about some matroids can be encoded (or represented) by a matrix whose entries come from a particular field, while other matroids cannot be represented in this way. However, for any matroid, there exists a matrix, called a partial representation of the matroid, that encodes some of the information about the matroid. In fact, a given matroid usually has many different partial representations, each providing different pieces of information about the matroid. In this thesis, we investigate when a …
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions. As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …
Innovative Approach To Solving Combinatic Elements And Some Problems Of Newton Binomy In School Mathematics Course, Nilufar Okbayeva
Innovative Approach To Solving Combinatic Elements And Some Problems Of Newton Binomy In School Mathematics Course, Nilufar Okbayeva
Central Asian Problems of Modern Science and Education
This article provides information on the elements of combinatorics in the school mathematics course and solutions to some problems related to the Newtonian binomial. This article is also aimed at solving problems related to the indepth study of the elements of combinatorics in the school course, the creation of a sufficient basis for the study of probability theory and mathematical statistics in the future.
A Mathematical Model Of Speeding, Jared Ott, Xavier Pérez Giménez
A Mathematical Model Of Speeding, Jared Ott, Xavier Pérez Giménez
Honors Theses
Crime is often regarded as nonsensical, impulsive, and irrational. These conjectures are pointed, though conversation about the pros and cons of crime does not happen often. People point to harsh fines, jail times, and life restrictions as their reason for judgement, stating that the trade-offs are far too unbalanced to participate in illicit activity. Yet, everyday people commit small crimes, sometimes based on hedonistic desires, other times based on a rational thought process.
Speeding seems to be one of those that almost all people commit at least once during their life. Our work hopes to make an incremental improvement on …
A Cool Brisk Walk Through Discrete Mathematics, Stephen Davies
A Cool Brisk Walk Through Discrete Mathematics, Stephen Davies
Computer Science Articles
A Cool Brisk Walk Through Discrete Mathematics - and its companion site "allthemath" - are completely-and-forever-free-and-open-source educational materials dedicated to the mathematics that budding computer science practitioners actually need to know. They feature the fun and addictive teaching of award-winning lecturer Dr. Stephen Davies of the University of Mary Washington in Fredericksburg, Virginia!
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
Senior Independent Study Theses
Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.
Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok
Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok
Theses and Dissertations--Mathematics
This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.
We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …
Properties Of Functionally Alexandroff Topologies And Their Lattice, Jacob Scott Menix
Properties Of Functionally Alexandroff Topologies And Their Lattice, Jacob Scott Menix
Masters Theses & Specialist Projects
This thesis explores functionally Alexandroff topologies and the order theory asso- ciated when considering the collection of such topologies on some set X. We present several theorems about the properties of these topologies as well as their partially ordered set.
The first chapter introduces functionally Alexandroff topologies and motivates why this work is of interest to topologists. This chapter explains the historical context of this relatively new type of topology and how this work relates to previous work in topology. Chapter 2 presents several theorems describing properties of functionally Alexandroff topologies ad presents a characterization for the functionally Alexandroff topologies …
Neutrosophic Triplet Structures - Vol. 1, Florentin Smarandache, Memet Sahin
Neutrosophic Triplet Structures - Vol. 1, Florentin Smarandache, Memet Sahin
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs, the properties of neutrosophic sets …
Runs Of Identical Outcomes In A Sequence Of Bernoulli Trials, Matthew Riggle
Runs Of Identical Outcomes In A Sequence Of Bernoulli Trials, Matthew Riggle
Masters Theses & Specialist Projects
The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we will consider repeated Bernoulli trials in order to study runs of identical outcomes. More formally, for t ∈ N, we let Xt ∼ Bernoulli(p), where p is the probability of success, q = 1 − p is the probability of failure, and all Xt are independent. Then Xt gives the outcome of the tth trial, which is 1 for success or 0 for failure. For n, m ∈ N, we define Tn to be the number of trials needed to first observe n …
Six Septembers: Mathematics For The Humanist, Patrick Juola, Stephen Ramsay
Six Septembers: Mathematics For The Humanist, Patrick Juola, Stephen Ramsay
Zea E-Books Collection
Scholars of all stripes are turning their attention to materials that represent enormous opportunities for the future of humanistic inquiry. The purpose of this book is to impart the concepts that underlie the mathematics they are likely to encounter and to unfold the notation in a way that removes that particular barrier completely. This book is a primer for developing the skills to enable humanist scholars to address complicated technical material with confidence. This book, to put it plainly, is concerned with the things that the author of a technical article knows, but isn’t saying. Like any field, mathematics operates …
New Facets Of The Balanced Minimal Evolution Polytope, Logan Keefe
New Facets Of The Balanced Minimal Evolution Polytope, Logan Keefe
Williams Honors College, Honors Research Projects
The balanced minimal evolution (BME) polytope arises from the study of phylogenetic trees in biology. It is a geometric structure which has a variant for each natural number n. The main application of this polytope is that we can use linear programming with it in order to determine the most likely phylogenetic tree for a given genetic data set. In this paper, we explore the geometric and combinatorial structure of the BME polytope. Background information will be covered, highlighting some points from previous research, and a new result on the structure of the BME polytope will be given.
The Encyclopedia Of Neutrosophic Researchers - Vol. 1, Florentin Smarandache
The Encyclopedia Of Neutrosophic Researchers - Vol. 1, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
This is the first volume of the Encyclopedia of Neutrosophic Researchers, edited from materials offered by the authors who responded to the editor’s invitation. The authors are listed alphabetically. The introduction contains a short history of neutrosophics, together with links to the main papers and books. Neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics, neutrosophic measure, neutrosophic precalculus, neutrosophic calculus and so on are gaining significant attention in solving many real life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. In the past years the fields of neutrosophics have been extended and applied in various fields, such as: …
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in NCMs, NRMs and NREs with appropriate modifications.
Mathematics For Everything With Combinatorics On Nature – A Report On The Promoter Dr. Linfan Mao Of Mathematical Combinatorics, Florentin Smarandache
Mathematics For Everything With Combinatorics On Nature – A Report On The Promoter Dr. Linfan Mao Of Mathematical Combinatorics, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
The science’s function is realizing the natural world, developing our society in coordination with natural laws and the mathematics provides the quantitative tool and method for solving problems helping with that understanding. Generally, understanding a natural thing by mathematical ways or means to other sciences are respectively establishing mathematical model on typical characters of it with analysis first, and then forecasting its behaviors, and finally, directing human beings for hold on its essence by that model.
I Don't Play Chess: A Study Of Chess Piece Generating Polynomials, Stephen R. Skoch
I Don't Play Chess: A Study Of Chess Piece Generating Polynomials, Stephen R. Skoch
Senior Independent Study Theses
This independent study examines counting problems of non-attacking rook, and non-attacking bishop placements. We examine boards for rook and bishop placement with restricted positions and varied dimensions. In this investigation, we discuss the general formula of a generating function for unrestricted, square bishop boards that relies on the Stirling numbers of the second kind. We discuss the maximum number of bishops we can place on a rectangular board, as well as a brief investigation of non-attacking rook placements on three-dimensional boards, drawing a connection to latin squares.
Non-Simplicial Decompositions Of Betti Diagrams Of Complete Intersections, Courtney Gibbons, Jack Jeffries, Sarah Mayes-Tang, Claudiu Raicu, Branden Stone, Bryan White
Non-Simplicial Decompositions Of Betti Diagrams Of Complete Intersections, Courtney Gibbons, Jack Jeffries, Sarah Mayes-Tang, Claudiu Raicu, Branden Stone, Bryan White
Articles
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-Soederberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences in such pure diagrams be totally ordered, we are able to define a multiplication law for Betti diagrams that respects the decomposition and allows us to write a simple expression of the decomposition of the Betti diagram of any complete intersection in terms of the degrees of its minimal generators. In the more traditional sense, the decomposition of complete intersections of codimension at most 3 …
Algebraic Structures On Real And Neutrosophic Semi Open Squares, Florentin Smarandache, W.B. Vasantha Kandasamy
Algebraic Structures On Real And Neutrosophic Semi Open Squares, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Here for the first time we introduce the semi open square using modulo integers. Authors introduce several algebraic structures on them. These squares under addition modulo ‘n’ is a group and however under product this semi open square is only a semigroup as under the square has infinite number of zero divisors. Apart from + and we define min and max operation on this square. Under min and max operation this semi real open square is a semiring. It is interesting to note that this semi open square is not a ring under + and since …
Global Domination Stable Graphs, Elizabeth Marie Harris
Global Domination Stable Graphs, Elizabeth Marie Harris
Electronic Theses and Dissertations
A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.
A Census Of Vertices By Generations In Regular Tessellations Of The Plane, Alice Paul '12, Nicholas Pippenger
A Census Of Vertices By Generations In Regular Tessellations Of The Plane, Alice Paul '12, Nicholas Pippenger
All HMC Faculty Publications and Research
We consider regular tessellations of the plane as infinite graphs in which q edges and q faces meet at each vertex, and in which p edges and p vertices surround each face. For 1/p + 1/q = 1/2, these are tilings of the Euclidean plane; for 1/p + 1/q < 1/2, they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distance (as measured by the number of edges in a shortest path) from the origin. For all p ≥ 3 and q ≥ 3 with 1/p + 1/q ≤ 1/2, we give simple combinatorial derivations of the rational generating functions for the number of vertices in each generation.