Mathematics Commons^™

Instructional Strategies That Support Student Achievement With The Eureka Algebra 1 Curriculum, Honnalora Hill

Walden Dissertations and Doctoral Studies

Numerous states use research-based mathematics curricula as a teaching tool to enhance mathematics performance outcomes on state assessment scores. Despite implementation of the Eureka curriculum, students at the study site were still struggling to master Algebra 1 skills sufficiently to pass the Louisiana state exam. The aim of this basic qualitative study was to explore strategies teachers employed while implementing the Eureka curriculum to increase student achievement. The study was guided by Vygotsky’s zone of proximal development (ZPD) theoretical framework and involved semi-structured interviews with 12 participants who had been teaching Algebra 1 with the Eureka curriculum for at least …

Schur Analysis Over The Unit Spectral Ball, Daniel Alpay, Ilwoo Choo

Mathematics, Physics, and Computer Science Faculty Articles and Research

We begin a study of Schur analysis when the variable is now a matrix rather than a complex number. We define the corresponding Hardy space, Schur multipliers and their realizations, and interpolation. Possible applications of the present work include matrices of quaternions, matrices of split quaternions, and other algebras of hypercomplex numbers.

Instructional Strategies That Support Student Achievement With The Eureka Algebra 1 Curriculum, Honnalora Hill

Walden Dissertations and Doctoral Studies

Numerous states use research-based mathematics curricula as a teaching tool to enhance mathematics performance outcomes on state assessment scores. Despite implementation of the Eureka curriculum, students at the study site were still struggling to master Algebra 1 skills sufficiently to pass the Louisiana state exam. The aim of this basic qualitative study was to explore strategies teachers employed while implementing the Eureka curriculum to increase student achievement. The study was guided by Vygotsky’s zone of proximal development (ZPD) theoretical framework and involved semi-structured interviews with 12 participants who had been teaching Algebra 1 with the Eureka curriculum for at least …

Nidus Idearum. Scilogs, Xiv: Superhyperalgebra, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this fourteenth book of scilogs – one may find topics on examples where neutrosophics works and others don’t, law of included infinitely-many-middles, decision making in games and real life through neutrosophic lens, sociology by neutrosophic methods, Smarandache multispace, algebraic structures using natural class of intervals, continuous linguistic set, cyclic neutrosophic graph, graph of neutrosophic triplet group , how to convert the crisp data to neutrosophic data, n-refined neutrosophic set ranking, adjoint of a square neutrosophic matrix, neutrosophic optimization, de-neutrosophication, the n-ary soft set relationship, hypersoft set, extending the hypergroupoid to the superhypergroupoid, alternative ranking, Dezert-Smarandache Theory (DSmT), reconciliation between …

