Mathematics Commons^™

Application Of Inverse Problems In Imaging, Xiaoyue Luo

Post-Grant Reports

In this project, we studied how to enhance image quality by denoising and deblurring a given image mathematically. We compared some existing state-of-the-art methods for image denoising and deblurring. We implemented the algorithms numerically using Matlab.

We studied the possibility of combining statistical analysis with the traditional image restoration methods including using wavelets and framelets and we derived some encouraging preliminary results.

My research student Alleta Maier gave a sequence of talks on the project including the Pacific Northwest Mathematical Association of America conference at Oregon State University in April, 2016; Linfield College Taylor Series in March, 2016, and Linfield …

A Comprehensive Analysis Of Team Streakiness In Major League Baseball: 1962-2016, Paul H. Kvam, Zezhong Chen

Department of Math & Statistics Faculty Publications

A baseball team would be considered “streaky” if its record exhibits an unusually high number of consecutive wins or losses, compared to what might be expected if the team’s performance does not really depend on whether or not they won their previous game. If an average team in Major League Baseball (i.e., with a record of 81-81) is not streaky, we assume its win probability would be stable at around 50% for most games, outside of peculiar details of day-to-day outcomes, such as whether the game is home or away, who is the starting pitcher, and so on.

In this …

Flexibility Of Projective-Planar Embeddings, John Maharry, Neil Robertson, Vaidy Sivaraman, Dan Slilaty

Mathematics and Statistics Faculty Publications

Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a collection of maneuvers on projective-planar embeddings that can be used to take σ1 to σ2

Bounding And Stabilizing Realizations Of Biased Graphs With A Fixed Group, Nancy Ann Neudauer, Dan Slilaty

Mathematics and Statistics Faculty Publications

Given a group Γ and a biased graph (G, B), we define a what is meant by a Γ-realization of (G, B) and a notion of equivalence of Γ-realizations. We prove that for a finite group Γ and t ≥ 3, that there are numbers n(Γ) and n(Γ, t) such that the number of Γ-realizations of a vertically 3-connected biased graph is at most n(Γ) and that the number of Γ-realizations of a nonseparable biased graph without a (2Ct , ∅)-minor is at most n(Γ, t). Other results pertaining to contrabalanced biased graphs are presented as well as an analogue …