Solving Equations Applet Project,
2011
Utah State University
Solving Equations Applet Project, Kimberly Thatcher
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
The purpose of this paper is to summarize a Masters Project for the MMath Degree. The purpose of the project was to create and evaluate an applet that maintains the advantages of the existent manipulatives (Hands-On Equations® and the NLVM applet) while also overcoming the limitations of each. Another product of this project is accompanying lesson plans for teachers.
Ranking Score Vectors Of Tournaments,
2011
Utah State University
Ranking Score Vectors Of Tournaments, Sebrina Ruth Cropper
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Given , a tournament on vertices, Landau derived a method to determine how close is to being transitive or regular. This comparison is based on the tournament’s hierarchy number, ̅, a value derived from its score vector ̅ ( ). Let be the set of all score vectors of tournaments on vertices with the entries listed in non-decreasing order. A partial order, poset, exists on the set using the following binary relation. Given ̅ ̅ such that ̅ ̅, let ̅ ̅ if Σ Σ for and Σ Σ . Let this poset be represented as ( ) ( ) …
Convolution Equations In Spaces Of Distributions Supported By Cones,
2011
University of Bordeaux
Convolution Equations In Spaces Of Distributions Supported By Cones, Alex Meril, Daniele C. Struppa
Mathematics, Physics, and Computer Science Faculty Articles and Research
We describe some examples of surjective convolutors on D'(T), for T a closed convex cone in Rn. We also give necessary and suffficient conditions on Si,..., Sm in S'(T) to be generators of the whole convolution algebra S'(F).
Capturing Low Probability Of Disease Dynamics In Coupled Populations,
2011
Montclair State University
Capturing Low Probability Of Disease Dynamics In Coupled Populations, Jackson Burton
Theses, Dissertations and Culminating Projects
Researchers using mathematical models have made significant contributions to the field of epidemiology in recent years. These models have both explanatory and predicative power to describe disease dynamics. More recent work has considered multi-population models and the effects vaccinations have on the population as a whole. One such example can be seen in the West African country of Cameroon, which has two distinct patterns of measles outbreaks. By considering Cameroon as two subpopulations, a deterministic model is developed that includes the effect of vaccinations. Stability analysis is then performed on the model over a range of coupling and vaccination rates …
Continuous Blooming Of Convex Polyhedra,
2011
Massachusetts Institute of Technology
Continuous Blooming Of Convex Polyhedra, Erik D. Demaine, Martin L. Demaine, Vi Hart, Joan Iacono, Stefan Langerman, Joseph O'Rourke
Computer Science: Faculty Publications
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.
“Drawing” Upon Your Students’ Creativity: Teaching (Your Subject Here) With Comic Books,
2011
Western Kentucky University
“Drawing” Upon Your Students’ Creativity: Teaching (Your Subject Here) With Comic Books, Bruce Kessler
Mathematics Faculty Publications
During Spring 2009, Dr. Kessler created and published a comic book series that embedded math content into the story for 4th-6th grade students. The comics were well received in the classrooms at Cumberland Trace Elementary. Dr. Kessler contends that this approach to teaching and learning can be used in any content area, and is useful for engaging students who might not be as interested otherwise. This session will explore ways of utilizing the skills of your students to construct learning comics in your classes, regardless of the funds, technology, and artistic experience at your disposal. The session will include a …
2011 Sonia Kovalevsky Math For Girls Day Flyer,
2011
Lincoln University
2011 Sonia Kovalevsky Math For Girls Day Flyer, Association For Women In Mathematics, Lincoln University Of Missouri, Donna L. Stallings
Math for Girls Day Documents
6th Annual Lincoln University Sonia Kovalevsky Math for Girls Day program flyer on April 29, 2011.
2011 Sonia Kovalevsky Math For Girls Day Evaluation Forms,
2011
Lincoln University
2011 Sonia Kovalevsky Math For Girls Day Evaluation Forms, Association For Women In Mathematics, Lincoln University Of Missouri, Donna L. Stallings
Math for Girls Day Documents
Presenter, student and teacher evaluation forms for the 6th Annual Lincoln University Sonia Kovalevsky Math for Girls Day program flyer on April 29, 2011.
Public Policy, Long Run Growth And Economic Transition From Agriculture To Industrial Mass Production.,
2011
Indian Statistical Institute
Public Policy, Long Run Growth And Economic Transition From Agriculture To Industrial Mass Production., Rudrani Bhattacharya Dr.
Doctoral Theses
It has been recognized that the heart of the development process lies on the transformation of an economy from traditional activities in agriculture to industrial activities. As emphasized by Lewis (1954), the movement of labor from primary sector to industry is conducive to the rise of economy’s savings and investment rate and thus fostering economic growth. The core of this paradigm is the historically observed rapid growth in today’s developed countries associated with expansion of industrial activities.It is well-documented by now that at least over a few centuries leading up to 1800 AD there was little change in the world …
Integer Optimization And Computational Algebraic Topology,
2011
Washington State University
Integer Optimization And Computational Algebraic Topology, Bala Krishnamoorthy
Systems Science Friday Noon Seminar Series
We present recently discovered connections between integer optimization, or integer programming (IP), and homology. Under reasonable assumptions, these results lead to efficient solutions of several otherwise hard-to-solve problems from computational topology and geometric analysis. The main result equates the total unimodularity of the boundary matrix of a simplicial complex to an algebraic topological condition on the complex (absence of relative torsion), which is often satisfied in real-life applications . When the boundary matrix is totally unimodular, the problem of finding the shortest chain homologous under Z (ring of integers) to a given chain, which is inherently an integer program, can …
Packings And Realizations Of Degree Sequences With Specified Substructures,
2011
University of Nebraska-Lincoln
Packings And Realizations Of Degree Sequences With Specified Substructures, Tyler Seacrest
Department of Mathematics: Dissertations, Theses, and Student Research
This dissertation focuses on the intersection of two classical and fundamental areas in graph theory: graph packing and degree sequences. The question of packing degree sequences lies naturally in this intersection, asking when degree sequences have edge-disjoint realizations on the same vertex set. The most significant result in this area is Kundu's k-Factor Theorem, which characterizes when a degree sequence packs with a constant sequence. We prove a series of results in this spirit, and we particularly search for realizations of degree sequences with edge-disjoint 1-factors.
Perhaps the most fundamental result in degree sequence theory is the Erdos-Gallai Theorem, characterizing …
Extremal Trees And Reconstruction,
2011
University of Nebraska-Lincoln
Extremal Trees And Reconstruction, Andrew Ray
Department of Mathematics: Dissertations, Theses, and Student Research
Problems in two areas of graph theory will be considered.
First, I will consider extremal problems for trees. In these questions we examine the trees that maximize or minimize various invariants. For instance the number of independent sets, the number of matchings, the number of subtrees, the sum of pairwise distances, the spectral radius, and the number of homomorphisms to a fixed graph. I have two general approaches to these problems. To find the extremal trees in the collection of trees on n vertices with a fixed degree bound I use the certificate method. The certificate is a branch invariant, …
Circle The Cat: Developing Intelligent Strategies For A Simple Two-Player Game,
2011
Valparaiso University
Circle The Cat: Developing Intelligent Strategies For A Simple Two-Player Game, Kirk Baly, Micheal Lay, Owen Prough
Symposium on Research and Creative Expression (SORCE)
Circle the Cat is an adaptation of the classic mathematical puzzle Qudraphage in which a cat attempts to escape a hexagonal board, but after each move one hexagon is blocked. We have coded a simulation of this classic puzzle. The result of our development allows for the implementation of varying strategies to computationally examine their effectiveness. The code itself, though extensive, is open enough for additions/extensions to be added fairly easily. Analysis of simpler strategies has allowed for improvement of both Cat and Player AI systems. We are currently looking at implementing more advanced systems, perhaps turning to machine learning.
Lazy Golfing,
2011
Valparaiso University
Lazy Golfing, Didar Ashkerbekov, Max Hougas
Symposium on Research and Creative Expression (SORCE)
Walking golfers are expected to leave their golf bags just outside the edge of the green while they are putting the ball. We construct a simple model of this situation, in which the green is assumed to be a circle with the hole at the center and the golfer one-putts the ball. (He or she is a great golfer!) We construct a function to determine the distance that the golfer walks from his or her approach shot on the green and then to the next tee box. Given this model, we determine the optimal location for leaving the golf bag …
Annihilators Of Local Cohomology Modules,
2011
University of Nebraska-Lincoln
Annihilators Of Local Cohomology Modules, Laura Lynch
Department of Mathematics: Dissertations, Theses, and Student Research
In many important theorems in the homological theory of commutative local rings, an essential ingredient in the proof is to consider the annihilators of local cohomology modules. We examine these annihilators at various cohomological degrees, in particular at the cohomological dimension and at the height or the grade of the defining ideal. We also investigate the dimension of these annihilators at various degrees and we refine our results by specializing to particular types of rings, for example, Cohen Macaulay rings, unique factorization domains, and rings of small dimension.
Adviser: Thomas Marley
Applications Of Hidden Markov Models In Microarray Gene Expression Data,
2011
University of Nebraska at Omaha
Applications Of Hidden Markov Models In Microarray Gene Expression Data, Huimin Geng, Xutao Deng, Hesham Ali
Computer Science Faculty Publications
Hidden Markov models (HMMs) are well developed statistical models to capture hidden information from observable sequential symbols. They were first used in speech recognition in 1970s and have been successfully applied to the analysis of biological sequences since late 1980s as in finding protein secondary structure, CpG islands and families of related DNA or protein sequences [1]. In a HMM, the system being modeled is assumed to be a Markov process with unknown parameters, and the challenge is to determine the hidden parameters from the observable parameters. In this chapter, we described two applications using HMMs to predict gene functions …
Multiple Solutions For An Elliptic Problem Related To Vortex Pairs,
2011
Wright State University - Main Campus
Multiple Solutions For An Elliptic Problem Related To Vortex Pairs, Yi Li, Shuangjie Peng
Mathematics and Statistics Faculty Publications
Let Ω be a bounded domain in RN (N⩾2), φ a harmonic function in Ω¯. In this paper we study the existence of solutions to the following problem arising in the study of vortex pairs(Pλ){−Δu=λ(u−φ)+p−1,x∈Ω,u=0,x∈∂Ω. The set Ωp={x∈Ω,u(x)>φ} is called “vortex core”. Existence of solutions whose “vortex core” consists of one component and asymptotic behavior of “vortex core” were studied by many authors for large λ recently. Under the condition that φ has k strictly local minimum points on the boundary ∂Ω, we obtain in this paper that for λ large enough, (Pλ) has a solution with “vortex core” …
A Census Of Vertices By Generations In Regular Tessellations Of The Plane,
2011
Harvey Mudd College
A Census Of Vertices By Generations In Regular Tessellations Of The Plane, Alice Paul '12, Nicholas Pippenger
All HMC Faculty Publications and Research
We consider regular tessellations of the plane as infinite graphs in which q edges and q faces meet at each vertex, and in which p edges and p vertices surround each face. For 1/p + 1/q = 1/2, these are tilings of the Euclidean plane; for 1/p + 1/q < 1/2, they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distance (as measured by the number of edges in a shortest path) from the origin. For all p ≥ 3 and q ≥ 3 with 1/p + 1/q ≤ 1/2, we give simple combinatorial derivations of the rational generating functions for the number of vertices in each generation.
A Direct Limit For Limit Hilbert-Kunz Multiplicity For Smooth Projective Curves,
2011
Universitat Osnabruck,
A Direct Limit For Limit Hilbert-Kunz Multiplicity For Smooth Projective Curves, Holger Brenner, Jinjia Li, Claudia Miller
Mathematics - All Scholarship
This paper concerns the question of whether a more direct limit can be used to obtain the limit Hilbert Kunz multiplicity, a possible candidate for a characteristic zero Hilbert-Kunz multiplicity. The main goal is to establish an affirmative answer for one of the main cases for which the limit Hilbert Kunz multiplicity is even known to exist, namely that of graded ideals in the homogeneous coordinate ring of smooth projective curves. The proof involves more careful estimates of bounds found independently by Brenner and Trivedi on the dimensions of the cohomologies of twists of the syzygy bundle as the characteristic …
Elliptic Pairs Of Primes In Cryptography And Their Effects On Rsa Security,
2011
Department of Mathematics, Boise State University
Elliptic Pairs Of Primes In Cryptography And Their Effects On Rsa Security, Suzanne Craig, Liljana Babinkostova
College of Arts and Sciences Poster Presentations
Cryptography is a constantly evolving field – elliptic curve groups have been a major part of this field since 1987 when Koblitz and Miller separately proposed their use in cryptosystems such as RSA.
- Elliptic Curve: A curve defined by the equation: where A and B are less than a prime p, and where the discriminant is not equal to zero. We are concerned with the curves where A = 0.
- Elliptic Curve Group (ECG): A group whose elements are defined by the elliptic curve and the operation in question. Elliptic curves naturally qualify as groups due simply to their nature. …