`The Very Beautiful Principles Of Natural Philosophy': Michael Faraday, Paper Marbling And The Physics Of Natural Forms, Robert Pepperell

LASER Journal

In 1854, Michael Faraday wrote to thank the author who had sent him a book on the art of paper marbling. In the letter, Faraday referred to `the very beautiful principles of natural philosophy' involved in the process of dropping ink on thickened water. What are the `beautiful principles' that Faraday referred to, and how are they involved in the art of paper marbling? Here I consider some of the physical processes that occur in paper marbling and how the patterns that emerge represent `dissipative structures' that are governed by fundamental principles of nature, in particular the tendency for physical …

Are All Weakly Convex And Decomposable Polyhedral Surfaces Infinitesimally Rigid?, Jilly Kevo

Rose-Hulman Undergraduate Mathematics Journal

It is conjectured that all decomposable (that is, interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under an additional assumption of codecomposability (that is, the interior of the difference between the convex hull and the polyhedron itself can be triangulated without adding new vertices). One major set of tools for studying infinitesimal rigidity happens to be the (negative) Hessian M_T of the discrete Hilbert-Einstein functional. Besides its theoretical importance, it provides the necessary machinery to tackle the problem …

Big Two And N-Card Poker Probabilities, Brian Wu, Chai Wah Wu

Communications on Number Theory and Combinatorial Theory

Between the poker hands of straight, flush, and full house, which hand is more common? In standard 5-card poker, the order from most common to least common is straight, flush, full house. The same order is true for 7-card poker such as Texas hold'em. However, is the same true for n-card poker for larger n? We study the probability of obtaining these various hands for n-card poker for various values of n≥5. In particular, we derive closed expressions for the probabilities of flush, straight and full house and show that the probability of a flush is less than a straight …

Penney’S Game For Permutations, Yixin Lin

Dartmouth College Ph.D Dissertations

We explore the permutation analog of Penney's game for coin flips. Two players, in order, each choose a permutation of length $k\ge3$. Then a sequence of independent random values from a continuous distribution is generated until the relative order of the last $k$ numbers matches one of the chosen permutations, declaring the player who selected that permutation as the winner.

We calculate the winning probabilities for all pairs of permutations of length $3$ and some pairs of length $4$, demonstrating the non-transitive property of this game, consistent with the original word version. Alternatively, we provide formulas for computing the winning …

Khovanov Homology And Legendrian Simple Knots, Ryan J. Maguire

Dartmouth College Ph.D Dissertations

The Jones polynomial and Khovanov homology are powerful invariants in knot theory. Their computations are known to be NP-Hard and it can be quite a challenge to directly compute either of them for a general knot. We develop explicit algorithms for the Jones polynomial and discuss the implementation of an algorithm for Khovanov homology. Using this we tabulate the invariants for millions of knots, generate statistics on them, and formulate conjectures for Legendrian and transversely simple knots.

On Pattern Avoidance And Dynamical Algebraic Combinatorics, Benjamin Adenbaum

Dartmouth College Ph.D Dissertations

Over the past decade since the term `dynamical algebraic combinatorics' was coined there has been a tremendous amount of activity in the field. Adding to that growing body of work this thesis hopes to be a step towards a broader study of pattern avoidance within dynamical algebraic combinatorics and helps initiate that by considering an action of rowmotion on 321-avoiding permutations. Additionally within we show the first known instance of piecewise-linear rowmotion periodicity for an infinite family of posets that does not follow from a more general birational result. Finally we show that the code of permutation restricted to permutations …

Bi-Harmonic Maps' Existence And P-Balanced Energy And Connections To Harmonic Maps, Lina Wu

Publications and Research

We discover a bi-harmonic map’ existence, its energy growth, and its connections to a harmonic map. First, we prove the existence of a nontrivial bi-harmonic map in a unit sphere. Second, we investigate the p-balanced energy growth of biharmonic maps. As the most important energy technical breakthroughs, we propose an innovative energy algorithm called p-balanced energy technique to break the constraints of the existing L^q-energy technique in detecting L^q-energy growth towards boundlessness. The disadvantage of the finite L^q -energy technique in the L ^q spaces is not effective in dealing with infinite L^q- energy in Non-L^q spaces. Third, we study …

Supplementary Files For: "Interactive Modeling Of Bear Lake Elevations In A Future Climate", Benjamin D. Shaw, Scout Jarman, Brennan Bean, Kevin R. Moon, Wei Zhang, Nathan Butler, Tommy Bolton, April Knight, Emeline Haroldsen, Abby Funk, Rebecca Higbee

Browse all Datasets

The water level, or elevation, of Bear Lake has a significant impact on agriculture, power, infrastructure, and recreation for communities around the lake. Climatological variables, such as precipitation, temperature, and snowfall, all have an impact on the elevation of Bear Lake. As the climate changes due to greenhouse gas emissions, the typical behaviors of these climate variables change, leading to new behaviors in Bear Lake elevation. Because of the importance of Bear Lake, it is vital to be able to model and understand how Bear Lake's elevation may change in the face of different climate scenarios and to gain further …

Topological Indices And Their Applications In Designing Drugs, Fedaa Ismail Abunawa

Thesis/ Dissertation Defenses

This research delves into the use of indices, in the field of drug design with a specific focus on anticancer medications. Topological indices, values derived from representations of chemical structures provide meaningful connections to the physical and chemical characteristics of molecules. These indices act as tools for predicting behavior playing a vital role in crafting therapeutic drugs. The study primarily delves into topological indices like the Sombor index, Randić index, and Atom Bond Connectivity (ABC) index. These indices are calculated for structures and their relationships with physical properties such as molar volume, refractive index, and flash point are explored using …

