Math/Stat Colloquium
About the Colloquium
The Department of Mathematics and Statistical Science Colloquium brings in speakers from within the department and from other universities to give professional mathematical talks. These talks are open to any who would like to attend, and their content reflects a variety of mathematical disciplines.
Times and Locations
For Spring 2024, the Colloquium meets periodically on Thursdays from 3:30  4:20 p.m in TLC 030. A Zoom link is also available. There are always pretalk refreshments in Brink Hall room 305.
Date 
Speaker / Title / Abstract 

Current Semester: 

3:30 p.m., February 22, 2024 TLC 030 
Esteban HernandezVargas (University of Idaho) Redefining the wellposed problems for Calibrating Digital Twins Abstract: Jacques Hadamard defined three properties that a wellposed problem should have in order to be interesting for mathematical analysis. While the most important problems in machine learning and in science are inverse problems, these are often not wellposed. In this talk we will discuss the inverse problem, identifiability, and how we will need to refine math concepts to abstract an Immune Digital Twin, which is a reasonably accurate software replica of the immune system that will revolutionize health space and biology. To reach this dream in the future, we need to start now redefining the inverse problem and engineering computational algorithms. 
3:30 p.m., March 21, 2024 
Tinashe B. Gashirai (U of I, Institute for Modeling Collaboration and Innovation) Caputo Fractional Derivative and Computational Fractional Dynamics Abstract: This colloquium seeks to discuss basic concepts related to fractional calculus (FC) in the sense of the Caputo derivative relevant to the application FC and numerical methods for fractional calculus (NMFC) in modeling science and engineering problems that follow nonMarkovian processes. Fractional derivatives were introduced over three hundred years ago and the interest in the application of these noninteger order derivatives has signiﬁcantly grown over the past few decades. These derivatives have an excellent ability of describing (capturing/modeling) complex interactions that possess memory and hereditary traits, among other things. In this presentation, the Caputo fractional derivative (CFD) is preferred over other deﬁnitions of noninteger order derivative like the RiemannLiouville, Riesz and the GrunwaldLetnikov. This is owing to the fact that the interpretation of the initial and boundary conditions of an initial/boundary value problem in the Caputo approach is similar to the case of classical (integer) order approach. This probably explains why the CFD is often utilized in practical applications. 
3:30 p.m., March 28, 2024 TLC 030 
Michael DePasquale (New Mexico State University) Connecting the algebra and geometry of line arrangements via rigidity theory Abstract: A hyperplane arrangement is a union of codimension one linear spaces. These simple objects provide fertile ground for interactions between combinatorics, algebra, algebraic geometry, topology, and group actions. The combinatorics of an arrangement is encoded by the pattern of intersections among the hyperplanes, called its intersection lattice. On the other hand, a key algebraic object is the module of vector ﬁelds tangent to the arrangement, called the module of logarithmic derivations, which was introduced by Saito in 1980 to study the singularities of hypersurfaces. An enduring mystery in the theory of hyperplane arrangements is which algebraic properties of the module of logarithmic derivations can be determined from the intersection lattice, and which properties depend fundamentally on the geometry (i.e. the exact hyperplanes). At the center of this mystery is Terao’s conjecture, which proposes that the algebraic property of freeness can be determined only from the intersection lattice. In this talk we explain how rigidity of planar frameworks (dating back to Maxwell) plays a key role in connecting the geometry and algebra of line arrangements in the projective plane. This is joint work with Jessica Sidman and Will Traves. 
3:30 p.m., April 4, 2024 TLC 030 
Oleksandr Dykhovychnyi (Washington State University) Energyefficient flocking with nonlinear navigational feedback Abstract: Modeling collective motion in multiagent systems has gained much attention in recent years. In particular, of interest are the conditions under which flocking dynamics emerges. We present a generalization of the multiagent model of OlfatiSaber with nonlinear navigational feedback forces. As opposed to the original model, our model is, in general, not dissipative. This makes obtaining sufficient conditions for flocking challenging due to the absence of an obvious choice of a Lyapunov function. By means of an alternative argument, we show that our model possesses a global attractor when the navigational feedback forces are bounded perturbations of the linear ones. We further demonstrate that, under mild conditions, the dynamics of the group converges to a complete velocity consensus at an exponential rate. We present a case study of the energy efficiency of our model, illustrating how nonlinear navigational feedback forces, possessing flexibility that linear forces lack, can be used to reduce onboard energy consumption. 
3:30 p.m., April 11, 2024 Zoom only 
Xinyi Li (Clemson University) 
3:30 p.m., April 18, 2024 TLC 030 
Silvia Jimenez Bolanos (Colgate University) 
3:30 p.m., April 25, 2024 TLC 030 
Jordan Broussard (Whitworth University) Template Arrays and TwoDimensional Recurrence Relations Abstract: In a twodimensional recurrence relation, there is an underlying structure composed of the twodimensional sequences (arrays) in which the set of indices is extended from an ordered pair where each entry comes from the set of natural numbers to an ordered pair where each entry comes from the set of integers. The recurrences we will look at have coefficients that come from a field. In this talk, we will look at a set of initial conditions sufficient to build a uniquelydetermined array from a given recurrence and initial conditions, as well as look at how to construct a Schauder basis using elementary arrays for the set of arrays. 
3:30 p.m., May 2, 2024 Room TBA 
Oleksandr Dykhovychnyi (Washington State University) 
Past Semesters: 

