Mathematics Commons^™

How Elementary Teachers Implement The Eureka Mathematics Curriculum To Improve Mathematics Outcomes, Shannell A. Swan-Clarke

Walden Dissertations and Doctoral Studies

Many states use research-based mathematics curricula as an instructional tool to improve mathematics performance outcomes on state assessment scores. The problem was that despite the implementation of a research-based curriculum, students at XYZ Elementary School (pseudonym) had underperformed on the Partnership for Assessment of Readiness for College and Careers standardized mathematics tests since 2018. The purpose of this basic qualitative study was to discover the implementation practices of teachers using the Eureka Mathematics Curriculum to improve student outcomes at XYZ Elementary School. Dewey’s experiential learning theory was used to support and explore ideas involving the influences of curriculum implementation on …

Oscillating Icebergs, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Another Angle On Perspective, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Exploding Haystacks, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Application Of Mixture Models For Doubly Inflated Count Data, Monika Arora, N. Rao Chaganty

Mathematics & Statistics Faculty Publications

In health and social science and other fields where count data analysis is important, zero-inflated models have been employed when the frequency of zero count is high (inflated). Due to multiple reasons, there are scenarios in which an additional count value of k > 0 occurs with high frequency. The zero- and k-inflated Poisson distribution model (ZkIP) is more appropriate for such situations. The ZkIP model is a mixture distribution with three components: degenerate distributions at 0 and k count and a Poisson distribution. In this article, we propose an alternative and computationally fast expectation–maximization (EM) algorithm to obtain the parameter …

Generalized Sparse Bayesian Learning And Application To Image Reconstruction, Jan Glaubitz, Anne Gelb, Guohui Song

Mathematics & Statistics Faculty Publications

Image reconstruction based on indirect, noisy, or incomplete data remains an important yet challenging task. While methods such as compressive sensing have demonstrated high-resolution image recovery in various settings, there remain issues of robustness due to parameter tuning. Moreover, since the recovery is limited to a point estimate, it is impossible to quantify the uncertainty, which is often desirable. Due to these inherent limitations, a sparse Bayesian learning approach is sometimes adopted to recover a posterior distribution of the unknown. Sparse Bayesian learning assumes that some linear transformation of the unknown is sparse. However, most of the methods developed are …

Another Angle On Perspective: Solutions For Fermi Questions, May 2023, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Dental Floss, Calculus, And Jail: Solutions For Fermi Questions, October 2023, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Ellipses, Leaves, And Solar Crescents, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Dental Floss, Calculus, And Jail, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Not Your Typical Tower Of Sauron: Solutions For Fermi Questions, September 2023, John Adam

Mathematics & Statistics Faculty Publications

The picture is of the tapering Chester Shot Tower, located in Chester, England. It was built in 1799 for the manufacture of lead shot for use in the Napoleonic Wars. Molten lead was poured through a sieve at the top of the tower, with the tiny droplets forming perfect spheres during the fall; these were then cooled in a vat of water at the base. This process was less labor-intensive than an earlier method using molds. It is the oldest of the three remaining shot towers in the UK. Using the parked van at the base, estimate (i) the height …

"Density" Of Light And Pi, John Adam

Mathematics & Statistics Faculty Publications

Question 1: What is the linear “density” of the spectral range on the ceiling? The crown molding is common for an older (circa 1925) house.

Question 2: The glass shown is a standard 16-oz. water glass engraved with many digits of pi. (The dimensions appear somewhat distorted because of the camera angle chosen to enhance the contrast of the numerals against the dark background.)

Shrub Sphericity, John Adam

Mathematics & Statistics Faculty Publications

Question 1: a. Show that α = 4.836, and hence find the sphericity index for (i) a cube and (ii) two identical "kissing" spheres, i.e., spheres in tangential contact. b. Estimate your sphericity index.

Question 2: Estimate χ for the yucca plant in the picture. It is about 1 m in diameter.

Quasisymmetric Functions Distinguishing Trees, Jean-Christophe Aval, Karimatou Djenabou, Peter R. W. Mcnamara

Faculty Journal Articles

A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes directed trees. This latter conjecture would be implied by an affirmative answer to a question of Hasebe and Tsujie about the P-partition enumerator distinguishing posets whose Hasse diagrams are trees. They proved the case of rooted trees and our results include a generalization of their result.

The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna

Senior Honors Theses

The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …

