Open Access. Powered by Scholars. Published by Universities.®

Other Applied Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 1 - 28 of 28

Full-Text Articles in Other Applied Mathematics

A New Approach To Generate Combinatorial Patterns In Logical Analysis Of Data And Its Application To Predict College Retention, Salihah Ahmed E. Jaafari May 2026

A New Approach To Generate Combinatorial Patterns In Logical Analysis Of Data And Its Application To Predict College Retention, Salihah Ahmed E. Jaafari

Theses and Dissertations

Student retention and degree completion remain central challenges for higher-education institutions, with significant implications for student success, institutional effectiveness, and public accountability. While advances in predictive analytics have enabled earlier identification of students at risk of withdrawal, many commonly used machine learning approaches suffer from limited interpretability, constraining their practical usefulness for advising, intervention, and policy decision making. This dissertation addresses the problem of predicting student persistence by developing and evaluating optimization based, interpretable classification models within the Logical Analysis of Data (LAD) framework. Building on existing LAD formulations, this research introduces two novel pattern generation models, the Best Term …


Problems In Chemical Graph Theory Related To The Merrifield-Simmons And Hosoya Topological Indices, William B. O'Reilly Jan 2024

Problems In Chemical Graph Theory Related To The Merrifield-Simmons And Hosoya Topological Indices, William B. O'Reilly

College of Graduate Studies: Theses & Dissertations

In some sense, chemical graph theory applies graph theory to various physical sciences. This interdisciplinary field has significant applications to structure property relationships, as well as mathematical modeling. In particular, we focus on two important indices widely used in chemical graph theory, the Merrifield-Simmons index and Hosoya index. The Merrifield-Simmons index and the Hosoya index are two well-known topological indices used in mathematical chemistry for characterizing specific properties of chemical compounds. Substantial research has been done on the two indices in terms of enumerative problems and extremal questions. In this thesis, we survey known extremal results and consider the generalized …


Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia Dec 2023

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …


Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim Aug 2023

Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim

Electronic Theses, Projects, and Dissertations

Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …


Waste Treatment Facility Location For Hotel Chains, Dolores R. Santos-Peñate, Rafael R. Suárez-Vega, Carmen Florido De La Nuez Jun 2023

Waste Treatment Facility Location For Hotel Chains, Dolores R. Santos-Peñate, Rafael R. Suárez-Vega, Carmen Florido De La Nuez

ITSA 2022 Gran Canaria - 9th Biennial Conference: Corporate Entrepreneurship and Global Tourism Strategies After Covid 19

Tourism generates huge amounts of waste. About half of the waste generated by hotels is food and garden bio-waste. This bio-waste can be used to make compost and pellets. In turn, pellets can be used as an absorbent material in composters and as an energy source. We consider the problem of locating composting and pellet-making facilities so that the bio-waste generated by a chain of hotels can be managed at or close to the generation points. An optimization model is applied to locate the facilities and allocate the waste and products, and several scenarios are analysed. The study shows that, …


The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares Jun 2021

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares

Open Educational Resources

This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …


Analyzing And Creating Playing Card Cryptosystems, Isaac A. Reiter Jan 2021

Analyzing And Creating Playing Card Cryptosystems, Isaac A. Reiter

Honors Student Research

Before computers, military tacticians and government agents had to rely on pencil-and-paper methods to encrypt information. For agents that want to use low-tech options in order to minimize their digital footprint, non-computerized ciphers are an essential component of their toolbox. Still, the presence of computers limits the pool of effective hand ciphers. If a cipher is not unpredictable enough, then a computer will easily be able to break it. There are 52! ≈ 2^225.58 ways to mix a deck of cards. If each deck order is a key, this means that there are 52! ≈ 2^225.58 different ways to encrypt …


Algebraic And Combinatorial Approaches For Counting Cycles Arising In Population Biology, Brian Chau Nov 2020

Algebraic And Combinatorial Approaches For Counting Cycles Arising In Population Biology, Brian Chau

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.


Dna Self-Assembly Design For Gear Graphs, Chiara Mattamira Nov 2020

Dna Self-Assembly Design For Gear Graphs, Chiara Mattamira

Rose-Hulman Undergraduate Mathematics Journal

Application of graph theory to the well-known complementary properties of DNA strands has resulted in new insights about more efficient ways to form DNA nanostructures, which have been discovered as useful tools for drug delivery, biomolecular computing, and biosensors. The key concept underlying DNA nanotechnology is the formation of complete DNA complexes out of a given collection of branched junction molecules. These molecules can be modeled in the abstract as portions of graphs made up of vertices and half-edges, where complete edges are representations of double-stranded DNA pieces that have joined together. For efficiency, one aim is to minimize the …


Dna Complexes Of One Bond-Edge Type, Andrew Tyler Lavengood-Ryan Jun 2020

Dna Complexes Of One Bond-Edge Type, Andrew Tyler Lavengood-Ryan

