Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

27,197 Full-Text Articles 30,113 Authors 19,080,919 Downloads 304 Institutions

All Articles in Mathematics

Faceted Search

27,197 full-text articles. Page 426 of 951.

Topics In Complex And Large-Scale Data Analysis, Guanshengrui Hao 2019 Washington University in St. Louis

Topics In Complex And Large-Scale Data Analysis, Guanshengrui Hao

Arts & Sciences Graduate Student Theses and Dissertations

Past few decades have witnessed skyrocketed development of modern technologies. As a result, data collected from modern technologies are evolving towards a direction with more complicated structure and larger scale, driving the traditional data analysis methods to develop and adapt. In this dissertation, we study three statistical issues rising in data with complicated structure and/or in large scale. In Chapter 2, we propose a Bayesian framework via exponential random graph models (ERGM) to estimate the model parameters and network structures for networks with measurement errors; In Chapter 3, we design a novel network sampling algorithm for large-scale networks with community …


Limits And Singularities Of Normal Functions., Tokio Sasaki 2019 Washington University in St. Louis

Limits And Singularities Of Normal Functions., Tokio Sasaki

Arts & Sciences Graduate Student Theses and Dissertations

On a projective complex variety $X$, constructing indecomposable higher Chow cycles is an interesting question toward the Hodge conjecture, motives, and other arithmetic applications. A standard method to determine whether a given higher cycle is indecomposable or not is to consider it as a general fiber of a degenerate family of higher cycles, and observe the asymptotic behaviors of the associated higher normal functions. In this thesis, we introduce some known examples of indecomposable cycles and a new method to detect the linearly independence of $\mathbb{R}$-regulator indecomposable $K_1$-cycles which is based on the singularities and limits of admissible normal functions …


Theory Of Linear Models For Estimating Regression Parameters With Applications To Two-Factor Studies With Unequal Sample Sizes, Zenan Sun 2019 Bridgewater State University

Theory Of Linear Models For Estimating Regression Parameters With Applications To Two-Factor Studies With Unequal Sample Sizes, Zenan Sun

Honors Program Theses and Projects

In this thesis we explored some topics in regression analysis. In particular, we studied what linear regression is from a matrix theory perspective, and applied analysis of variance in a setting with two factors and unbalanced sample sizes. In addition, we applied Box-Cox variable transformation as a solution when the regression model violated the normality and equal variance (also called homoscedasticity) assumption. Our main goal is to use these theories to construct models and investigate questions related to lifetime earnings of people living in America by using real data. In doing so, we used the statistical software R to perform …


Finite Field Dynamics: Exploring Isomorphic Graphs And Cycles Of Length P, Catlain McCarthy 2019 Bridgewater State University

Finite Field Dynamics: Exploring Isomorphic Graphs And Cycles Of Length P, Catlain Mccarthy

Honors Program Theses and Projects

For this project, we explore nite eld dynamics and the various patterns of cycles of elements that emerge from the manipulation of a function and eld. Given a function f : Fp ��! Fp, we can create a directed graph with an edge from c to f(c) for all c 2 Fp. We especially consider polynomials of the form f(x) = xd + c and investigate how varying the values of d and c affect the cycles in a given nite eld, Fp. We analyze data to look for graphs that result in cycles of length p. We also identify …


On The Intersection Number Of Finite Groups, Humberto Bautista Serrano 2019 University of Texas at Tyler

On The Intersection Number Of Finite Groups, Humberto Bautista Serrano

Math Theses

Let G be a finite, nontrivial group. In a paper in 1994, Cohn defined the covering number of a finite group as the minimum number of nontrivial proper subgroups whose union is equal to the whole group. This concept has received considerable attention lately, mainly due to the importance of recent discoveries. In this thesis we study a dual concept to the covering number. We define the intersection number of a finite group as the minimum number of maximal subgroups whose intersection is equal to the Frattini subgroup. Similarly we define the inconjugate intersection number of a finite group as …


Behind The Tiles: Mathematics Of Carcassonne, Emilia DeWyngaert 2019 Merrimack College

Behind The Tiles: Mathematics Of Carcassonne, Emilia Dewyngaert

Across the Bridge: The Merrimack Undergraduate Research Journal

Carcassonne is a tile-placing game where players take turns choosing a tile from a stack and attempting to create a city, road or a meadow. In addition to this, there is a river expansion pack that has river tiles to be placed. This paper focuses on how many different layouts or configurations of the river expansion pack can be created. It also discusses the Matlab code adapted to create a simulation of possible configurations of the river expansion pack.


