Discrete Mathematics and Combinatorics Commons^™

On T-Restricted Optimal Rubbling Of Graphs, Kyle Murphy

Electronic Theses and Dissertations

For a graph G = (V;E), a pebble distribution is defined as a mapping of the vertex set in to the integers, where each vertex begins with f(v) pebbles. A pebbling move takes two pebbles from some vertex adjacent to v and places one pebble on v. A rubbling move takes one pebble from each of two vertices that are adjacent to v and places one pebble on v. A vertex x is reachable under a pebbling distribution f if there exists some sequence of rubbling and pebbling moves that places a pebble on x. A pebbling distribution where every …

"Returning To The Root" Of The Problem: Improving The Social Condition Of African Americans Through Science And Mathematics Education, Vanessa R. Pitts Bannister, Julius Davis, Jomo Mutegi, Latasha Thompson, Deborah Lewis

Catalyst: A Social Justice Forum

The underachievement and underrepresentation of African Americans in STEM (Science, Technology, Engineering and Mathematics) disciplines have been well documented. Efforts to improve the STEM education of African Americans continue to focus on relationships between teaching and learning and factors such as culture, race, power, class, learning preferences, cultural styles and language. Although this body of literature is deemed valuable, it fails to help STEM teacher educators and teachers critically assess other important factors such as pedagogy and curriculum. In this article, the authors argue that both pedagogy and curriculum should be centered on the social condition of African Americans – …

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 …

Discrete Fractional Hermite-Hadamard Inequality, Aykut Arslan

Masters Theses & Specialist Projects

This thesis is comprised of three main parts: The Hermite-Hadamard inequality on discrete time scales, the fractional Hermite-Hadamard inequality, and Karush-Kuhn- Tucker conditions on higher dimensional discrete domains. In the first part of the thesis, Chapters 2 & 3, we define a convex function on a special time scale T where all the time points are not uniformly distributed on a time line. With the use of the substitution rules of integration we prove the Hermite-Hadamard inequality for convex functions defined on T. In the fourth chapter, we introduce fractional order Hermite-Hadamard inequality and characterize convexity in terms of this …

Stability Of Linear Difference Systems In Discrete And Fractional Calculus, Aynur Er

Masters Theses & Specialist Projects

The main purpose of this thesis is to define the stability of a system of linear difference equations of the form,

∇y(t) = Ay(t),

and to analyze the stability theory for such a system using the eigenvalues of the corresponding matrix A in nabla discrete calculus and nabla fractional discrete calculus. Discrete exponential functions and the Putzer algorithms are studied to examine the stability theorem.

This thesis consists of five chapters and is organized as follows. In the first chapter, the Gamma function and its properties are studied. Additionally, basic definitions, properties and some main theorem of discrete calculus are …

Classification Of Book Representations Of K6, Dana Rowland

Mathematics Faculty Publications

A book representation of a graph is a particular way of embedding a graph in three dimensional space so that the vertices lie on a circle and the edges are chords on disjoint topological disks. We describe a set of operations on book representations that preserves ambient isotopy, and apply these operations to K6, the complete graph with six vertices. We prove there are exactly 59 distinct book representations for K6, and we identify the number and type of knotted and linked cycles in each representation. We show that book representations of K6 contain between one and seven links, and …

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 …

Pattern Avoidance, Emma Christensen

All College Thesis Program, 2016-2019

A set partition avoids a pattern if no subdivision of that partition standardizes to the pattern. There exists a bijection between set partitions and restricted growth functions (RGFs) on which Wachs and White defined four statistics of interest to this work. We first characterize the restricted growth functions of several avoidance classes based on partitions of size four, enumerate these avoidance classes, and consider the distribution of the Wachs and White statistics across these avoidance classes. We also investigate the equidistribution of statistics between avoidance classes based on multiple patterns.

Investigating Difference Equations, Dave Ruch

Discrete Mathematics

No abstract provided.

Combinatorial Polynomial Hirsch Conjecture, Sam Miller

HMC Senior Theses

The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …

Sudoku Variants On The Torus, Kira A. Wyld

HMC Senior Theses

This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.

Random Tropical Curves, Magda L. Hlavacek

HMC Senior Theses

In the setting of tropical mathematics, geometric objects are rich with inherent combinatorial structure. For example, each polynomial $p(x,y)$ in the tropical setting corresponds to a tropical curve; these tropical curves correspond to unbounded graphs embedded in $\R^2$. Each of these graphs is dual to a particular subdivision of its Newton polytope; we classify tropical curves by combinatorial type based on these corresponding subdivisions. In this thesis, we aim to gain an understanding of the likeliness of the combinatorial type of a randomly chosen tropical curve by using methods from polytope geometry. We focus on tropical curves corresponding to quadratics, …

