Mathematics Commons^™

Properly Colored Notions Of Connectivity - A Dynamic Survey, Xueliang Li, Colton Magnant

Theory & Applications of Graphs

A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths.

Dynamic Approach To K-Forcing, Yair Caro, Ryan Pepper

Theory & Applications of Graphs

The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepper [2], while also answering an open problem posed by Meyer [9].

Second Hamiltonian Cycles In Claw-Free Graphs, Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi

Theory & Applications of Graphs

Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs.

Bounds For The Zero Forcing Number Of Graphs With Large Girth, Randy Davila, Franklin Kenter

Theory & Applications of Graphs

The zero-forcing number, Ζ(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Ζ(G) where δ is the minimum degree. An improvement of this bound is provided in the case that G has girth of at least 5. In particular, it is shown that 2δ − 2 ≤ Ζ(G) for graphs with girth of at least 5; this can be further improved when G has a small cut set. Lastly, a conjecture is made regarding a lower bound for Ζ(G) as a …

Connection And Separation In Hypergraphs, Mohammad A. Bahmanian, Mateja Sajna

Theory & Applications of Graphs

In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. We prove a number of new results involving these concepts. In particular, we describe the exact relationship between the block decomposition of a hypergraph and the block decomposition of its incidence graph.

Scheduling N Burgers For A K-Burger Grill: Chromatic Numbers With Restrictions, Peter Johnson, Xiaoya Zha

Theory & Applications of Graphs

The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic number of the graph is the smallest number of hours during which the committees/vertices of the graph may all have properly scheduled meetings of one continuous hour each. Slivnik [3] showed that the fractional chromatic number can be similarly characterized. In that characterization, the meetings are allowed to be broken into a finite number of disjoint intervals. Here we consider chromatic …

Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak

Theory & Applications of Graphs

The (vertex) path-table of a tree Τ contains quantitative information about the paths in Τ. The entry (i,j) of this table gives the number of paths of length j passing through vertex ^vi. The path-table is a slight variation of the notion of path layer matrix. In this survey we review some work done on the vertex path-table of a tree and also introduce the edge path-table. We show that in general, any type of path-table of a tree Τ does not determine Τ uniquely. We shall show that in trees, the number of paths passing through …

Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman

College of Graduate Studies: Theses & Dissertations

In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type questions on distances between leaves are studied as well as some other labeling questions …

Primary Spaces, Mackey's Obstruction, And The Generalized Barycentric Decomposition, Patrick Iglesias-Zemmour, Francois Ziegler

Mathematical Sciences: Faculty Publications

We call a hamiltonian N-space primary if its moment map is onto a single coadjoint orbit. The question has long been open whether such spaces always split as (homogeneous) x (trivial), as an analogy with representation theory might suggest. For instance, Souriau's barycentric decomposition theorem asserts just this when N is a Heisenberg group. For general N, we give explicit examples which do not split, and show instead that primary spaces are always flat bundles over the coadjoint orbit. This provides the missing piece for a full "Mackey theory" of hamiltonian G-spaces, where G is an overgroup in which N …

Automorphisms Of Graph Curves On K3 Surfaces, Joshua C. Ferrerra

College of Graduate Studies: Theses & Dissertations

We examine the automorphism group of configurations of rational curves on $K3$ surfaces. We use the properties of finite automorphisms of $\PP^1$ to examine what restrictions a given elliptic fibration imposes on the possible finite order non-symplectic automorphisms of the $K3$ surface. We also examine the fixed loci of these automorphisms, and construct an explicit fibration to demonstrate the process.

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 …

Properly Colored Notions Of Connectivity - A Dynamic Survey, Xueliang Li, Colton Magnant

Mathematical Sciences: Faculty Publications

Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs.

Second Hamiltonian Cycles In Claw-Free Graphs, Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi

Mathematical Sciences: Faculty Publications

Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs.

Graphs Obtained From Collections Of Blocks, Colton Magnant, Pouria Salehi Nowbandegani, Hua Wang

Mathematical Sciences: Faculty Publications

Given a collection of d-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially. It is known that if d ≥ 3, such block graphs can have arbitrarily large chromatic number. We prove that the chromatic number can be bounded with only a mild restriction on the sizes of the blocks. We also show that block graphs of block configurations arising from partitions of d-dimensional hypercubes into sub-hypercubes are at least d-connected. Bounds on …

Kumaraswamy Lindley-Poisson Distribution: Theory And Applications, Mavis Pararai, Broderick O. Oluyede, Gayan Warahena-Liyanage

Mathematical Sciences: Faculty Publications

The Kumaraswamy Lindley-Poisson (KLP) distribution which is an extension of the Lindley-Poisson Distribution [21] is introduced and its properties are explored. This new distribution represents a more flexible model for the lifetime data. Some statistical properties of the proposed distribution including the shapes of the density and hazard rate functions are explored. Moments, entropy measures and the distribution of the order statistics are given. The maximum likelihood estimation technique is used to estimate the model parameters and a simulation study is conducted to investigate the performance of the maximum likelihood estimates. Finally some applications of the model with real data …

Log-Concavity And Symplectic Rows, Yi Lin, Álvaro Pelayo

Mathematical Sciences: Faculty Publications

The Duistermaat-Heckman measure of a Hamiltonian torus action on a symplectic manifold (M,ω) is the push forward of the Liouville measure on M by the momentum map of the action. In this paper we prove the logarithmic concavity of the Duistermaat-Heckman measure of a complexity two Hamiltonian torus action, for which there exists an effective commuting symplectic action of a 2-torus with symplectic orbits. Using this, we show that given a complexity two symplectic torus action satisfying the additional 2-torus action condition, if the fixed point set is non-empty, then it has to be Hamiltonian. This implies a classical result …

The Log-Generalized Lindley-Weibull Distribution With Applications, Broderick O. Oluyede, Fedelis Mutiso, Shujiao Huang

Mathematical Sciences: Faculty Publications

A new distribution called the log generalized Lindley-Weibull (LGLW) distribution for modeling lifetime data is proposed. This model further generalizes the Lindley distribution and allows for hazard rate functions that are monotonically decreasing, monotonically increasing and bathtub shaped. A comprehensive investigation and account of the mathematical and statistical properties including moments, moment generating function, simulation issues and entropy are presented. Estimates of model parameters via the method of maximum likelihood are given. Real data examples are presented to illustrate the usefulness and applicability of this new distribution.

A Generalized Class Of Kumaraswamy Lindley Distribution With Applications To Lifetime Data, Broderick O. Oluyede, Tiantian Yang, Bernard Omolo

Mathematical Sciences: Faculty Publications

In this paper, we propose a new class of generalized distributions called the Exponentiated Kumaraswamy Lindley (EKL) distribution, as well as related sub-distributions. This class of distributions contains the Kumaraswamy Lindley (KL), generalized Lindley (GL), and Lindley (L) distributions as special cases. A series expansion of the density is obtained. Statistical properties of this class of distributions, including the hazard and reverse hazard functions, monotonicity property, shapes, moments, reliability, quantile function, mean deviations, Bonferroni and Lorenz curves, entropy and Fisher information are derived among others. The method of maximum likelihood is adopted for estimating the model parameters. Two applications to …

A New Class Of Generalized Power Lindley Distribution With Applications To Lifetime Data, Marvis Pararai, Gayan Warahena-Liyanage, Broderick O. Oluyede

Mathematical Sciences: Faculty Publications

A new class of distribution called the beta-exponentiated power Lindley (BEPL) distribution is proposed. This class of distributions includes the Lindley (L), exponentiated Lindley (EL), power Lindley (PL), exponentiated power Lindley (EPL), beta-exponentiated Lindley (BEL), beta-Lindley (BL), and beta-power Lindley distributions (BPL) as special cases. Expansion of the density of BEPL distribution is obtained. Some mathematical properties of the new distribution including hazard function, reverse hazard function, moments, mean deviations, Lorenz and Bonferroni curves are presented. Entropy measures and the distribution of the order statistics are given. The maximum likelihood estimation technique is used to estimate the model parameters. Finally, …

New Families Of Weighted Sum Formulas For Multiple Zeta Values, Yuan Zhao, Jianqiang Zhao

Mathematical Sciences: Faculty Publications

In this paper we use the generating functions and the double shuffle relations satisfied by the multiple zeta values to derive some new families of identities.

A Family Of Multiple Harmonic Sum And Multiple Zeta Star Value Identities, Erin Linebarger, Jianqiang Zhao

Mathematical Sciences: Faculty Publications

In this paper we present a new family of identities for multiple harmonic sums which generalize a recent result of Hessami Pilehrood et al [Trans. Amer. Math. Soc. (to appear)]. We then apply it to obtain a family of identities relating multiple zeta star values to alternating Euler sums. In such a typical identity the entries of the multiple zeta star values consist of blocks of arbitrarily long 2-strings separated by positive integers greater than two while the largest depth of the alternating Euler sums depends only on the number of 2-string blocks but not on their lengths.

Introductory Texts

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

• GAMTE 2015 Officers
• GAMTE 2015 Conference Committee
• GAMTE 2015 Proceeding Committee
• Purposes and Goals of GAMTE
• Letter from the President
• Table of Contents

Engaging In Lesson Study At Georgia College, Angel R. Abney, Brandon Samples, Doris Santarone

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

A lesson study cycle is a professional development process that integrates research and reflection through collaboration. The cycle allows a group to refine a lesson based on these collaboration efforts such as interaction with students and the post-lesson discussion. Secondary pre-service teachers in a mathematics methods course engaged in a lesson study cycle through collaboration between in-service teachers, Georgia College professors, and students in a local high school classroom. We systematically investigated this process to determine that through preparing, enacting and reflecting on their practice, Pre-service Teachers (PST) developed insight, reasoning, and understanding of the mathematics that they taught.

Using Ti-Nspire To Engage Preservice Mathematics Teachers In An Exploratory Geometry Module, Alesia D. Mickle, Pier A. Junor Clarke

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

In the mathematics classroom, most preservice mathematics teachers possess basic skills to use technology as an instructional strategy in communicating content standards. However, today’s demands for preservice teachers to engage in a variety of “best teaching practices” in their preservice teaching and edTPA requirements can oftentimes place the acquisition of technical skills and integration of new technology in content curriculum far from the forefront of their minds. Ertmer, Conklin, Lewandowski, Osika, Selo, and Wignall (2003) acknowledged preservice teachers’ desires to gain the adequate technical skills necessary to use technology in teachers’ daily tasks of facilitating and managing their classrooms. They …

Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen

College of Graduate Studies: Theses & Dissertations

In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close enough to central path. Thus, the centering steps are eliminated. This improvement is based on the Lemma(Roos, 2015). Thanks to this lemma, proximity …

Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.

College of Graduate Studies: Theses & Dissertations

The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.

Quantum States Localized On Lagrangian Submanifolds, François Ziegler

Mathematical Sciences: Faculty Presentations (1991-2022)

Let X be a symplectic manifold and Aut(L) the automorphism group of a Kostant-Souriau line bundle on X. *Quantum states for X*, as defined by J.-M. Souriau in the 1990s, are certain positive-definite functions on Aut(L) or, less ambitiously, on any “large enough” subgroup G of Aut(L). This definition has two major drawbacks: when G = Aut(L) there are no known examples; and when G is a Lie subgroup the notion is far from selective enough. In this talk I’ll introduce the concept of a quantum state *localized at Y *, where Y is a coadjoint orbit of a subgroup …

Functions On Adjacent Vertex Degrees Of Trees With Given Degree Sequence, Hua Wang

Mathematical Sciences: Faculty Publications

In this note we consider a discrete symmetric function f(x, y) where f(x; a) + f(y, b) ≥ f(y, a) + f(x, b) for any x ≥ y and a ≥ b, associated with the degrees of adjacent vertices in a tree. The extremal trees with respect to the corresponding graph invariant, defined as Σ _uv∈E(T) f(deg(u), deg(v)), are characterized by the “greedy tree” and “alternating greedy tree”. This is achieved through simple generalizations of previously used ideas on similar questions. As special cases, the already known extremal structures of the Randić index follow as corollaries. The extremal structures for …

Symplectic Mackey Theory, Francois Ziegler

Mathematical Sciences: Faculty Publications

Many years ago Kazhdan, Kostant and Sternberg defined the notion of inducing a hamiltonian action from a Lie subgroup. In this paper, we develop the attendant imprimitivity theorem and Mackey analysis in the full generality needed to deal with arbitrary closed normal subgroups.

A Case Study Of How Ninth Grade Mathematics Students Construct Knowledge During A Productive Failure Model, Amy F. Westbrook Dr.

Georgia Educational Research Association Conference

The purpose of this qualitative study was to explain how ninth grade mathematics students at a rural high school in Georgia constructed knowledge through student talk when problem solving using Kapur’s (2012) productive failure design. An embedded case study design was used to understand how a group of students constructed knowledge through their use of talk, persistence during the task, and use of prior knowledge while working on a productive failure modeled task. Triangulation resulted from the collected data from multiple sources, which included videotaping, interviewing, and analyzing student artifacts. Utilization of the constructivist perspectives of Vygotsky (1934/1962), Piaget (1971), …