Discrete Mathematics and Combinatorics Commons^™

The Game Of Life On The Hyperbolic Plane, Yuncong Gu

Mathematical Sciences Technical Reports (MSTR)

In this paper, we work on the Game of Life on the hyperbolic plane. We are interested in different tessellations on the hyperbolic plane and different Game of Life rules. First, we show the exponential growth of polygons on the pentagon tessellation. Moreover, we find that the Group of 3 can keep the boundary of a set not getting smaller. We generalize the existence of still lifes by computer simulations. Also, we will prove some propositions of still lifes and cycles. There exists a still life under rules B1, B2, and S3.

The Game Of Cops And Robbers On Planar Graphs, Jordon S. Daugherty

Graduate Theses/Dissertations

In graph theory, the game of cops and robbers is played on a finite, connected graph. The players take turns moving along edges as the cops try to capture the robber and the robber tries to evade capture forever. This game has received quite a bit of recent attention including several conjectures that have yet to be proven. In this paper, we restricted our attention to planar graphs in order to try to prove the conjecture that the dodecahedron graph is the smallest planar graph, in terms of vertices, that has cop number three. Along the way we discuss several …

Target Control Of Networked Systems, Isaac S. Klickstein

Mechanical Engineering ETDs

The control of complex networks is an emerging field yet it has already garnered interest from across the scientific disciplines, from robotics to sociology. It has quickly been noticed that many of the classical techniques from controls engineering, while applicable, are not as illuminating as they were for single systems of relatively small dimension. Instead, properties borrowed from graph theory provide equivalent but more practical conditions to guarantee controllability, reachability, observability, and other typical properties of interest to the controls engineer when dealing with large networked systems. This manuscript covers three topics investigated in detail by the author: (i) the …

Infinite Sets Of Solutions And Almost Solutions Of The Equation N⋅M=Reversal(N⋅M) Ii, Cem Ekinci

Mathematics Student Work

Motivated by their intrinsic interest and by applications to the study of numeric palindromes and other sequences of integers, we discover a method for producing infinite sets of solutions and almost solutions of the equation N⋅M=reversal(N⋅M), our results are valid in a general numeration base b>2.

An Improvement In The Two-Packing Bound Related To Vizing's Conjecture, Kimber Wolff

Theory & Applications of Graphs

Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs. In this note we improve the recent bound of Breŝar by applying a technique of Zerbib to show that for any graphs G and H, γ(G x H)≥ γ (G) 2/3(γ(H)-ρ(H)+1), where γ is the domination number, ρ is the 2-packing number, and x is the Cartesian product.

On A Vizing-Type Integer Domination Conjecture, Elliot Krop, Randy R. Davila

Theory & Applications of Graphs

Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a function f : V (G) → {0, 1, . . ., k} is called a {k}-dominating function if the sum of its function values over any closed neighborhood is at least k. The weight of a {k}-dominating function is the sum of its values over all …

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 …

Extremal Problems On Induced Graph Colorings, James Hallas

Dissertations

Graph coloring is one of the most popular areas of graph theory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. As far back as 1880, in an attempt to solve the famous Four Color Problem, there have been numerous examples of certain types of graph colorings that have generated other graph colorings of interest. These types of colorings only gained momentum a century later, however, when in the 1980s, edge colorings were studied that led to vertex colorings of various types, led by the introduction …

Recursive Formulas For Beans Functions Of Graphs, Kengo Enami, Seiya Negami

Theory & Applications of Graphs

In this paper, we regard each edge of a connected graph G as a line segment having a unit length, and focus on not only the "vertices" but also any "point" lying along such a line segment. So we can define the distance between two points on G as the length of a shortest curve joining them along G. The beans function B_G(x) of a connected graph G is defined as the maximum number of points on G such that any pair of points have distance at least x>0. We shall show a recursive formula for …

On Selected Subclasses Of Matroids, Tara Elizabeth Fife

LSU Doctoral Dissertations

Matroids were introduced by Whitney to provide an abstract notion of independence.

In this work, after giving a brief survey of matroid theory, we describe structural results for various classes of matroids. A connected matroid $M$ is unbreakable if, for each of its flats $F$, the matroid $M/F$ is connected%or, equivalently, if $M^*$ has no two skew circuits. . Pfeil showed that a simple graphic matroid $M(G)$ is unbreakable exactly when $G$ is either a cycle or a complete graph. We extend this result to describe which graphs are the underlying graphs of unbreakable frame matroids. A laminar family is …

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 …