Electronic Theses, Projects, and Dissertations

DNA self-assembly is an important tool used in the building of nanostructures and targeted virotherapies. We use tools from graph theory and number theory to encode the biological process of DNA self-assembly. The principal component of this process is to examine collections of branched junction molecules, called pots, and study the types of structures that such pots can realize. In this thesis, we restrict our attention to pots which contain identical cohesive-ends, or a single bond-edge type, and we demonstrate the types and sizes of structures that can be built based on a single characteristic of the pot that is …


A Mathematical Model Of Speeding, Jared Ott, Xavier Pérez Giménez Mar 2020

A Mathematical Model Of Speeding, Jared Ott, Xavier Pérez Giménez

Honors Program: Senior Projects (Public)

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 …


Model Selection And Experimental Design Of Biological Networks With Algebraic Geometry, Anyu Zhang Dec 2019

Model Selection And Experimental Design Of Biological Networks With Algebraic Geometry, Anyu Zhang

Mathematics Theses and Dissertations

Model selection based on experimental data is an essential challenge in biological data science. In decades, the volume of biological data from varied sources, including laboratory experiments, field observations, and patient health records has seen an unprecedented increase. Mainly when collecting data is expensive or time-consuming, as it is often in the case with clinical trials and biomolecular experiments, the problem of selecting information-rich data becomes crucial for creating relevant models.

Motivated by certain geometric relationships between data, we partitioned input data sets, especially data sets that correspond to a unique basis, into equivalence classes with the same basis to …


Design Of Experiments For Unique Wiring Diagram Identification, Elena Dimitrova Oct 2019

Design Of Experiments For Unique Wiring Diagram Identification, Elena Dimitrova

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.


Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr. Jun 2019

Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr.

Electronic Theses, Projects, and Dissertations

Many properties have been found hidden in Pascal's triangle. In this paper, we will present several known properties in Pascal's triangle as well as the properties that lift to different extensions of the triangle, namely Pascal's pyramid and the trinomial triangle. We will tailor our interest towards Fermat numbers and the hockey stick property. We will also show the importance of the hockey stick properties by using them to prove a property in the trinomial triangle.


Tropical Algebra, Graph Theory, & Foreign Exchange Arbitrage, Bradley A. Mason May 2017

Tropical Algebra, Graph Theory, & Foreign Exchange Arbitrage, Bradley A. Mason

Senior Honors Projects, 2010-2019

We answer the question, given n currencies and k trades, how can a maximal arbitrage opportunity be found and what is its value? To answer this question, we use techniques from graph theory and employ a max-plus algebra (commonly known as tropical algebra). Further, we show how the tropical eigenvalue of a foreign exchange rate matrix relates to arbitrage among the currencies and can be found algorithmically. We finish by employing time series techniques to study the stability of maximal, high-currency arbitrage opportunities.


Differentiating Between A Protein And Its Decoy Using Nested Graph Models And Weighted Graph Theoretical Invariants, Hannah E. Green May 2017

Differentiating Between A Protein And Its Decoy Using Nested Graph Models And Weighted Graph Theoretical Invariants, Hannah E. Green

Electronic Theses and Dissertations

To determine the function of a protein, we must know its 3-dimensional structure, which can be difficult to ascertain. Currently, predictive models are used to determine the structure of a protein from its sequence, but these models do not always predict the correct structure. To this end we use a nested graph model along with weighted invariants to minimize the errors and improve the accuracy of a predictive model to determine if we have the correct structure for a protein.


On The Three Dimensional Interaction Between Flexible Fibers And Fluid Flow, Bogdan Nita, Ryan Allaire Jan 2017

On The Three Dimensional Interaction Between Flexible Fibers And Fluid Flow, Bogdan Nita, Ryan Allaire

Department of Mathematics Faculty Scholarship and Creative Works

In this paper we discuss the deformation of a flexible fiber clamped to a spherical body and immersed in a flow of fluid moving with a speed ranging between 0 and 50 cm/s by means of three dimensional numerical simulation developed in COMSOL . The effects of flow speed and initial configuration angle of the fiber relative to the flow are analyzed. A rigorous analysis of the numerical procedure is performed and our code is benchmarked against well established cases. The flow velocity and pressure are used to compute drag forces upon the fiber. Of particular interest is the behavior …


Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri Jan 2017

Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri

Theses and Dissertations

miRNAs are non-coding RNAs of approx. 22 nucleotides in length that inhibit gene expression at the post-transcriptional level. By virtue of this gene regulation mechanism, miRNAs play a critical role in several biological processes and patho-physiological conditions, including cancers. miRNA behavior is a result of a multi-level complex interaction network involving miRNA-mRNA, TF-miRNA-gene, and miRNA-chemical interactions; hence the precise patterns through which a miRNA regulates a certain disease(s) are still elusive. Herein, I have developed an integrative genomics methods/pipeline to (i) build a miRNA regulomics and data analytics repository, (ii) create/model these interactions into networks and use optimization techniques, motif …


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

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.


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

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.