---

Go to article

Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri

HMC Senior Theses

Supersymmetry is a theoretical model of particle physics that posits a symmetry between bosons and fermions. Supersymmetry proposes the existence of particles that we have not yet observed and through them, offers a more unified view of the universe. In the same way Feynman Diagrams represent Feynman Integrals describing subatomic particle behaviour, supersymmetry algebras can be represented by graphs called adinkras. In addition to being motivated by physics, these graphs are highly structured and mathematically interesting. No one has looked at the Jacobians of these graphs before, so we attempt to characterize them in this thesis. We compute Jacobians through …

On The Graceful Cartesian Product Of Alpha-Trees, Christian Barrientos, Sarah Minion

Theory & Applications of Graphs

A graceful labeling of a graph G of size n is an injective assignment of integers from the set {0,1,…,n} to the vertices of G such that when each edge has assigned a weight, given by the absolute value of the difference of the labels of its end vertices, all the weights are distinct. A graceful labeling is called an α-labeling when the graph G is bipartite, with stable sets A and B, and the labels assigned to the vertices in A are smaller than the labels assigned to the vertices in B. In this …

On Independence, Matching, And Homomorphism Complexes, Wesley K. Hough

Theses and Dissertations--Mathematics

First introduced by Forman in 1998, discrete Morse theory has become a standard tool in topological combinatorics. The main idea of discrete Morse theory is to pair cells in a cellular complex in a manner that permits cancellation via elementary collapses, reducing the complex under consideration to a homotopy equivalent complex with fewer cells. In chapter 1, we introduce the relevant background for discrete Morse theory.

In chapter 2, we define a discrete Morse matching for a family of independence complexes that generalize the matching complexes of suitable "small" grid graphs. Using this matching, we determine the dimensions of the …

Gallai-Ramsey Numbers For C7 With Multiple Colors, Dylan Bruce

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. One view of this problem is in edge-colorings of complete graphs. For any graphs G, H₁, ..., H_k, we write G → (H₁, ..., H_k), or G → (H)_k when H₁ = ··· = H_k = H, if every k-edge-coloring of G contains a monochromatic H_i in color i for some i ∈ …

Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman

Theses and Dissertations--Education Sciences

Historically, students in an introductory finite mathematics course at a major university in the mid-south have struggled the most with the counting and probability unit, leading instructors to question if there was a better way to help students master the material. The purpose of this study was to begin to understand connections that undergraduate finite mathematics students are making between counting and probability. By examining student performance in counting and probability, this study provides insights that inform future instruction in courses that include counting and probability. Consequently, this study lays the groundwork for future inquiries in the field of undergraduate …

Note On 6-Regular Graphs On The Klein Bottle, Michiko Kasai, Naoki Matsumoto, Atsuhiro Nakamoto, Takayuki Nozawa, Hiroki Seno, Yosuke Takiguchi

Theory & Applications of Graphs

Altshuler classified six regular graphs on the torus, but Thomassen and Negami gave different classifications for six regular graphs on the Klein bottle. In this note, we unify those two classifications, pointing out their difference and similarity.

Edge-Transitive Bipartite Direct Products, Cameron M. Crenshaw

Theses and Dissertations

In their recent paper ``Edge-transitive products," Hammack, Imrich, and Klavzar showed that the direct product of connected, non-bipartite graphs is edge-transitive if and only if both factors are edge-transitive, and at least one is arc-transitive. However, little is known when the product is bipartite. This thesis extends this result (in part) for the case of bipartite graphs using a new technique called "stacking." For R-thin, connected, bipartite graphs A and B, we show that A x B is arc-transitive if and only if A and B are both arc-transitive. Further, we show A x B is edge-transitive only …

Neutrosophic Operational Research - Vol. 2, Florentin Smarandache, Mohamed Abdel Basset, Victor Chang

Branch Mathematics and Statistics Faculty and Staff Publications

Foreword John R. Edwards This book is an excellent exposition of the use of Data Envelopment Analysis (DEA) to generate data analytic insights to make evidence-based decisions, to improve productivity, and to manage cost-risk and benefitopportunity in public and private sectors. The design and the content of the book make it an up-to-date and timely reference for professionals, academics, students, and employees, in particular those involved in strategic and operational decisionmaking processes to evaluate and prioritize alternatives to boost productivity growth, to optimize the efficiency of resource utilization, and to maximize the effectiveness of outputs and impacts to stakeholders. It …