Triangles In Ks-Saturated Graphs With Minimum Degree T, Craig Timmons, Benjamin Cole, Albert Curry, David Davini

Theory & Applications of Graphs

For n ≥ 15, we prove that the minimum number of triangles in an n-vertex K₄-saturated graph with minimum degree 4 is exactly 2n-4, and that there is a unique extremal graph. This is a triangle version of a result of Alon, Erdos, Holzman, and Krivelevich from 1996. Additionally, we show that for any s > r ≥ 3 and t ≥ 2 (s-2)+1, there is a K_s-saturated n-vertex graph with minimum degree t that has \binom{ s-2}{r-1}2^{r-1} n + c_{s,r,t} copies of K_r. This shows that …

Math 220p Foundations Of Mathematics, Nicholas Vlamis

Open Educational Resources

No abstract provided.

From Dyck Paths To Standard Young Tableaux, Juan B. Gil, Peter R. W. Mcnamara, Jordan O. Tirrell, Michael D. Weiner

Faculty Journal Articles

We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we introduce a special class of labeled Dyck paths of semilength n that is shown to be in bijection with the set of all SYT with n boxes. In addition, we present bijections from certain classes of Motzkin paths to SYT. As a natural framework for some of our bijections, we introduce a class of set partitions which in some …

Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle

Rose-Hulman Undergraduate Mathematics Journal

This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982. Consecutive prime labeling is defined here for the first time. Consecutive prime labeling requires that the labels of vertices in a graph be relatively prime to the labels of all adjacent vertices as well as all incident edges. We show that all paths, cycles, stars, and complete graphs have a consecutive prime labeling and conjecture that all simple connected graphs have a consecutive prime labeling.

This paper also expands on work …

Combinatorial Identities On Multinomial Coefficients And Graph Theory, Seungho Lee

Rose-Hulman Undergraduate Mathematics Journal

We study combinatorial identities on multinomial coefficients. In particular, we present several new ways to count the connected labeled graphs using multinomial coefficients.

Graham's Pebbling Conjecture Holds For The Product Of A Graph And A Sufficiently Large Complete Graph, Nopparat Pleanmani

Theory & Applications of Graphs

For connected graphs G and H, Graham conjectured that π(G □ H) ≤ π(G) π(H) where π(G), π (H), and π(G □ H) are the pebbling numbers of G, H, and the Cartesian product G □ H, respectively. In this paper, we show that the inequality holds when H is a complete graph of sufficiently large order in terms of graph parameters of G.

A Discrete Analogue For The Poincaré-Hopf Theorem, Savana Ammons

HMC Senior Theses

In this thesis, we develop a discrete analogue to the Poincaré–Hopf Theorem. We define the notion of a vector field on a graph, and establish an index theory for such a field. Specifically, we create well-defined indices for the nodes and “cells" formed by a planar graph. Then, we show that the sum of these indices remains constant for certain types of planar graphs, regardless of the discrete vector fields they have.

On The Mysteries Of Interpolation Jack Polynomials, Havi Ellers

HMC Senior Theses

Interpolation Jack polynomials are certain symmetric polynomials in N variables with coefficients that are rational functions in another parameter k, indexed by partitions of length at most N. Introduced first in 1996 by F. Knop and S. Sahi, and later studied extensively by Sahi, Knop-Sahi, and Okounkov-Olshanski, they have interesting connections to the representation theory of Lie algebras. Given an interpolation Jack polynomial we would like to differentiate it with respect to the variable k and write the result as a linear combination of other interpolation Jack polynomials where the coefficients are again rational functions in k. In this …

An Exploration Of Combinatorial Interpretations For Fibonomial Coefficients, Richard Shapley

HMC Senior Theses

We can define Fibonomial coefficients as an analogue to binomial coefficients as F(n,k) = F_nF_n-1 … F­_n-k+1 / F­_kF_k-­1…F₁, where F_n represents the nth Fibonacci number. Like binomial coefficients, there are many identities for Fibonomial coefficients that have been proven algebraically. However, most of these identities have eluded combinatorial proofs.

Sagan and Savage (2010) first presented a combinatorial interpretation for these Fibonomial coefficients. More recently, Bennett et al. (2018) provided yet another interpretation, that is perhaps more tractable. However, there still has been little progress towards using these interpretations …

