Mathematics Commons^™

A Traders Guide To The Predictive Universe- A Model For Predicting Oil Price Targets And Trading On Them, Jimmie Harold Lenz

Doctor of Business Administration Dissertations

At heart every trader loves volatility; this is where return on investment comes from, this is what drives the proverbial “positive alpha.” As a trader, understanding the probabilities related to the volatility of prices is key, however if you could also predict future prices with reliability the world would be your oyster. To this end, I have achieved three goals with this dissertation, to develop a model to predict future short term prices (direction and magnitude), to effectively test this by generating consistent profits utilizing a trading model developed for this purpose, and to write a paper that anyone with …

On The Exchange Property For The Mehler-Fock Transform, Abhishek Singh

Applications and Applied Mathematics: An International Journal (AAM)

The theory of Schwartz Distributions opened up a new area of mathematical research, which in turn has provided an impetus in the development of a number of mathematical disciplines, such as ordinary and partial differential equations, operational calculus, transformation theory and functional analysis. The integral transforms and generalized functions have also shown equivalent association of Boehmians and the integral transforms. The theory of Boehmians, which is a generalization of Schwartz distributions are discussed in this paper. Further, exchange property is defined to construct Mehler-Fock transform of tempered Boehmians. We investigate exchange property for the Mehler-Fock transform by using the theory …

Computation Of Real Radical Ideals By Semidefinite Programming And Iterative Methods, Fei Wang

Electronic Thesis and Dissertation Repository

Systems of polynomial equations with approximate real coefficients arise frequently as models in applications in science and engineering. In the case of a system with finitely many real solutions (the $0$ dimensional case), an equivalent system generates the so-called real radical ideal of the system. In this case the equivalent real radical system has only real (i.e., no non-real) roots and no multiple roots. Such systems have obvious advantages in applications, including not having to deal with a potentially large number of non-physical complex roots, or with the ill-conditioning associated with roots with multiplicity. There is a corresponding, but more …

General Equations For Natural Selection Under Complete Dominance, Kasthuri Kannan, Adriana Heguy

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

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 …

Cayley Graphs Of Semigroups And Applications To Hashing, Bianca Sosnovski

Dissertations, Theses, and Capstone Projects

In 1994, Tillich and Zemor proposed a scheme for a family of hash functions that uses products of matrices in groups of the form $SL_2(F_{2^n})$. In 2009, Grassl et al. developed an attack to obtain collisions for palindromic bit strings by exploring a connection between the Tillich-Zemor functions and maximal length chains in the Euclidean algorithm for polynomials over $F_2$.

In this work, we present a new proposal for hash functions based on Cayley graphs of semigroups. In our proposed hash function, the noncommutative semigroup of linear functions under composition is considered as platform for the scheme. We will also …

The Evolution Of Cryptology, Gwendolyn Rae Souza

Electronic Theses, Projects, and Dissertations

We live in an age when our most private information is becoming exceedingly difficult to keep private. Cryptology allows for the creation of encryptive barriers that protect this information. Though the information is protected, it is not entirely inaccessible. A recipient may be able to access the information by decoding the message. This possible threat has encouraged cryptologists to evolve and complicate their encrypting methods so that future information can remain safe and become more difficult to decode. There are various methods of encryption that demonstrate how cryptology continues to evolve through time. These methods revolve around different areas of …

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.

A Computational Investigation Of Large Gaps In Contingency Tables, Noah J. Watson

Senior Honors Projects, 2010-2019

Integer programming can be used to find upper and lower bounds on the cells of a multi-dimensional contingency table using the information from the released margins. The linear relaxation of these programs also provides bounds and the discrepancy between these bounds, the integer programming gap, can be large. While the more notable examples of large gaps have been shown to be rare, here we provide some results on the rarity of large gaps on small tables.

Population Projection And Habitat Preference Modeling Of The Endangered James Spinymussel (Pleurobema Collina), Marisa Draper

Senior Honors Projects, 2010-2019

The James Spinymussel (Pleurobema collina) is an endangered mussel species at the top of Virginia’s conservation list. The James Spinymussel plays a critical role in the environment by filtering and cleaning stream water while providing shelter and food for macroinvertebrates; however, conservation efforts are complicated by the mussels’ burrowing behavior, camouflage, and complex life cycle. The goals of the research conducted were to estimate detection probabilities that could be used to predict species presence and facilitate field work, and to track individually marked mussels to test for habitat preferences. Using existing literature and mark-recapture field data, these goals were accomplished …

Drawing Numbers And Listening To Patterns, Loren Zo Haynes

Honors College Theses

The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …

Klein Bottle Queries, Austin Lowe

Georgia State Undergraduate Research Conference

No abstract provided.

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.

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.

Procesy Cieplne I Aparaty (Lab), Wojciech M. Budzianowski

Wojciech Budzianowski

-

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.

Inżynieria Chemiczna Lab., Wojciech M. Budzianowski

Wojciech Budzianowski

-

Lose Big, Win Big, Sum Big: An Exploration Of Ranked Voting Systems, Erin Else Stuckenbruck

Senior Projects Spring 2016

Senior Project submitted to The Division of Science, Mathematics and Computing of Bard College.

Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda

Williams Honors College, Honors Research Projects

Let M be the additive abelian group of 3-by-3 matrices whose entries are from the ring of integers modulo 9. The problem of determining all the normal subgroups of the regular wreath product group P=Z₉≀(Z₃ × Z₃) that are contained in its base subgroup is equivalent to the problem of determining the subgroups of M that are invariant under two particular endomorphisms of M. In this thesis we give a partial solution to the latter problem by implementing a systematic approach using concepts from group theory and linear algebra.