Black Swamp Pub And Bistro Analysis, Sara Aniol 2019 Bowling Green State University

Black Swamp Pub And Bistro Analysis, Sara Aniol

Honors Projects

The Black Swamp Pub and Bistro is a full-service restaurant located in the Union on the Bowling Green State University Campus. We mainly do sit-down service, but we also do take-out orders and have a full bar with draft beers as well as mixed drinks. Our menu tends to change a lot, with new additions as well as some of the items being deleted. My goal of this project is to try to give some insight on the patterns that are too big to see with day-to-day operations as well as give some recommendations for the future that is backed …


Bounding The Rates Of Convergence Towards The Extreme Value Distributions, James Palmer 2019 Bridgewater State University

Bounding The Rates Of Convergence Towards The Extreme Value Distributions, James Palmer

Honors Program Theses and Projects

Extreme value theory is a branch of probability which examines the extreme outliers of probability distributions. Three extreme value distributions arise as the limits of the maxima of sequences of random variables with certain properties. In this paper, we will first give information about these three distributions and prove that they are the only limit distributions of maxima. After that, we switch to a discussion about Stein's method. Stein's method is commonly used to prove central limit theorems. Stein's method also develops bounds on the distance between probability distributions with regards to a probability metric. There are three essential steps …


Software For Conformal Boundary Operators, T-Curvatures, And Conformal Fractional Laplacians Of Odd Order, Lawrence Peterson 2019 University of North Dakota

Software For Conformal Boundary Operators, T-Curvatures, And Conformal Fractional Laplacians Of Odd Order, Lawrence Peterson

Datasets

The author has developed some new computer software and has used it, together with Mathematica and John M. Lee's Ricci software package, to construct and verify many of the symbolic formulae in the article "Conformal boundary operators, T-curvatures, and conformal fractional Laplacians of odd order," by the author and A. Rod Gover. This software is posted here, along with the Ricci package.

The author has also prepared a special guidelines file describing the new software. This guidelines file briefly describes Mathematica and Ricci as well. One should read Section 3 of the guidelines file before saving the main software file …


An Analysis Of The Telegrapher Equation With A Bifurcation Parameter To Model Relativistic Diffusion, Hunter R. Wages 2019 Wofford College

An Analysis Of The Telegrapher Equation With A Bifurcation Parameter To Model Relativistic Diffusion, Hunter R. Wages

Student Scholarship

In this paper, we derive a solution to the telegrapher equation. We then apply a bifurcation parameter to the telegrapher equation in order to analyze the behavior of the solution as it changes classification. In order to obtain the solution to both the telegrapher and modified telegrapher equation, we derive the heat equation and telegrapher equation using a continuous random walk. We also solve the heat equation using invariant properties of a particular solution, a random walk analysis, and a Fourier-Laplace transform. The solution to the telegrapher equation contains modified Bessel functions, so we also derive the solutions to both …


Modified Ramsey Numbers, Meaghan Mahoney 2019 Bridgewater State University

Modified Ramsey Numbers, Meaghan Mahoney

Honors Program Theses and Projects

Ramsey theory is a eld of study named after the mathematician Frank P. Ramsey. In general, problems in Ramsey theory look for structure amid a collection of unstructured objects and are often solved using techniques of Graph Theory. For a typical question in Ramsey theory, we use two colors, say red and blue, to color the edges of a complete graph, and then look for either a complete subgraph of order n whose edges are all red or a complete subgraph of order m whose edges are all blue. The minimum number of vertices needed to guarantee one of these …


Portfolio Optimization Methods: The Mean-Variance Approach And The Bayesian Approach, Hoang Nguyen 2019 University of Mississippi

Portfolio Optimization Methods: The Mean-Variance Approach And The Bayesian Approach, Hoang Nguyen

Honors Theses

This thesis is a discussion on the mean-variance approach to portfolio optimization and an introduction of the Bayesian approach, which is designed to solve certain limitations of the classical mean-variance analysis. The primary goal of portfolio optimization is to achieve the maximum return from investment given a certain level of risk. The mean-variance approach, introduced by Harry Markowitz, sought to solve this optimization problem by analyzing the means and variances of a certain collection of stocks. However, due to its simplicity, the mean-variance approach is subject to various limitations. In this paper, we seek to solve some of these limitations …


Firefighter Problem Played On Infinite Graphs, Sarah Days-Merrill 2019 Bridgewater State University

Firefighter Problem Played On Infinite Graphs, Sarah Days-Merrill