On Regular D-Handicap Tournaments, Bryan Freyberg, Melissa S. Keranen

Michigan Tech Publications, Part 1

k-regular d-handicap tournament is an incomplete tournament in which n teams, ranked according to the natural numbers, play exactly k < n − 1 different teams exactly once and the strength of schedule of the ith ranked team is d more than the (i − 1)st ranked team for some d ≥ 1. That is, strength of schedules increase arithmetically by d with strength of team. A d-handicap distance antimagic labeling of a graph (Formula Presented)forms an arithmetic sequence with difference d ≥ 1. A graph G which admits such a labeling is called a d-handicap graph. Constructing a k-regular d-handicap tournament on n teams is equivalent to finding a k-regular d-handicap graph of order n. For d = 1 and n even, the existence has recently been completely settled for all pairs (n, k), and some results are known for d = 2. For d > 2, the only known result is restricted to the case where n is divisible by 2d+2. In this paper, we construct infinite families of d-handicap graphs where the order is not restricted to a power of 2.

Feature Extraction Of Footwear Impression Images For Quality Assessment, Alexandra Hill

Graduate Theses, Dissertations, and Problem Reports (ETD)

Forensic footwear impression analysis is a valuable tool in criminal investigations. Extracting useful features from images of footwear impressions is a critical step in this process. However, the quality of these images can vary widely, making feature extraction challenging. In order to give a quality assessment rating to a footwear impression image, the image should first be analyzed to extract features from the impression. In this paper, we present a method to extract features from a 2D grayscale footwear impression image. A Hierarchical Grid Model implementation has been adapted from use on a 3D dataset to assist in finding features, …

On Eulerian Subgraphs And Hamiltonian Line Graphs, Yikang Xie

Graduate Theses, Dissertations, and Problem Reports (ETD)

A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}$u, v \in V(G)$}, {\color{black}$G$} has a spanning $(u,v)$-path; {\color{black}$G$} is 1-hamiltonian if for any vertex subset $S \subseteq {\color{black}V(G)}$ with $|S| \le 1$, $G - S$ has a spanning cycle. Let $\delta(G)$, $\alpha'(G)$ and $L(G)$ denote the minimum degree, the matching number and the line graph of a graph $G$, respectively. The following result is obtained. {\color{black} Let $G$ be a simple graph} with $|E(G)| \ge 3$. If $\delta(G) \geq \alpha'(G)$, then each of the following holds. \\ (i) $L(G)$ is Hamilton-connected if and only if $\kappa(L(G))\ge …

Finite Matroidal Spaces And Matrological Spaces, Ziyad M. Hamad

Graduate Theses, Dissertations, and Problem Reports (ETD)

The purpose of this thesis is to present new different spaces as attempts to generalize the concept of topological vector spaces. A topological vector space, a well-known concept in mathematics, is a vector space over a field \mathbb{F} with a topology that makes the addition and scalar multiplication operations of the vector space continuous functions. The field \mathbb{F} is usually \mathbb{R} or \mathbb{C} with their standard topologies. Since every vector space is a finitary matroid, we define two spaces called finite matroidal spaces and matrological spaces by replacing the linear structure of the topological vector space with a finitary matroidal …

Studies On Depth And Torsion In Tensor Products Of Modules, Uyen Huyen Thao Le

Graduate Theses, Dissertations, and Problem Reports (ETD)

This dissertation represents an in-depth exploration of two distinct yet interconnected research topics within commutative algebra: one centered around a conjecture of Huneke and R. Wiegand and the other concerns a depth inequality of Auslander. It consists of the following three papers as well as the author's work under the direction of Professor Olgur Celikbas:

• Remarks on a conjecture of Huneke and Wiegand and the vanishing of (co)homology, Journal of Mathematical Society of Japan Advance Publication. (joint work with Olgur Celikbas, Hiroki Matsui, and Arash Sadeghi).
• An extension of a depth inequality of Auslander, Taiwanese Journal of Mathematics, …

Probabilistic Solutions Of Fractional Differential And Partial Differential Equations And Their Monte Carlo Simulations, Tamer Oraby, Erwin Suazo, Harrinson Arrubla

School of Mathematical & Statistical Sciences Faculty Publications