Analysis Of Discrete Fractional Operators And Discrete Fractional Rheological Models, Meltem Uyanik May 2015

Analysis Of Discrete Fractional Operators And Discrete Fractional Rheological Models, Meltem Uyanik

Masters Theses & Specialist Projects

This thesis is comprised of two main parts: Monotonicity results on discrete fractional operators and discrete fractional rheological constitutive equations. In the first part of the thesis, we introduce and prove new monotonicity concepts in discrete fractional calculus. In the remainder, we carry previous results about fractional rheological models to the discrete fractional case. The discrete method is expected to provide a better understanding of the concept than the continuous case as this has been the case in the past. In the first chapter, we give brief information about the main results. In the second chapter, we present some fundamental …


A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba May 2015

A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba

Electronic Theses and Dissertations

One of the most prevalent inherited diseases is cystic fibrosis. This disease is caused by a mutation in a membrane protein, the cystic fibrosis transmembrane conductance regulator (CFTR). CFTR is known to function as a chloride channel that regulates the viscosity of mucus that lines the ducts of a number of organs. Generally, most of the prevalent mutations of CFTR are located in one of two nucleotide binding domains, namely, the nucleotide binding domain 1 (NBD1). However, some mutations in nucleotide binding domain 2 (NBD2) can equally cause cystic fibrosis. In this work, a hierarchical graph is built for NBD2. …


Graphs Of Classroom Networks, Rebecca Holliday Jan 2015

Graphs Of Classroom Networks, Rebecca Holliday

College of Graduate Studies: Theses & Dissertations

In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …


Reichenbach Fuzzy Set Of Transitivity, Samina Ashraf, Muhammad A. Javed Jun 2014

Reichenbach Fuzzy Set Of Transitivity, Samina Ashraf, Muhammad A. Javed

Applications and Applied Mathematics: An International Journal (AAM)

Fuzzy implicators are the basic ingredients of many applications. So it becomes essential to study the various features of an implicator before implementing it in any practical application. This paper discusses the properties of transitivity of a fuzzy relation on a given universe and measure of fuzzy transitivity defined in terms of the Reichenbach fuzzy implicator which is an s-implicator.


Combinatorial And Algebraic Coding Techniques For Flash Memory Storage, Kathryn A. Haymaker Apr 2014

Combinatorial And Algebraic Coding Techniques For Flash Memory Storage, Kathryn A. Haymaker

Department of Mathematics: Dissertations, Theses, and Student Research

Error-correcting codes are used to achieve reliable and efficient transmission when storing or sending information across a noisy channel. This thesis investigates a mathematical approach to coding techniques for storage devices such as flash memory storage, although many of the resulting codes and coding schemes can be applied in other contexts. The main contributions of this work include the design of efficient codes and decoding algorithms using discrete structures such as graphs and finite geometries, and developing a variety of strategies for adapting codes to a multi-level setting.

Information storage devices are prone to errors over time, and the frequency …


Packings And Coverings Of Complete Graphs With A Hole With The 4-Cycle With A Pendant Edge, Yan Xia Aug 2013

Packings And Coverings Of Complete Graphs With A Hole With The 4-Cycle With A Pendant Edge, Yan Xia

Electronic Theses and Dissertations

In this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and unrestricted coverings. Necessary and sufficient conditions are given for such structures for (1) complete graphs Kv, (2) complete bipartite graphs Km,n, and (3) complete graphs with a hole K(v,w).


Generating Minimal Pair-Wise Covering Test Suites, Luis C. Gutierrez ^, Martine Ceberio * Apr 2012

Generating Minimal Pair-Wise Covering Test Suites, Luis C. Gutierrez ^, Martine Ceberio *

COURI Symposium Abstracts, Spring 2012

Software is ubiquitous and needs to be reliable. Software testing therefore plays an important role in software development. Proper testing a software system informs about its quality and reliability so as to prevent unexpected behavior during system execution. One of the methods to prevent failures consists in testing a system under different input values, but when all possible input values are tested, an impractical number of test cases might result. In software testing, pair-wise testing is a combinatorial technique which uses combination of pair input values to generate test cases. Using pair-wise testing dramatically reduces the number of test cases, …


Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul May 2010

Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul

Masters Theses & Specialist Projects

Almost every theory of mathematics has its discrete counterpart that makes it conceptually easier to understand and practically easier to use in the modeling process of real world problems. For instance, one can take the "difference" of any function, from 1st order up to the n-th order with discrete calculus. However, it is also possible to extend this theory by means of discrete fractional calculus and make n- any real number such that the ½-th order difference is well defined. This thesis is comprised of five chapters that demonstrate some basic definitions and properties of discrete fractional calculus …