Physical Sciences and Mathematics Commons^™

Limiting Forms Of Iterated Circular Convolutions Of Planar Polygons, Boyan Kostadinov

Publications and Research

We consider a complex representation of an arbitrary planar polygon P centered at the origin. Let P(1) be the normalized polygon obtained from P by connecting the midpoints of its sides and normalizing the complex vector of vertex coordinates. We say that P(1) is a normalized average of P. We identify this averaging process with a special case of a circular convolution. We show that if the convolution is repeated many times, then for a large class of polygons the vertices of the limiting polygon lie either on an ellipse or on a star-shaped polygon. We derive a complete and …

Creating Art Patterns With Math And Code, Boyan Kostadinov

Publications and Research

The goal of this talk is to showcase some visualization projects that we developed for a 3-day Code in R summer program, designed to inspire the creative side of our STEM students by engaging them with computational projects that we developed with the purpose of mixing calculus level math and code to create complex geometric patterns. One of the goals of this program was to attract more minority and female students into applied math and computer science majors.

The projects are designed to be implemented using the high-level, open-source and free computational environment R, a popular software in industry for …

Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook

Mathematics: Student Scholarship & Creative Works

While other sports have statisticians to evaluate players and their stats, in electronic sports there is a need for statisticians to evaluate different parts of the game. League of Legends is the most popular of ESports and is the focus of this discussion. The mechanic of focus here is runes which give boosts to the players stats in-game like being able to do extra damage. We will be finding the effectiveness of these runes by looking at gold efficiency, help with last hitting, and extra damage dealt through the use of Python.

Variance Of Clusterings On Graphs, Thomas Vlado Mulc

Mathematical Sciences Technical Reports (MSTR)

Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.

Catching Card Counters, Sarah French

Honors Projects in Mathematics

The casino industry has been researched through a variety of disciplines including psychological gambling habits, technological advances, business strategies, and mathematical simulations. In the vast number of studies that have been conducted, there are few scholarly articles that focus on the specific aspect of card counting. The majority of games in the casino are designed to favor the “house”. This study focuses on the game of blackjack, in which players using a card counting strategy can tip the odds in their favor. A computer simulation was used to model the betting strategy of a card counter who would bet methodically. …

How Much Should You Pay For A Financial Derivative?, Boyan Kostadinov

Publications and Research

We explain some key mathematical ideas behind the no-arbitrage pricing of financial derivatives by replication, starting from a simple coin toss model and ending with the continuous-time limit of a multi-step coin-toss model using a geometric random walk model. In the limit, we obtain the classical Black-Scholes-Merton formula for pricing European call and put options.

Single Valued Neutrosophic Graphs, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of single valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets. We apply the concept of single valued neutrosophic sets, an instance of neutrosophic sets, to graphs. We introduce certain types of single valued neutrosophic graphs (SVNG) and investigate some of their properties with proofs and examples.

Multiple Problem-Solving Strategies Provide Insight Into Students’ Understanding Of Open-Ended Linear Programming Problems, Marla A. Sole

Publications and Research

Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students’ unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex, familiar solution strategies rather than simpler, more intuitive strategies, which suggests that students might need more experience working with informal solution methods. During the semester, by incorporating open-ended questions, I gained valuable feedback, was able to better model real-world problems, challenge students with different abilities, and strengthen students’ problem solving skills.

A Competitive Random Sequential Adsorption Model For Immunoassay Activity, Dana Mackey, Eilis Kelly, Robert Nooney

Conference papers

Immunoassays rely on highly specific reactions between antibodies and antigens and are used in biomedical diagnostics applications to detect biomarkers for a variety of diseases. Antibody immobilization to solid interfaces through random adsorption is a widely used technique but has the disadvantage of severely reducing the antigen binding activity and, consequently, the assay performance. This paper proposes a simple mathematical framework, based on the theory known as competitive random sequential adsorption (CRSA), for describing how the activity of immobilized antibodies depends on their orientation and packing density and generalizes a previous model by introducing the antibody aspect ratio as an …

The Mathematics Of Scientific Research: Scientometrics, Citation Metrics, And Impact Factors, Clayton Hayes

Library Scholarly Publications

This talk will consist of an introduction to the rationale behind the establishment of the field of Scientometrics, which attempts to measure and analyze the body of research done in the sciences. This is primarily through analyzing the connections between scientific journals, articles, and authors. I will cover the foundational works of Price and Garfield in the fields of citation networks and impact factor, respectively, and will give some historical context for these developments. I will also speak briefly on more recent developments in these areas, such as the Eigenfactor, author citation metrics, and (time permitting) alternative metrics.

Audience: …