Complex Valued Graphs For Soft Computing, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce in a systematic way the notion of complex valued graphs, strong complex valued graphs and complex neutrosophic valued graphs. Several interesting properties are defined, described and developed. Most of the conjectures which are open in case of usual graphs continue to be open problems in case of both complex valued graphs and strong complex valued graphs. We also give some applications of them in soft computing and social networks. At this juncture it is pertinent to keep on record that Dr. Tohru Nitta was the pioneer to use complex valued graphs …

Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, motivated by the notion of generalized single valued neutrosophic graphs of first type, we defined a new neutrosophic graphs named generalized interval valued neutrosophic graphs of first type (GIVNG1) and presented a matrix representation for it and studied few properties of this new concept. The concept of GIVNG1 is an extension of generalized fuzzy graphs (GFG1) and generalized single valued neutrosophic of first type (GSVNG1).

The Use Of The Pivot Pairwise Relative Criteria Importance Assessment Method For Determining The Weights Of Criteria, Florentin Smarandache, Dragisa Stanujkic, Edmundas Kazimieras Zavadskas, Darjan Karabasevic, Zenonas Turskis

Branch Mathematics and Statistics Faculty and Staff Publications

The weights of evaluation criteria could have a significant impact on the results obtained by applying multiple criteria decision-making methods. Therefore, the two extensions of the SWARA method that can be used in cases when it is not easy, or even is impossible to reach a consensus on the expected importance of the evaluation criteria are proposed in this paper. The primary objective of the proposed extensions is to provide an understandable and easy-to-use approach to the collecting of respondents’ real attitudes towards the significance of evaluation criteria and to also provide an approach to the checking of the reliability …

On A Class Of Quaternionic Positive Definite Functions And Their Derivatives, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we start the study of stochastic processes over the skew field of quaternions. We discuss the relation between positive definite functions and the covariance of centered Gaussian processes and the construction of stochastic processes and their derivatives. The use of perfect spaces and strong algebras and the notion of Fock space are crucial in this framework.

Characterizations Of Families Of Rectangular, Finite Impulse Response, Para-Unitary Systems, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

We here study Finite Impulse Response (FIR) rectangular, not necessarily causal, systems which are (para)-unitary on the unit circle (=the class U). First, we offer three characterizations of these systems. Then, introduce a description of all FIRs in U, as copies of a real polytope, parametrized by the dimensions and the McMillan degree of the FIRs.

Finally, we present six simple ways (along with their combinations) to construct, from any FIR, a large family of FIRs, of various dimensions and McMillan degrees, so that whenever the original system is in U, so is the whole family.

A key role is …

The Partition Lattice In Many Guises, Dustin G. Hedmark

Theses and Dissertations--Mathematics

This dissertation is divided into four chapters. In Chapter 2 the equivariant homology groups of upper order ideals in the partition lattice are computed. The homology groups of these filters are written in terms of border strip Specht modules as well as in terms of links in an associated complex in the lattice of compositions. The classification is used to reproduce topological calculations of many well-studied subcomplexes of the partition lattice, including the d-divisible partition lattice and the Frobenius complex. In Chapter 3 the box polynomial B_{m,n}(x) is defined in terms of all integer partitions that fit in an m …

Colorings Of Hamming-Distance Graphs, Isaiah H. Harney

Theses and Dissertations--Mathematics

Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into …

Some Take-Away Games On Discrete Structures, Kristen M. Barnard

Theses and Dissertations--Mathematics

The game of Subset Take-Away is an impartial combinatorial game posed by David Gale in 1974. The game can be played on various discrete structures, including but not limited to graphs, hypergraphs, polygonal complexes, and partially ordered sets. While a universal winning strategy has yet to be found, results have been found in certain cases. In 2003 R. Riehemann focused on Subset Take-Away on bipartite graphs and produced a complete game analysis by studying nim-values. In this work, we extend the notion of Take-Away on a bipartite graph to Take-Away on particular hypergraphs, namely oddly-uniform hypergraphs and evenly-uniform hypergraphs whose …

An Updated Survey On Rainbow Connections Of Graphs - A Dynamic Survey, Xueliang Li, Yuefang Sun

Theory & Applications of Graphs

The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in 2013. More and more researchers are working in this field, and many new papers have been published in journals. In this survey we attempt to bring together most of the new results and papers that deal with this topic. We begin with an introduction, and then try to organize the …

Adaptive Orthonormal Systems For Matrix-Valued Functions, Daniel Alpay, Fabrizio Colombo, Tao Qian, Irene Sabadini, Tao Qian

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we consider functions in the Hardy space Hp×q2 defined in the unit disc of matrix-valued. We show that it is possible, as in the scalar case, to decompose those functions as linear combinations of suitably modified matrix-valued Blaschke product, in an adaptive way. The procedure is based on a generalization to the matrix-valued case of the maximum selection principle which involves not only selections of suitable points in the unit disc but also suitable orthogonal projections. We show that the maximum selection principle gives rise to a convergent algorithm. Finally, we discuss the case of real-valued signals.