Discrete Mathematics and Combinatorics Commons^™

Rippled Almost Periodic Behavior In An Epilepsy Model, David Chan, Candace Kent

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Identification Of Control Targets In Boolean Networks Via Computational Algebra, Alan Veliz-Cuba

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Building Model Prototypes From Time-Course Data, David Murrugarra, Alan Veliz-Cuba

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Discrete Hypergeometric Legendre Polynomials, Tom Cuchta

Mathematics Faculty Research

A discrete analog of the Legendre polynomials defined by discrete hypergeometric series is investigated. The resulting polynomials have qualitatively similar properties to classical Legendre polynomials. We derive their difference equations, recurrence relations, and generating function.

Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas

Open Educational Resources

The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is …

Completing Partial Transversals Of Cayley Tables Of Abelian Groups, Jaromy Kuhl, Donald Mcginn, Michael W. Schroeder

Mathematics Faculty Research

In 2003 Grüttmüller proved that if n ⩾ 3 is odd, then a partial transversal of the Cayley table of ℤₙ with length 2 is completable to a transversal. Additionally, he conjectured that a partial transversal of the Cayley table of ℤₙ with length k is completable to a transversal if and only if n is odd and either n ∈ {k, k + 1} or n ⩾ 3k - 1. Cavenagh, Hämäläinen, and Nelson (in 2009) showed the conjecture is true when k = 3 and n is prime. In this paper, we prove Grüttmüller's conjecture for k = …

Upper Bounds For Inverse Domination In Graphs, Elliot Krop, Jessica Mcdonald, Gregory J. Puleo

Theory & Applications of Graphs

In any graph G, the domination number \gamma(G) is at most the independence number \alpha(G). The Inverse Domination Conjecture says that, in any isolate-free G, there exists pair of vertex-disjoint dominating sets D, D' with |D|=\gamma(G) and |D'| \leq \alpha(G). Here we prove that this statement is true if the upper bound \alpha(G) is replaced by \frac{3}{2}\alpha(G) – 1 (and G is not a clique). We also prove that the conjecture holds whenever \gamma(G)\leq 5 or |V(G)|\leq 16.

Skolem Number Of Cycles And Grid Graphs, Braxton Carrigan, John Asplund

Theory & Applications of Graphs

A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label. Given that more than two vertices can be mutually distance d apart, we define a new generalization of a Skolem sequences on graphs that we call proper Skolem labellings. This brings rise to the question; ``what is the smallest set of consecutive positive integers we can use to proper Skolem label a graph?'' This will be known …

Domino Circles, Lauren L. Rose, A. Gwinn Royal, Amanda Serenevy, Anna Varvak

Journal of Math Circles

Creating a circle with domino pieces has a connection with complete graphs in Graph Theory. We present a hands-on activity for all ages, using dominoes to explore problem solving, pattern recognition, parity, graph theory, and combinatorics. The activities are suitable for elementary school students, the graph theory interpretations are suitable for middle and high school students, and the underlying mathematical structures will be of interest to college students and beyond.

An Upper Bound On The Spectral P-Norms Of Tensors And Matrix Permanent, Killian J. Hitsman, Vehbi E. Paksoy

Mako: NSU Undergraduate Student Journal

No abstract provided.

On \Delta^(K)-Colouring Of Powers Of Paths And Cycles, Merlin Thomas Ellumkalayil Ms, Sudev Naduvath

Theory & Applications of Graphs

In an improper vertex colouring of a graph, adjacent vertices are permitted to receive same colours. An edge of an improperly coloured graph is said to be a bad edge if its end vertices have the same colour. A near-proper colouring of a graph is a colouring which minimises the number of bad edges by restricting the number of colour classes that can have adjacency among their own elements. The δ (k) - colouring is a near-proper colouring of G consisting of k given colours, where 1 ≤ k ≤ χ(G) – 1, which minimises the number of bad …

On Graphs With Proper Connection Number 2, Jill Faudree, Leah Berman, Glenn Chappell, Chris Hartman, John Gimbel, Gordon Williams