The work in this paper is four-fold. Firstly, we introduce an alternative approach to solve fractional ordinary differential equations as an expected value of a random time process. Using the latter, we present an interesting numerical approach based on Monte Carlo integration to simulate solutions of fractional ordinary and partial differential equations. Thirdly, we show that this approach allows us to find the fundamental solutions for fractional partial differential equations (PDEs), in which the fractional derivative in time is in the Caputo sense and the fractional in space one is in the Riesz–Feller sense. Lastly, using Riccati equation, we …

Long-Time Asymptotics Of A Complex Cubic Camassa-Holm Equation, Hongyi Zhang, Yufeng Zhang, Zhijun Qiao

School of Mathematical & Statistical Sciences Faculty Publications

n this paper, we study the Cauchy problem of the following complex cubic Camassa-Holm (ccCH) equation mt=bux+12[m(|u|2−|ux|2)]x−12m(uu¯x−uxu¯),m=u−uxx,

where b is an arbitrary real constant. %By applying ∂¯-steepest descent method, l Long-time asymptotics of the equation is obtained through the ∂¯-steepest descent method. Firstly, based on the spectral analysis of the Lax pair and scattering matrix, the solution of the equation is able to be constructed %can be expressed by %the solution of via solving the corresponding Riemann-Hilbert problem (RHP). Then, we present %obtain different long time asymptotic expansions of the solution u(y,t) in different space-time solitonic regions of ξ=y/t. The …

Resurgence Of Habiro Elements, Samuel Crew, Ankush Goswami, Robert Osburn

School of Mathematical & Statistical Sciences Faculty Publications

We prove resurgence properties for the Borel transform of elements in the Habiro ring which satisfy a general type of strange identity. As an application, we provide evidence for (and against) conjectures in quantum topology due to Costin and Garoufalidis.

Quantization For A Set Of Discrete Distributions On The Set Of Natural Numbers, Juan Gomez, Haily Martinez, Mrinal Kanti Roychowdhury, Alexis Salazar, Daniel J. Vallez

School of Mathematical & Statistical Sciences Faculty Publications

The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a theorem, and then give a conjecture. We verify the conjecture by a few examples. Assuming that the conjecture is true, for a set of discrete distributions on the set of natural numbers we have calculated the optimal sets of n-means and the nth quantization errors for all positive integers n. In addition, the quantization dimension is also calculated.

Note On Illuminating Constant Width Bodies, Alexey Glazyrin

School of Mathematical & Statistical Sciences Faculty Publications

Recently, Arman, Bondarenko, and Prymak constructed a constant width body in R n whose illumination number is exponential in n. In this note, we improve their bound by generalizing the construction. In particular, we construct a constant width body in R n whose illumination number is at least (τ + o(1))n, where τ ≈ 1.047.

Constrained Quantization For Probability Distributions, Megha Pandey, Mrinal Kanti Roychowdhury

School of Mathematical & Statistical Sciences Faculty Publications

In this paper, for a Borel probability measure P on a Euclidean space Rk, we extend the definitions of nth unconstrained quantization error, unconstrained quantization dimension, and unconstrained quantization coefficient, which traditionally in the literature known as nth quantization error, quantization dimension, and quantization coefficient, to the definitions of nth constrained quantization error, constrained quantization dimension, and constrained quantization coefficient. The work in this paper extends the theory of quantization and opens a new area of research. In unconstrained quantization, the elements in an optimal set are the conditional expectations in their own Voronoi regions, and it is not true …

Explorations Of A Topology Constructed On The Maximal Ideals Of A Boolean Algebra, Abbigal Moos

Dissertations and Theses

The primary purpose of this thesis is to construct a topology on the collection of maximal ideals of a distributive and complemented lattice using the hull-kernel methodology. Through the construction of this topological space, we discovered that the space is compact, zero-dimensional, and Hausdorff. Next, we looked at the properties of some lattices, namely the power set of a finite set ordered by inclusion and the set of all positives divisors for some arbitrary integer ordered by divisibility. Whenever these lattices were both distributive and complemented, we constructed a topology on the collection of maximal ideals of the lattices using …

Strong Homotopy Lie Algebras And Hypergraphs, Samuel J. Bevins, Marco Aldi

Undergraduate Research Posters

We study hypergraphs by attaching a nilpotent strong homotopy Lie algebra. We especially focus on hypergraph theoretic information that is encoded in the cohomology of the resulting strong homotopy Lie algebra.

Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant, Rachel Bergjord

Electronic Theses and Dissertations

An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that …

Exploding Haystacks: Solutions For Fermi Questions, March 2023, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.