Oscillations In Neuronal Activity: A Neuron-Centered Spatiotemporal Model Of The Unfolded Protein Response In Prion Diseases, Elliot M. Miller, Tat Chung D. Chan, Carlos Montes-Matamoros, Omar Sharif, Laurent Pujo-Menjouet, Michael R. Lindstrom

School of Mathematical & Statistical Sciences Faculty Publications

Many neurodegenerative diseases (NDs) are characterized by the slow spatial spread of toxic protein species in the brain. The toxic proteins can induce neuronal stress, triggering the Unfolded Protein Response (UPR), which slows or stops protein translation and can indirectly reduce the toxic load. However, the UPR may also trigger processes leading to apoptotic cell death and the UPR is implicated in the progression of several NDs. In this paper, we develop a novel mathematical model to describe the spatiotemporal dynamics of the UPR mechanism for prion diseases. Our model is centered around a single neuron, with representative proteins P …

Yang-Baxter Equations, David Lovitz

Dissertations and Theses

Multiple equations in math, physics, quantum information, and elsewhere are referred to as "the" Yang-Baxter equation, in spite of being a broad family of equations. Most of the equations are nonlinear matrix equations, where the unknown variable is a matrix. This is the case for the so called braided, algebraic, and generalized forms of "the" equation, which are the primary focus of this dissertation. Finding solutions to the various forms of these equations has been the subject of much research. The equations in all their forms are largely considered intractable in high dimensions, and only in dimension 2 have the …

Statistics For Anticyclotomic Iwasawa Invariants Of Elliptic Curves, Jeffrey Hatley, Debanjana Kundu, Anwesh Ray

School of Mathematical & Statistical Sciences Faculty Publications

We study the average behaviour of the Iwasawa invariants for Selmer groups of elliptic curves, considered over anticyclotomic Zp -extensions in both the definite and indefinite settings. The results in this paper lie at the intersection of arithmetic statistics and Iwasawa theory.

How To Propagate Uncertainty Via Ai Algorithms, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Any data processing starts with measurement results. Measurement results are never absolutely accurate. Because of this measurement uncertainty, the results of processing measurement results are, in general, somewhat different from what we would have obtained if we knew the exact values of the measured quantities. To make a decision based on the result of data processing, we need to know how accurate is this result, i.e., we need to propagate the measurement uncertainty through the data processing algorithm. There are many techniques for uncertainty propagation. Usually, they involve applying the same data processing algorithm several times to appropriately modified data. …

Multivalued Variational Inequalities With Generalized Fractional Φ-Laplacians, Vy Khoi Le

Mathematics and Statistics Faculty Research & Creative Works

In this article, we examine variational inequalities of the form (Formula presented.), where (Formula presented.) is a generalized fractional (Formula presented.) -Laplace operator, K is a closed convex set in a fractional Musielak–Orlicz–Sobolev space, and (Formula presented.) is a multivalued integral operator. We consider a functional analytic framework for the above problem, including conditions on the multivalued lower order term (Formula presented.) such that the problem can be properly formulated in a fractional Musielak–Orlicz–Sobolev space, and the involved mappings have certain useful monotonicity–continuity properties. Furthermore, we investigate the existence of solutions contingent upon certain coercivity conditions.

For Discrete-Time Linear Dynamical Systems Under Interval Uncertainty, Predicting Two Moments Ahead Is Np-Hard, Luc Jaulin, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the first approximation, when changes are small, most real-world systems are described by linear dynamical equations. If we know the initial state of the system, and we know its dynamics, then we can, in principle, predict the system's state many moments ahead. In practice, however, we usually know both the initial state and the coefficients of the system's dynamics with some uncertainty. Frequently, we encounter interval uncertainty, when for each parameter, we only know its range, but we have no information about the probability of different values from this range. In such situations, we want to know the range …

How To Make Ai More Reliable, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the reasons why the results of the current AI methods (especially deep-learning-based methods) are not absolutely reliable is that, in contrast to more traditional data processing techniques which are based on solid mathematical and statistical foundations, modern AI techniques use a lot of semi-heuristic methods. These methods have been, in many cases, empirically successful, but the absence of solid justification makes us less certain that these methods will work in other cases as well. To make AI more reliable, it is therefore necessary to provide mathematical foundations for the current semi-heuristic techniques. In this paper, we show that …