A Cool Brisk Walk Through Discrete Mathematics, Stephen Davies

Computer Science Articles

A Cool Brisk Walk Through Discrete Mathematics - and its companion site "allthemath" - are completely-and-forever-free-and-open-source educational materials dedicated to the mathematics that budding computer science practitioners actually need to know. They feature the fun and addictive teaching of award-winning lecturer Dr. Stephen Davies of the University of Mary Washington in Fredericksburg, Virginia!

Discrete Morse Theory By Vector Fields: A Survey And New Directions, Matthew Nemitz

All Graduate Theses, Dissertations, and Other Capstone Projects

We synthesize some of the main tools in discrete Morse theory from various sources. We do this in regards to abstract simplicial complexes with an emphasis on vector fields and use this as a building block to achieve our main result which is to investigate the relationship between simplicial maps and homotopy. We use the discrete vector field as a catalyst to build a chain homotopy between chain maps induced by simplicial maps.

An Exploration Of The Use Of The Fibonacci Sequence In Unrelated Mathematics Disciplines, Molly E. Boodey

Honors Theses and Capstones

No abstract provided.

Discrete Geometry And Covering Problems, Alexander Hsu

CMC Senior Theses

This thesis explores several problems in discrete geometry, focusing on covering problems. We first go over some well known results, explaining Keith Ball's solution to the symmetric Tarski plank problem, as well as results of Alon and F\"uredi on covering all but vertices of a cube with hyperplanes. The former extensively utilizes techniques from matrix analysis, and the latter applies polynomial method. We state and explore the related problem, asking for the number of parallel hyperplanes required to cover a given discrete set of points in $\mathbb{Z}^{d}$ whose entries are bounded, and prove that there exist sets which are ``difficult'' …

The Subconstituent Algebra Of A Hypercube, Jared B. Billet

UNF Graduate Theses and Dissertations

We study the hypercube and the associated subconstituent algebra. Let Q_D denote the hypercube with dimension D and let X denote the vertex set of Q_D. Fix a vertex x in X. We denote by A the adjacency matrix of Q_D and by A* = A*(x) the diagonal matrix with yy-entry equal to D − 2i, where i is the distance between x and y. The subconstitutent algebra T = T(x) of Q_D with respect to x is generated by A and A* . We show that A 2A* − 2AA*A + A*A 2 = 4A* A*2A − 2A*AA* + …

Algebraic And Geometric Properties Of Hierarchical Models, Aida Maraj

Theses and Dissertations--Mathematics

In this dissertation filtrations of ideals arising from hierarchical models in statistics related by a group action are are studied. These filtrations lead to ideals in polynomial rings in infinitely many variables, which require innovative tools. Regular languages and finite automata are used to prove and explicitly compute the rationality of some multivariate power series that record important quantitative information about the ideals. Some work regarding Markov bases for non-reducible models is shown, together with advances in the polyhedral geometry of binary hierarchical models.

Graph-Theoretic Simplicial Complexes, Hajos-Type Constructions, And K-Matchings, Julianne Vega

Theses and Dissertations--Mathematics

A graph property is monotone if it is closed under the removal of edges and vertices. Given a graph G and a monotone graph property P, one can associate to the pair (G,P) a simplicial complex, which serves as a way to encode graph properties within faces of a topological space. We study these graph-theoretic simplicial complexes using combinatorial and topological approaches as a way to inform our understanding of the graphs and their properties.

In this dissertation, we study two families of simplicial complexes: (1) neighborhood complexes and (2) k-matching complexes. A neighborhood complex is a simplicial …

Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok

Theses and Dissertations--Mathematics

This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.

We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …

Uniform Three-Class Regular Partial Steiner Triple Systems With Uniform Degrees, Prangya Rani Parida

Dissertations, Master's Theses and Master's Reports

A Partial Steiner Triple system (X, T) is a finite set of points C and a collection T of 3-element subsets of C that every pair of points intersect in at most 1 triple. A 3-class regular PSTS (3-PSTS) is a PSTS where the points can be partitioned into 3 classes (each class having size m, n and p respectively) such that no triple belongs to any class and any two points from the same class occur in the same number of triples (a, b and c respectively). The 3-PSTS is said to be uniform if m = n = …

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 …