Honors Program Theses and Projects

The Firefighter Problem was introduced over 30 years ago and continues to be studied by researchers today. The problem consists of a graph of interest where a fire breaks out at time t = 0 on any given vertex of thegraph G. The player, then, gets to place a firefighter to “protect” a vertex from the fire. Each consecutive turn,the fire spreads to adjacent vertices. These vertices are then referred to as “burned”. The firefighter also gets tomove to protect an additional, unburned vertex, completing the first round. Each vertex that the firefighter “defends” stays protected for the remainder …


#Whyididntreport: Using Social Media As A Tool To Understand Why Sexual Assault Victims Do Not Report, Abby Garrett 2019 University of Mississippi

#Whyididntreport: Using Social Media As A Tool To Understand Why Sexual Assault Victims Do Not Report, Abby Garrett

Honors Theses

Sexual assault has gone largely under-reported, and social media movements, like #WhyIDidntReport, have brought great awareness to this issue. In order to take advantage of the large amounts of data the #WhyIDidntReport movement has generated, the study uses tweets to explore reasons why victims do not report their assault. The thesis cites current research on the topic of assault to generate a list of explanations victims use to describe their lack of reporting and compares the distributions with existing studies. We use a supervised learning technique to automatically categorize tweets into one of eight categories. This approach uses social sensing …


Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper 2019 University of Haifa-Oranim

Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper

Theory & Applications of Graphs

The maximum oriented k-forcing number of a simple graph G, written MOFk(G), is the maximum directed k-forcing number among all orientations of G. This invariant was recently introduced by Caro, Davila and Pepper in [6], and in the current paper we study the special case where G is the complete graph with order n, denoted Kn . While MOFk(G) is an invariant for the underlying simple graph G, MOFk(Kn) can also be interpreted as an interesting property for tournaments. Our main results …


On Monochromatic Pairs With Nondecreasing Diameters, Adam O'Neal, Michael W. Schroeder 2019 Marshall University

On Monochromatic Pairs With Nondecreasing Diameters, Adam O'Neal, Michael W. Schroeder

Mathematics Faculty Research

Let n m r t be positive integers and Δ : [n] → [r]. We say Δ is (m, r, t) - permissible if there exist t disjoint m-sets B1,…,Bt contained in [n] for which

  1. |Δ(Bi)| = 1 for each i = 1,2,…, t.
  2. max(Bi) < min(Bi+1) for each i = 1,2,…, t − 1, and
  3. max(Bi) − min(Bi) ≤ max(Bi+1) − max(Bi+1) for each i = …


Matching Preclusion Of The Generalized Petersen Graph, Ajay Arora, Eddie Cheng, Christopher Melekian 2019 Novi High School

Matching Preclusion Of The Generalized Petersen Graph, Ajay Arora, Eddie Cheng, Christopher Melekian

Theory & Applications of Graphs

The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings. In this paper we determine the matching preclusion number for the generalized Petersen graph P(n,k) and classify the optimal sets.


Impartial Achievement Games For Generating Nilpotent Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben 2019 College of Saint Benedict/Saint John's University

Impartial Achievement Games For Generating Nilpotent Groups, Bret J. Benesh, Dana C. Ernst, Nándor Sieben

Mathematics Faculty Publications

We study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nim-numbers of this game for finite groups of the form T×H, where T is a 2-group and H is a group of odd order. This includes all nilpotent and hence abelian groups.


Periodicity And Invertibility Of Lattice Gas Cellular Automata, Jiawen Wang 2019 Rose-Hulman Institute of Technology

Periodicity And Invertibility Of Lattice Gas Cellular Automata, Jiawen Wang

Mathematical Sciences Technical Reports (MSTR)

A cellular automaton is a type of mathematical system that models the behavior of a set of cells with discrete values in progressing time steps. The often complicated behaviors of cellular automata are studied in computer science, mathematics, biology, and other science related fields. Lattice gas cellular automata are used to simulate the movements of particles. This thesis aims to discuss the properties of lattice gas models, including periodicity and invertibility, and to examine their accuracy in reflecting the physics of particles in real life. Analysis of elementary cellular automata is presented to introduce the concept of cellular automata and …


Effects Of Framing In Exams On Student Performance, Mariana Lane, Eric Reyes 2019 Rose-Hulman Institute of Technology

Effects Of Framing In Exams On Student Performance, Mariana Lane, Eric Reyes

Mathematical Sciences Technical Reports (MSTR)

No abstract provided.


Digital Commons powered by bepress