Theory & Applications of Graphs

An edge-colored graph is properly connected if for every pair of vertices u and v there exists a properly colored uv-path (i.e. a uv-path in which no two consecutive edges have the same color). The proper connection number of a connected graph G, denoted pc(G), is the smallest number of colors needed to color the edges of G such that the resulting colored graph is properly connected. An edge-colored graph is flexibly connected if for every pair of vertices u and v there exist two properly colored paths between them, say P and Q, such …

Bootstrap Percolation On Random Geometric Graphs, Alyssa Whittemore

Department of Mathematics: Dissertations, Theses, and Student Research

Bootstrap Percolation is a discrete-time process that models the spread of information or disease across the vertex set of a graph. We consider the following version of this process:

Initially, each vertex of the graph is set active with probability p or inactive otherwise. Then, at each time step, every inactive vertex with at least k active neighbors becomes active. Active vertices will always remain active. The process ends when it reaches a stationary state. If all the vertices eventually become active, then we say we achieve percolation.

This process has been widely studied on many families of graphs, deterministic …

A Combinatorial Formula For Kazhdan–Lusztig Polynomials Of Sparse Paving Matroids, George Nasr

Department of Mathematics: Dissertations, Theses, and Student Research

We present a combinatorial formula using skew Young tableaux for the coefficients of Kazhdan–Lusztig polynomials for sparse paving matroids. These matroids are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. We also show the positivity of these coefficients using our formula. In special cases, such as for uniform matroids, our formula has a nice combinatorial interpretation.

Advisors: Kyungyong Lee and Jamie Radcliffe

Partial Representations For Ternary Matroids, Ebony Perez

Electronic Theses, Projects, and Dissertations

In combinatorics, a matroid is a discrete object that generalizes various notions of dependence that arise throughout mathematics. All of the information about some matroids can be encoded (or represented) by a matrix whose entries come from a particular field, while other matroids cannot be represented in this way. However, for any matroid, there exists a matrix, called a partial representation of the matroid, that encodes some of the information about the matroid. In fact, a given matroid usually has many different partial representations, each providing different pieces of information about the matroid. In this thesis, we investigate when a …

Partially Oriented 6-Star Decomposition Of Some Complete Mixed Graphs, Kazeem A. Kosebinu

Electronic Theses and Dissertations

Let $M_v$ denotes a complete mixed graph on $v$ vertices, and let $S_6^i$ denotes the partial orientation of the 6-star with twice as many arcs as edges. In this work, we state and prove the necessary and sufficient conditions for the existence of $\lambda$-fold decomposition of a complete mixed graph into $S_6^i$ for $i\in\{1,2,3,4\}$. We used the difference method for our proof in some cases. We also give some general sufficient conditions for the existence of $S_6^i$-decomposition of the complete bipartite mixed graph for $i\in\{1,2,3,4\}$. Finally, this work introduces the decomposition of a complete mixed graph with a hole into …

The Color Number Of Cubic Graphs Having A Spanning Tree With A Bounded Number Of Leaves, Analen A. Malnegro, Gina A. Malacas, Kenta Ozeki

Theory & Applications of Graphs

The color number c(G) of a cubic graphG is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G

Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya

Department of Mathematics Faculty Scholarship and Creative Works

This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions.

As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …

On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa

Publications and Research

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector X∈Rn in a given lattice. We show that the protocol is optimal in the sense that it minimizes the sum rate when the components of X are mutually independent. We then investigate the error probability, i.e. the probability that the Babai point does not coincide with the nearest lattice point, motivated by the fact that for some cases, a distributed algorithm for finding the Babai point is sufficient for finding the nearest lattice point itself. Two different probability models for X …

Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern

Rose-Hulman Undergraduate Mathematics Journal

In 2015, I. Rivin introduced an effective method to bound the number of irreducible integral polynomials with fixed degree d and height at most N. In this paper, we give a brief summary of this result and discuss the precision of Rivin's arguments for special classes of polynomials. We also give elementary proofs of classic results on Galois groups of cubic trinomials.