3:30 p.m., September 14, 2023 TLC 029 
David Andrew Smith (YaleNUS College  The National University of Singapore) Fokas Diagonalization Abstract: We describe a new form of diagonalization for linear two point constant coefficient differential operators with arbitrary linear boundary conditions. Although the diagonalization is in a weaker sense than that usually employed to solve initial boundary value problems (IBVP), we show that it is sufficient to solve IBVP whose spatial parts are described by such operators. We argue that the method described may be viewed as a reimplementation of the Fokas transform method for linear evolution equations on the finite interval. The results are extended to multipoint and interface operators, including operators defined on networks of finite intervals, in which the coefficients of the differential operator may vary between subintervals, and arbitrary interface and boundary conditions may be imposed; differential operators with piecewise constant coefficients are thus included. 
3:30 p.m., September 21, 2023 TLC 029 
Tuan Phan (University of Idaho, Institute for Interdisciplinary Data Science) Mathematical modeling of some biological and medical problems in cancer research and physiology Abstract: In this presentation, I will discuss two mathematical models utilizing stochastic differential equations (SDEs) and/or ordinary differential equations (ODEs). In the first one, we studied human papillomavirus (HPV) infection by proposing a 5dimensional Ito's SDE system. The theoretical and numerical analyses of the system were conducted to reveal insights intot he progression from HPV infection to cervical cancer. The second one involves cooperative activation of force in human myocardium in which a 3dimensional ODE system was proposed to capture the relationship between the rate of force redevelopment and relative force in mechanical data from porcine and murine myocardium. The fitting results of the model led to deep understanding of cooperative mechanisms that underlie differences in myocardial contractile dynamics between large and small mammals. 
September 28, 2023 TLC 029 
Rodolfo Blanco Rodriguez (University of Idaho) Unraveling multiscale stochastic disease transmission from withinhost dynamics to betweenhost spread Abstract: In this research, we employ a multiscale modeling approach to unravel the intricate dynamics of infectious disease transmission. Our study spans various scales, from withinhost viral interactions to populationlevel disease dissemination: By employing mathematical models, we explore the replication of viral particles, their impact on infected cells, and the vital role of immune responses, particularly T cells. Moving up the scale, we investigate the transmission of viruses, such as inﬂuenza, through diﬀerent respiratory organs. Zooming out, we analyze disease transmission between individuals in contact networks. Utilizing a stochastic transmission model, we determine the likelihood of infection based on viral levels and immune responses within the contagious host. The timing of host encounters emerges as a critical factor in disease spread. 
October 5, 2023 TLC 029 
Chencheng Cai (Washington State University) KoPA: Automated Kronecker Product Approximation Abstract: We propose to approximate a given matrix by the sum of a few Kronecker products of matrices, which we refer to as the Kronecker product approximation (KoPA). Comparing with the lowrank matrix approximation, KoPA also oﬀers a greater ﬂexibility, since it allows the user to choose the conﬁguration, which are the dimensions of the two smaller matrices forming the Kronecker product. On the other hand, the conﬁguration to be used is usually unknown, and needs to be determined from the data in order to achieve the optimal balance between accuracy and parsimony. We propose to use extended information criteria to select the conﬁguration. Under the paradigm of high dimensional analysis, we show that the proposed procedure is able to select the true conﬁguration with probability tending to one, under suitable conditions on the signaltonoise ratio. We demonstrate the superiority of KoPA over the low rank approximations through numerical studies, and several benchmark image examples. 
October 26, 2023 Via Zoom Only 
Michael Allen (Louisiana State University) Counting number fields generated by plane curves Abstract: Every irreducible polynomial f(x) with integer coefficients corresponds uniquely to a field extension of the rational numbers which consists Q, a root alpha of f, and all combinations thereof under the standard arithmetic operations. For example, f(x) = x^22 produces the field Q(sqrt(2)) = {a + b*sqrt(2) : a, b in Q}. If f is a polynomial in two or more variables, we can produce infinitely many such fields corresponding to solutions to f(x,y)=0. For f(x,y) = y^2x^3x1, we have solutions (1, sqrt(3)), (2, sqrt(11)), (3, sqrt(31)) and so on, and so the curve defined by f(x,y)=0 “generates” the fields Q(sqrt(3)), Q(sqrt(11)), and Q(sqrt(31)). Recently, Mazur and Rubin suggested using this algebraic information as a means to study the geometric properties of a curve. One can easily ask the reverse question: ``If we know something about a curve C, what can we say about the fields that it generates?" We approach this question through the lens of arithmetic statistics by counting the number of such fields with bounded size  under some appropriate notion of size  for an arbitrary fixed plane curve C. This is joint work with Renee Bell, Robert Lemke Oliver, Allechar Serrano Lopez, and Tian An Wong. 
November 2, 2023 TLC 029 
Daryl Robert Deford (Washington State University) Political Geometries Abstract: The problem of constructing "fair" political districts and the related problem of detecting intentional gerrymandering has received a significant amount of attention in recent years. Attempting to analyze these issues from a mathematical perspective leads to a wide variety of interesting research problems in geometry, graph theory, and probability. In this talk, I will discuss recent work centered around Markov chain sampling of districting plans that has motivated theoretical questions in these fields, including designing proposal distributions, evaluating the computational complexity of sampling, and measuring the geometric and partisan properties of districts. This work has also helped inform legislative reform efforts and appeared in court challenges, including cases in the Supreme Court this year, and I will discuss what it is like to translate math research to these applied settings and some of the related data, computational, and communication challenges. 
November 16, 2023 TLC 029 
Hazem Aboutaleb (University of Idaho) Causality Verification and Enforcement for Microelectric Package Macromodels Abstract: The design and analysis phase of passive structures of highspeed microelectronic systems require suitable macromodels that capture the relevant electromagnetic properties that affect the signal and power quality. These models are constructed from either direct measurements, or electromagnetic simulations using macromodeling techniques such as Vector Fitting. The raw data that are used for extraction of such models have the form of discrete port frequency responses and they may be contaminated by errors due to noise, inadequate calibration techniques in case of direct measurements or approximation and discretization errors in case of numerical simulations. Besides, these data are typically available over a finite frequency range as discrete sets with a limited number of samples. All this may affect the performance of the macromodeling algorithm. Often the underlying cause of such behavior is the lack of causality in given data. We study the periodic polynomial and spectral continuation methods to enforce causality. Both methods are based on KramersKronig relations, also called dispersion relations. The two methods are successfully tested on several analytic and simulated examples that represent interconnect macromodeling systems to show excellent performance of the proposed techniques. 
3:30 p.m., February 23, 2023 TLC 029 
Alex Woo (University of Idaho) Abstract: The chromatic symmetric function of a graph encodes all of its possible colorings. Richard Stanley and John Stembridge conjectured almost 30 years ago that the chromatic symmetric functions of certain graphs can be written as a positive sum of products of elementary symmetric functions. Each symmetric function can be associated to a formal linear combination of representations of the symmetric group. John Shareshian and Michelle Wachs conjectured that these chromatic symmetric functions are associated to a representation of the symmetric group on the cohomology ring of geometric objects known as Hessenberg varieties; this conjecture was proven by Patrick Brosnan and Timothy Chow and independently by Mathieu GuayPaquet. By work of Julianna Tymoczko, this cohomology ring can be represented as a vector space on sequences of polynomials satisfying certain relations; the StanleyStembridge conjecture, still unsolved, reduces to a statement that this vector space has a basis that is permuted when the sequences of polynomials are themselves permuted in a certain way. My aim in this talk will be to make the previous paragraph at least somewhat comprehensible. If I talk about any new work, it will be joint work with Erik Insko (Florida Gulf Coast University) and Martha Precup (Washington University in St. Louis). 
3:30 p.m., March 30, 2023 TLC 029 
Xiongzhi Chen (Washington State University) Geometry, Topology, Statistics and Learning Abstract: Doubtlessly, we are now in the “Data Era”. However, unconventional data types, such as shapes, social networks, phylogenetic trees and persistence diagrams, have brought new challenges that learning theory rooted in Euclidean spaces is inadequate to address. Further, the recent rise and success of machine learning techniques have pushed learning into the realm of “Big Models”. These models have complexities and deal with sample sizes that are respectively orders more complicated and larger than those of “highdimensional models”. This prompts us to rethink about the foundations of statistical learning and its implementation in practice. In this talk, I will give an overview on learning, discuss inference and predictive modelling in general, and explain the role of geometry and topology in statistical learning. 
3:30 p.m., April 27, 2023 TLC 029 
Abhishek Kaul (Washington State University) An Efficient Two Step Algorithm for High Dimensional Change Point Regression Models Without Grid Search Abstract: We propose a two step algorithm based on L1/L0 regularization for the detection and estimation of parameters of a high dimensional change point regression model and provide the corresponding rates of convergence for the change point as well as the regression parameter estimates. Importantly, the computational cost of our estimator is only 2·Lasso(n, p), where Lasso(n, p) represents the computational burden of one Lasso optimization in a model of size (n, p). In comparison, existing grid search based approaches to this problem require a computational cost of at least n · Lasso(n, p) optimizations. Additionally, the proposed method is shown to be able to consistently detect the case of ‘no change’, i.e., where no finite change point exists in the model. We then characterize the corresponding effects on the rates of convergence of the change point and regression estimates. Simulations are performed to empirically evaluate performance of the proposed estimators. The methodology is applied to community level socioeconomic data of the U.S., collected from the 1990 U.S. census and other sources. 
3:30 p.m., May 4, 2023 TLC 029 
Alejandro Anderson (University of Idaho Postdoctoral Fellow) Setcontrol theory: model predictive control and controllable statespace topologies Abstract: Model Predictive Control (MPC) is a form of control that solves online, at each sampling instant, a finite horizon optimal control problem, and only the first input of the optimal control sequence is applied to the real system. The MPC technique has the ability to cope with hard constraints on controls and states and it handles large multivariable systems. Lyapunov theory provides a theoretical framework to prove asymptotic stability of a system controlled by an MPC by employing general concepts of permanence regions of dynamical systems. The permanence regions play an important role in the controllability and stability analysis since such regions (i.e. equilibrium sets, invariant sets, limit cycles, etc.) are the only ones that can be formally stabilized by a controller. In this lecture the importance of general permanence regions on the formulation of stable control strategies such as MPC will be discussed and a methodology for computing these type of regions in the statespace will be presented. 