The talks will typically take place on Tuesdays at 4:00-5:00pm in Adel Room 164. Please contact John Neuberger with questions about the colloquium.
Note that talks are listed in reverse chronological order.
Speaker: Ryan Kelly (NAU)
Title: One Dimensional Birkhoff Interpolation
Abstract: Birkhoff interpolation was introduced in 1906 by George Birkhoff as a generalization of Lagrange and Taylor interpolation. This talk provides a brief introduction to Birkhoff interpolation. A general error formula for interpolation is presented in terms of a minimal remainder polynomial. An algorithm to compute the minimal remainder polynomial is shown, along with a useful corollary. Some motivating examples are given.
Speaker: Mikhail Baltushkin (NAU)
Title: Applications of topological data analysis in the parameter estimation for the partial differential equations
Abstract: This thesis focuses on the use of topological data analysis (TDA) to study the parameters of the anisotropic Kuramoto-Sivashinsky type equation used to model the pyramidal patterns formed by the bombardment of germanium. The aim is to better understand the influence of the parameters and geometry of the pattern, particularly the κ parameter, and classify their values based on the time evolution of the model. The traditional methods of parameter estimation rely on the iterative approximation of solutions, making it computationally intensive and producing large errors in the estimation process. Instead, this research proposes a machine learning algorithm that uses the relationship between the approximated solutions to predict the parameter values. TDA’s algebraic gadgets, homology and homotopy groups, are used to summarize the complicated topological structure of the approximated solution to the differential equation. In order to perform the computations of homology groups, we define the cubical complexes that are naturally induced by the approximated solution surfaces. In this study, we conducted a wide grid search over possible model and persistence image parameters and tested different types of data to compute the persistence images. The best results were obtained using the flipped surface and H0 homology groups, with the Random Forest Classifier performing the best with approximately 80% accuracy. The model accuracy without TDA applied did not exceed 11% accuracy, as expected. We also created a confusion matrix for the best-performing random forest model, observing some misclassification, particularly within the mid-range of parameters. Interestingly, we found that combining H0 and H1 homology groups did not result in higher accuracy than using H0 on its own. We tested various weighting functions when computing the persistence images and found that the linear and sigmoid functions did not significantly affect the accuracy. These findings are discussed in detail in the following sections, along with a description of the model parameters and the confusion matrix.
Speaker: Shafiu Jibrin (NAU)
Title: Minimizing a Weighted Barrier Function for Second-Order Cone Constraints Over a Hyperplane
Abstract: This work concerns minimizing a weighted barrier function for second-order cone constraints system over a hyperplane. For a given weight vector, the barrier function is minimized using Newton’s method. We apply both quadratic interpolation and backtracking line searches. The starting point for the method is found by finding a solution to the overdetermined linear system that defines the hyperplane. Then, the Dmax Constraint Consensus method (with backtracking) is used to find an interior point of the feasible region from the starting point. We use numerical experiments on randomly generated problems to investigate the effectiveness of the method in finding the weighted analytic center and to compare the two line searches. This a joint work with Jim Swift.
Speaker: Guerrero, Louchart, et al (NAU)
Title: Results of Two Placement Frameworks on Student Achievement in Entry-Level Mathematics and Statistics Courses
Abstract: The Math Placement Committee has recently engaged in two separate activities that both have implications for student equity and access, as well as overall course enrollments. First, in the fall of 2018, we formed a group of randomly selected students formerly placed in the lowest developmental course, and placed them directly into the subsequent mathematics course (as dictated by their chosen major). Secondly, in the fall of 2022, we added High School Core GPA as a math placement indicator to our established multiple measures placement system. In this talk, we will share outcomes and insights from both activities, including the implications for STEM versus non-STEM math pathways, impacts on overall enrollments and course planning, and increased access to degree-required math courses for students, including students of color and first-generation college students.
Speaker: Dr. Peter Vadasz (NAU Mechanical Engineering)
Title: Deterministic Quantum Mechanics
Abstract: A deterministic quantum mechanics theory is presented. The proposed theory is shown to be consistent with the current mainstream statistical quantum theory as well as with classical physics. It produces solutions, which demonstrate that causality, physical reality, and determinism are restored and can explain in simple form concerns that are raised by results from the current mainstream statistical quantum theory. The meaning of particle-wave duality and complementarity, the possibility of a particle, like the electron, to cross through the nucleus as it does when the angular momentum of the electron is zero at the ground state of the hydrogen atom, the possibility of a point-size particle to have an “intrinsic spin”, the possibility of “quantum jumps” as the electron transitions instantaneously from one stable orbital to another without passing through the space in between the orbitals and does that at irregular time intervals, and the natural collapse of the wave function as part of the solution are some of the results that emerge from the proposed deterministic quantum mechanics theory. The phenomenon of entanglement is also discussed in connection to the proposed theory and linked to the EPR paper and the Bell inequality violation by experiments demonstrating how non-locality and reality can coexist in realistic and classical form. Actual analytical solutions that are consistent with current mainstream quantum theory as well as with classical physics are presented via a linear stability method.
Speaker: Dr. Steve Wilson (NAU-Emeritus)
Title: Transitive and Symmetric Cornerations in Maps
Abstract: When you’re looking for one thing, you find another. Sometimes it’s something even better. In trying to generalize “cycle structures”, we have found a simpler and maybe richer combinatorial object, based on “corners” in a map on a surface. In this talk, we will describe our motivating example, introduce corners and collections of corners (cornerations), prove a few results with entertaining proofs, and present interesting pictures throughout.
Note: The speaker will be giving a remote talk over Zoom (see email announcement for link). Many/most of us will be watching the presentation in Adel 164 as usual.
Speaker: Dr. Brian Beaudrie and Dr. Angie Hodge-Zickerman (NAU)
Title: The Southwestern Section of the Mathematical Association of America: Past, Present, and Future
Abstract: In this interactive colloquium, you will learn about the MAA’s Southwestern Section. You will find out about its past, its present, and its future. When discussing the future of the Section, ample time will be allotted for the audience to voice what they would like to see from our MAA section. We encourage all to attend! We would like to hear from as many voices as possible in this session. Zoom option available.
Speaker: Dr. Peter Vadasz (NAU Department of Mechanical Engineering)
Title: Deterministic Quantum Mechanics
Abstract: A deterministic quantum mechanics theory is presented. The proposed theory is shown to be consistent with the current mainstream statistical quantum theory as well as with classical physics. It produces solutions, which demonstrate that causality, physical reality, and determinism are restored and can explain in simple form concerns that are raised by results from the current mainstream statistical quantum theory. The meaning of particle-wave duality and complementarity, the possibility of a particle, like the electron, to cross through the nucleus as it does when the angular momentum of the electron is zero at the ground state of the hydrogen atom, the possibility of a point-size particle to have an “intrinsic spin”, the possibility of “quantum jumps” as the electron transitions instantaneously from one stable orbital to another without passing through the space in between the orbitals and does that at irregular time intervals, and the natural collapse of the wave function as part of the solution are some of the results that emerge from the proposed deterministic quantum mechanics theory. The phenomenon of entanglement is also discussed in connection to the proposed theory and linked to the EPR paper and the Bell inequality violation by experiments demonstrating how non-locality and reality can coexist in realistic and classical form. Actual analytical solutions that are consistent with current mainstream quantum theory as well as with classical physics are presented via a linear stability method.
Speaker: Dr. Robert Lund (University of California, Santa Cruz)
Title: Correlated Statistical Count Structures
Abstract: This talk overviews the statistical modeling of correlated count structures, including time series, spatial random fields, and space-time processes. In the time series setting, which constitutes the majority of this talk, some history and recent breakthroughs are presented. Classical approaches to the problem and their drawbacks are first reviewed. Next, a Gaussian copula is used to produce an extremely flexible count time series model that is naturally parsimonious, can have negative autocorrelations and/or long-memory features, can easily accommodate covariates, and can be statistically fitted by likelihood methods. An application to annual no-hitter counts in Major League baseball is given. The talk closes with extensions of the methods to the spatial and space-time settings.
Speaker: Michael Falk (NAU)
Title: A non-$K(\pi,1)$ factored line arrangement.
Abstract: In 1995 Luis Paris showed that arrangements of lines in the complex projective plane that are defined by equations with real coefficients and satisfy a certain factorization property have aspherical complements. More recently Gerhard Roehrle and his collaborators showed that the arrangement defined by the polynomial $Q(x,y,z)=x(x^3-y^3)(x^3-z^3)(y^3-z^3)(x+y+rz)$, where $r$ is a third root of 1, is factored. Recently I found a way to show this arrangement does not have aspherical complement, showing Paris’ theorem does not extend to arbitrary complex line arrangements. In this talk I’ll explain the context of the problem and sketch the entertaining proof, which amounts to elementary analytic geometry, albeit working in the complex plane, with an appearance of the main theorem of stratified Morse theory at the end. If there is time I’ll explain the connection with the pencils of curves that appear on Jim Swift’s web page. Joint work with Roehrle, aided by a long discussion during finals week with Michele Torielli and Quinn Beck.
Speaker: Alyssa Whittemore (former NAU undergraduate math major, recent PhD at University of Nebraska-Lincoln, currently senior research scientist at Boston Fusion)
Title: Bootstrap Percolation on Random Geometric Graphs
Abstract: Bootstrap percolation is a discrete-time process that models the spread of information or disease across the vertex set of a graph. We consider the following version of this process: Initially, each vertex of the graph is set active with probability $p$ or inactive otherwise. Then, at each time step, every inactive vertex with at least $k$ active neighbors becomes active. Active vertices will always remain active. The process ends when it reaches a stationary state. If all the vertices eventually become active, then we say we achieve percolation. This process has been widely studied on many families of graphs, deterministic and random. We analyze the bootstrap percolation process on a random geometric graph. A random geometric graph is obtained by choosing $n$ vertices uniformly at random from the unit $d$-dimensional cube or torus, and joining any two vertices by an edge if they are within a certain distance, $r$, of each other. We obtain very precise results that characterize the final state of the bootstrap percolation process in terms of the parameters $p$ and $r$ with high probability as the number $n$ of vertices tends to infinity.