Pi Mu Epsilon - Mathematical Association of America

More documents

Recommendations

Info

Thursday MAA Session #7 August 2, 2012 3:20–3:35 CO - Mediated Sickle Cell Polymer Melting Crystal Bennett North Carolina Agricultural & Technical State University Sickle cell anemia is a disorder caused by a mutation in DNA that replaces the nucleic acid Glutamic with Valine. This replacement causes a change in the characteristics of hemoglobin that allows the monomers, the simplest units of chemically binding molecules, to stick together. These chains of monomers, called polymers, distort the shape and properties of the red blood cell. The malformed cells do not efficiently pass through capillaries or transport oxygen to the bodys tissues. In order to make these cells more effective, the polymers must be broken apart. The process of breaking polymers apart is called melting. In the referenced study, the melting was induced by immersing the polymers in a buffer solution containing carbon monoxide. The mathematical model of this process was produced in a separate study. The purpose of this paper is to analyze and reproduce the current mathematical model using various computational and numerical tools. 3:40–3:55 Analysis of Spatio-Temporal Mapping Lindsay Christie Clarkson University Spatio-temporal mapping (STM) is a two-dimensional diagram which allows a user to visualize a series of movements over a spatially moving field. STM can be utilized to analyze several biological applications, including but not limited to, gastrointestinal motility. We use image decomposition of the ST maps to fully understand the frequency of the intestinal contractions that occur within Danio rerio, also known as zebrafish. In addition, we can use STMs in order to create software that predicts valuable information such as the velocity and duration of each individual contraction. This can help accelerate future research pertaining to the origin of common digestive diseases and potential cures. 32
Thursday MAA Session #8 August 2, 2012 MAA Session #8 Room: Meeting Room L 2:00P.M. – 3:55P.M. 2:00–2:15 Graphs with Equal Domination Number and Identification Number Julie Elizabeth Lang and Lindzey Brooke Thacker Morehead State University The domination number of a graph is the minimum cardinality of a subset of vertices S such that all vertices are either in S or adjacent to a vertex in S. The identification number is the minimum cardinality such that the intersection of S with the closed neighborhood of each vertex is distinct. This presentation will discuss instances in which the domination number and the identification number are the same as well as a method of constructing such graphs. 2:20–2:35 Sum and Product Connectivity Indices of Single Cyclohexane Compounds Katrina Bandeli Montclair State University This research deals with Product (Randc) and Sum Connectivity Indices of graphs of Single Cyclohexane Compounds called SCC graphs. These graphs of special interest are built from a single hexagon base along with long branches or trees. We are particularly interested in an SCC graph where the connection between the hexagon and the tree part is by one edge. Formulas are developed for the indices of certain types of such graphs. We compare such SCC graphs with those with attachments of a star or a path. We show that among these types of graphs the Randc index of the hexagon attached to a path is almost the largest, and the Randc index of the hexagon attached to a star is almost the smallest. It is known that the product index is one of the most successful molecular descriptors for structural-property and structural-activity relationship studies. 2:40–2:55 Minimum Exponential Dominating Sets of Cycles Connecting at One or Two Vertices Amanda Bright Westminster College The purpose of this research is to explore the behavior of minimum exponential dominating sets of two separate and equal cycles when they are connected at one or two vertices. It is well known that the size of a minimum exponential dominating set for a cycle of size n is ⌈n/4⌉ for n ≠ 4 and 2 for n = 4. When two cycles of size n are connected at one vertex, we are going to prove that the size of the resulting minimum exponential dominating set is 2⌈n/4⌉ − 1 for n ≠ 4 and 2 for n = 4. We are also going to discuss the conjecture that the size of the minimum exponential dominating set of two cycles of size n which are connected at two vertices distance d apart is given by 2⌈n/4⌉ − 1 when d < n mod 4 and 2⌈n/4⌉ − 2 when d ≥ n mod 4. These results can provide valuable information in the research of exponential domination and in graph theory. 33
Page 1 and 2: Pi Mu Epsilon Pi Mu Epsilon is a na
Page 3 and 4: Friday, August 3 Time: Event: Locat
Page 5 and 6: 1:00 - 1:50 PM Thursday August 2, 2
Page 7 and 8: MAA Student Speakers Name School MA
Page 9 and 10: MAA Student Speakers (Continued) Na
Page 11 and 12: Pi Mu Epsilon Speakers Name School
Page 13 and 14: Thursday MAA Session #1 August 2, 2
Page 27 and 28: Thursday Pi Mu Epsilon Session #1 A
Page 31: Thursday MAA Session #7 August 2, 2
Page 39 and 40: Thursday MAA Session #10 August 2,
Page 49 and 50: Friday MAA Session #15 August 3, 20
Page 55 and 56: Friday Pi Mu Epsilon Session #5 Aug
Page 67 and 68: MAA Lectures for Students 2012 Ivar

Pi Mu Epsilon - Mathematical Association of America

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?