Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Combinatorics (2)
- Discrete Mathematics (2)
- Graph Theory (2)
- AI (1)
- Academic -- UNF -- Master of Science in Mathematical Science; Dissertations (1)
-
- Academic -- UNF -- Mathematics; Finite State Automata; Regular Languages; Subword Closure; Involution Mappings; Strictly Locally Testable Languages; DNA Code Words (1)
- Artificial Intelligence (1)
- Chinese remainder theorem (1)
- Complexity (1)
- Destination node (1)
- Discrete math (1)
- Fractional Calculus (1)
- Game (1)
- Game Theory (1)
- Graph (1)
- Heuristic function (1)
- Interval Valued Neutrosophic Graph (1)
- Mathematical Modeling (1)
- Mathematics (1)
- Modular arithmetic (1)
- NeighborNet (1)
- Number theory (1)
- Orthomorphism (1)
- PSPACE (1)
- Pharmacodynamics (1)
- Pharmacokinetics (1)
- Phylogenetic Networks (1)
- Santorini (1)
- Score Function (1)
- Shortest Path Problem (1)
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Other Mathematics
The Name Tag Problem, Christian Carley
The Name Tag Problem, Christian Carley
Rose-Hulman Undergraduate Mathematics Journal
The Name Tag Problem is a thought experiment that, when formalized, serves as an introduction to the concept of an orthomorphism of $\Zn$. Orthomorphisms are a type of group permutation and their graphs are used to construct mutually orthogonal Latin squares, affine planes and other objects. This paper walks through the formalization of the Name Tag Problem and its linear solutions, which center around modular arithmetic. The characterization of which linear mappings give rise to these solutions developed in this paper can be used to calculate the exact number of linear orthomorphisms for any additive group Z/nZ, which is demonstrated …
H-Discrete Fractional Model Of Tumor Growth And Anticancer Effects Of Mono And Combination Therapies, Kamala Dadashova
H-Discrete Fractional Model Of Tumor Growth And Anticancer Effects Of Mono And Combination Therapies, Kamala Dadashova
Masters Theses & Specialist Projects
In this thesis, we focus on h–discrete and h–discrete fractional representation of a pharmacokinetics-pharmacodynamics (PK-PD) model which describes tumor growth considering time on hNa, where h>0. First, we introduce some definitions, lemmas and theorems on both h–discrete and h–discrete fractional calculus in the preliminary section. In Chapter 3, we work on the PD model with delay by exam ining nabla h–discrete equations and nabla h–discrete fractional equations as well as variation of constants formulas, accordingly. We introduce our model and solve it using theorems we proved in the last section of the indicated chapter. When we do simulation for …
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.
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Williams Honors College, Honors Research Projects
Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate …
Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones
Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones
UNF Graduate Theses and Dissertations
Characterizing languages D that are maximal with the property that D* ⊆ S⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S⊗, the set of words whose subwords of that fixed length are all in the constraint. We investigate these maximal languages and present characterizations for them. These characterizations use strongly connected components of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that …
Interval Valued Neutrosophic Shortest Path Problem By A* Algorithm, Florentin Smarandache, S. Khrisna Prabha, Said Broumi
Interval Valued Neutrosophic Shortest Path Problem By A* Algorithm, Florentin Smarandache, S. Khrisna Prabha, Said Broumi
Branch Mathematics and Statistics Faculty and Staff Publications
Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path …