![\"\"](\"https:\/\/www.marshall.edu\/math\/files\/mbnk.jpg\")
<\/a>\n\n<\/div>\n<\/div>\n\nDr. Martin Bohner<\/strong> “Time Scales”<\/strong> Time scales have been introduced in order to unify continuous and discrete analysis and in order to extend those theories to cases \u201cin between\u201d. <\/p>\n “The Beverton-Holt Equation”<\/strong> In this talk, we will present the Beverton\u2013Holt equation as used in fisheries and other population models, in many different scenarios (discrete case, continuous case, time scales case, quantum case, periodic case, with and without harvesting etc.).<\/p>\n <\/p>\n Dr. Sebastian Cioaba<\/strong> “A brief tour of spectral graph theory”<\/strong> Abstract: Spectral graph theory is the study of eigenvalues of graphs and their connections to the combinatorial properties of the graphs. In this talk, I will present some of my favorite results in spectral graphs involving graph decomposition and addressing, strongly regular graphs, expanders and spectral characterization of graphs. The talk should be accessible to a broad audience and I will present several open problems.<\/p>\n “Optimal distortion embeddings of graphs into Euclidean spaces”<\/strong> Abstract: Embedding graphs into Euclidean spaces with least distortion is a topic well-studied in mathematics and computer science. Informally, this problem deals with representing a graph by points in an Euclidean space such that the distances between the vertices of the graph are not too \u201cdistorted\u201d (\u201cexpanded\u201d or \u201ccontracted\u201d, I will explain this formally in the talk) from the distances between their corresponding points in the Euclidean space. Dr. Isaac Harris<\/strong> “Inverse Problems: Theory and Practice”<\/strong> In this talk, we will discuss the concept of an inverse problem and its applications. In particular, we will focus on inverse problems arising from partial differential equations. “Transmission Eigenvalue Problems for a Scatterer with a Conductive Boundary”<\/strong> Abstract: In this talk, we will investigate the acoustic transmission eigenvalue problem associated with an inhomogeneous media with a conductive boundary. These are a new class of eigenvalue problems that are not elliptic, not self-adjoint, and non-linear, which gives the possibility of complex eigenvalues. The talk will consider the case of an Isotropic and Anisotropic scatterer. We will discuss the existence of the eigenvalues as well as their dependence on the material parameters. Because this is a non-standard eigenvalue problem, a discussion of the numerical calculations will also be highlighted. This is joint work with: O. Bondarenko, V. Hughes, A. Kleefeld, and J. Sun.<\/p>\n\n<\/div>\n Dr. James Brennan<\/strong> “In Search of Infinity”<\/strong> Abstract: \u201c The infinite! No other question\u201d declared David Hilbert \u201c has ever moved so profoundly “The\u00a0 Property of Unique Continuation in Certain Spaces Spanned by Rational Functions on Compact Nowhere Dense Sets”<\/strong> Abstract: It has been known for over a century that certain large classes of functions defined on a <\/p>\n “An Overview of Big Data and Data Science”<\/strong> Abstract: During the recent years, the term \u201cData Science\u201d has become a magic term for companies trying to find insights from a vast amount of data in the modern competitive business. The term was first referenced in the Proceedings of 5th Conference of the International Federation of Classification Society in 1996. However, the core idea of data science was promoted by Tukey in early 1970\u2019s, when he attempted to distinguish between theoretical vs. empirical evidence. The journey of data science as an area of study is evolving and growing due to the advancement of technology and the rapid growth of data in volume, variety and velocity. Although data science has become extremely popular, the definition of data science as a discipline is different for researchers in different disciplines. In this presentation, I will first briefly present the history of data science and Big Data, present some unique features of data science and discuss strategy for initiating and conducting a \u201cdata science\u201d project, and present some examples of data science projects.<\/p>\n “A framework for developing generalized asymmetric distributions and regression models “<\/strong> Abstract: During the recent decade, there have been an active research in developing new and more flexible statistical distributions with more parameters for the purpose of fitting more complicated real world phenomena. A huge number of new distributions were developed using the T-R{Y} framework. One critical criticism is that many of these new distributions with many parameters may not be practically useful. Although they can fit broader types of data, these parameters often do not have meaningful interpretations. Practically useful distributions often have three parameters (location, scale and shape parameters). However, such three-parameter distributions often are limited to fit a wide range of skewed data. In this talk, a brief review of methods for developing three-parameter asymmetric distributions will be reviewed. A framework will be proposed to derive three-parameter generalized asymmetric distributions that are capable of fitting a wide range of skewed (left and right) data. Some special cases will be discussed and compared with other more complex distributions. Generalized regression models with response following generalized asymmetric distributions will be discussed. A generalized asymmetric logistic regression model will be presented and applied to model finance and failure time data.<\/p>\n\n<\/div>\n <\/p>\n “Macdonald Polynomials: thinking abstractly”<\/strong> Abstract: The Macdonald polynomials are a beautiful example the advantages and disadvantages of abstract mathematics. This basis for symmetric polynomials was first defined indirectly, making them difficult to compute or use for calculations. At the same time, once constructed, the Macdonald polynomials encode a wealth of disparate information, from the number of ways to place n books on a shelf, to interactions between n particles, to efficient ways to compute matrix statistics regularly used for wireless communications. We\u2019ll discuss why Macdonald polynomials are useful, what they \u201clook\u201d like, and what we do and don\u2019t know about how to compute with them.<\/p>\n “Applying Representation Theory to Random Walks”<\/strong> Abstract: We’ll talk about why representation theory is useful, by focusing on a particular case: using representation theory to analyze random walks on groups. We’ll also discuss some of the difficulties in this approach, here focusing on joint work with Daniel Bump, Persi Diaconis, Laurent Miclo, and Harold Widom studying a simple random walk on the the Heisenberg group mod p (a particularly simple to describe noncommutative group). Analysis of a random walk on the group dates back to Zach, who was considering the effectiveness of certain random number generators. We’ll assume knowledge of matrices and basic linear algebra, but otherwise aim for an elementary talk.<\/p>\n\n<\/div>\n \u201cZombifying Mathematics and Humanizing Mathematics\u201d<\/strong> Abstract: In this talk, I will discuss work intended to engage a broader mathematics audiences. In the first talk, I examine the role of experiential engagement in mathematics. Instead of modeling zombies in pop culture, what happens when the zombies invade campus? In the second half of the talk, I pivot to what it means to humanize mathematics, through a narrative project called “math mamas”. I introduce ethnography and duoethography as ways to explore identity and reclaim narratives about who is doing mathematics.<\/p>\n \u201cNetworks: Ecology, Facebook, and Interdisciplinary Teaching\u201d<\/strong> Abstract: Plants and pollinators share something interesting with websites and users — they can both be described as a bipartite, mutualistic network. I discuss how the way these networks form and evolve over time, and how that gives us insight into the structure we see, and the management decisions that we make. I also consider how we could use this understanding to advance interdisciplinary education research.<\/p>\n\n<\/div>\n \u201cMeasuring Similarity with Games\u201d<\/strong> Abstract: How similar are the Lithuanian and Bulgarian flags? Is the Bulgarian more or less similar to the Hungarian flag? What about the Russian and Austrian and Dutch flags? Is there an objective way to measure the similarity between these patterns?<\/p>\n We will talk about a way of measuring similarity using Ehrenfeucht–Fra\u00efss\u00e9 (EF) games, which have been used in logic and model theory to distinguish mathematical theories and their associated structures. We will see how EF games can be used to measure the similarity between two flags as well as more practical everyday patterns like bar codes.<\/p>\n This research is joint work with a wonderful team of undergraduate students spanning over a decade: Steve Gubkin, Tom Kern, Alice Kittredge, Daniel McDonald, Patrick Mullins, Sam Pettorini, Manuel Rivera, Mike Solomon, and Chrissy Zlogar.<\/p>\n \u201cFormal Methods in Undergraduate Mathematics\u201d<\/strong> Abstract: Recent years have seen major developments in computer assisted formal methods in mathematics. Proof assistants such as Agda, Coq, Isabelle, Lean, HOL Light, Mizar are becoming more and more accessible for everyday use, even by mathematicians with little to no computer science background. These advances are opening new doors for integrating such tools in mathematics research as well as mathematics education.<\/p>\n I will discuss an ongoing project where a team of mathematics students at the University of Vermont are building a library of theorems from their mathematics courses for the Lean proof assistant. After just a few months of work, our team has already formalized more than half of a standard course in linear algebra. Through demonstration, we will see how theorem proving in Lean works and what kind of work is involved in such a project. Time permitting, I will also discuss ideas on integrating proof assistants in the classroom.<\/p>\n This research is joint work with Vanessa Myhaver, Anne Marie Stupinski, and Helene Thomas.<\/p>\n\n<\/div>\n <\/p>\n \u201cGlobal Warming and Statistical Application\u201d<\/strong> Abstract: A majority of scientists and others now agree that the earth\u2019s climate is warming, as indicated by a rise in the average surface temperature of the earth. One of the assessment reports of the Intergovernmental Panel on Climate Change defines climate change as a change in the state of the climate that can be identified through statistical tests. This talk will outline some of the causes of global warming, effects of climate change and combating the effects of global warming. Application of statistics to global warming will be mentioned.<\/p>\n \u201cRecent developments in statistical distributions\u201d<\/strong> Abstract: This talk will cover how the \u03b2-generated family of distributions evolved into the T-R{Y} framework. A new method is proposed for generating discrete distributions. A special class is the generalized geometric family of distributions that contains the discrete analogues of continuous distributions. A member of the family, the exponentiated exponential-geometric distribution is defined and studied. A regression model, based on the distribution, is defined. If time permits, the usefulness of the regression model is illustrated with an application.<\/p>\n\n<\/div>\n <\/p>\n \u201cProblems, Problems, Problems\u201d<\/strong> Here is a problem just about everyone has seen in a math class at some point: Given a function, find its range. For example, if we are given the function f\u2009<\/span>(x<\/span>) = x<\/span>\u20092<\/sup>, defined for x<\/span> = 0, 1, 2, 3, 4, \u2026, we know that its range is 02<\/sup> = 0, 12<\/sup> = 1, 22<\/sup> = 4, 32<\/sup> = 9, 42<\/sup> = 16, etc. Easy enough, it seems. Here is another problem just about everyone has faced: Your computer is showing you the dreaded spinning beach ball, and you forgot to save the document you have been working on\u2014do you try to wait it out, or reboot now and start over? That seems like a much harder task\u2026 But surprisingly, these two problems\u2014the range problem, and the spinning beach ball problem\u2014are actually one and the same, in a certain precise sense. I will explain why this is the case, and mention other related problems, some more familiar than others. Some of the key insights here go back to Turing, and the advent of modern computing, which I will discuss along the way.<\/p>\n \u201cMathematics, Backwards and Forwards\u201d<\/strong> Abstract: Mathematics today benefits from having “firm foundations”, by which we usually mean a system of axioms sufficient to prove the theorems we care about. But given a particular theorem, can we specify precisely which axioms are needed to derive it? This is a natural question, and also an ancient one: over 2000 years ago, the Greek mathematicians were asking it about Euclid’s geometry. Reverse mathematics is a program in mathematical logic that provides a modern approach to this kind of question. A striking fact repeatedly demonstrated in this research is that the vast majority of mathematical propositions can be classified into just five main types, according to which axioms are needed to carry out their proofs. I will discuss these five categories, and what they reveal about relationships between different areas of mathematics. I will also mention a few notable examples of theorems that do not fit inside these five categories.<\/p>\n\n<\/div>\n <\/p>\n \u201cMathematical Magic\u201d<\/strong> We will demonstrate a few \u201cmagic\u201d tricks, all based upon mathematics. We will reveal the tricks including the mathematics behind them. Among other topics this will include parity, recursions and Hall’s Marriage Theorem.<\/p>\n \u201cCounting Permutations with Calculus\u201d<\/strong> A permutation \u03c0 = \u03c01<\/sub> \u03c02<\/sub> … \u03c0n<\/sub> is a list of the elements 1 through n in some order. A permutation is alternating if the elements zig-zag, that is, \u03c01<\/sub>< \u03c02<\/sub> > \u03c03<\/sub> < … . We prove a classic formula for the number of alternating permutations using the interplay of geometry and calculus. Using the same techniques we also study the number permutations with no double ascents, that is, there is no index i such that \u03c0i<\/sub> < \u03c0i+1<\/sub> < \u03c0i+2<\/sub>. Unfortunately, this last case becomes messy and leads to open questions where else these techniques can be applied.<\/p>\n\n<\/div>\n <\/p>\n <\/p>\n \u201cIntroduction to Genetic Epidemiology in GWAS era\u201d<\/strong> Genetic epidemiology holds great potential for personalized medicine and improved biological knowledge of disease pathogenesis. In this talk, I will introduce some basic concepts needed to understand, analyze, and interpret Genome-wide Association Studies (GWAS) data with late-onset Alzheimer\u2019s disease (LOAD) as an example. I will briefly talk about extending these results to gene-wide and network\/pathway-based analysis, which are complementary to GWASs.<\/p>\n \u201cGenetic analyses of late-onset Alzheimer\u2019s Disease\u201d<\/strong> Alzheimer\u2019s disease is the most common form of dementia. Genetics of late-onset Alzheimer\u2019s disease (LOAD) is very complex. Genome-wide Association Studies (GWAS) are an important first step. Gene-based and network\/pathways based analyses also contribute to the understanding of genetic determinants of LOAD. Thus, a three-component approach — GWAS, gene-based, and network-based analyses — is likely to best illuminate genetic determinants of a disease. I will explore the three component approach in this talk.<\/p>\n\n<\/div>\n <\/p>\n <\/p>\n \u201cRook Theory 101\u201d<\/strong> Combinatorics is the mathematical theory of counting. In this talk, we introduce combinatorics through the subject of rook theory — which has nothing to do with chess! The first goal of rook theory is to count configurations of rooks on generalized chessboards so that no two rooks attack each other. The k’th rook number of a board counts the number of such ways to place k rooks on the board. It often happens that two different boards share the same rook numbers. This talk investigates when and why this occurs by using geometric and algebraic manipulations of boards and rook placements. We present theorems of Foata\/Schutzenberger and Goldman\/Joichi\/White characterizing rook-equivalent boards in various ways. The techniques used illustrate three branches of modern combinatorics — enumerative combinatorics, bijective combinatorics, and algebraic combinatorics. No prior knowledge of counting (or chess) is required for this talk.<\/p>\n \u201cSweep Maps and Bounce paths\u201d<\/strong> Mathematics is filled with open (unsolved) problems, ranging from deep foundational issues of physics, computation, geometry, and number theory to highly specialized research questions. This talk describes an open problem in algebraic combinatorics that can be stated and investigated with virtually no mathematical background, although the problem appears to be fiendishly challenging to solve. We define a family of maps on words, called “sweep maps.” A sweep map assigns a level to each letter in a word according to a simple rule, then sorts the letters according to their level. Surprisingly, although sweep maps act by sorting, they appear to be invertible: i.e., different input words are always sent to different output words by any given sweep map. The open problem is to prove the invertibility of all sweep maps, preferably by explicitly describing the inverse functions. We explain some known special cases of this problem using a model in which words are visualized using lattice paths. In some cases, we can pass from a lattice path to an associated “bounce path,” which provides the additional data needed to invert the sweep map. These bounce paths originally arose in the study of objects called q,t-Catalan polynomials. Many algorithms that have appeared in the q,t-Catalan literature over the last 20 years turn out to be particular instances of the sweep maps or their inverses. The sweep maps thus provide a simple unifying framework for understanding all of these algorithms.<\/p>\n\n<\/div>\n <\/p>\n <\/p>\n \u201cModeling the host response to inhalation anthrax to uncover the mechanisms driving risk of disease\u201d<\/strong> Bacillus anthracis<\/em>, the causative agent of anthrax, can exist in the form of highly robust spores, making it a potential bio-terror threat. Once inhaled, the spores can germinate into vegetative bacteria capable of quick replication, leading to progressive disease and death. There is a critical need to better quantify the risk of disease from different inhalation exposure scenarios. Key to this effort is the use of mathematical and computational modeling to uncover the mechanisms driving risk. To this end, this presentation will discuss ongoing work on the development of models and methods that explore the host response to inhalation anthrax and provide insight into the mechanisms that drive the risk of disease. This is joint work is joint University of Tennessee graduate student Buddhi Pantha, and the NIMBioS Working Group on Modeling Anthrax Exposure.<\/p>\n \u201cDetermining the what, when, and how of therapeutic intervention strategies for controlling complex immune responses\u201d<\/strong> Ideally, when challenged with a bacterial insult, a host orchestrates an immune response that, not only eliminates the offending pathogen, but also restores the host to homeostasis. However, due to the complex nature of the response, this is not always possible, especially in critically ill patients. Clearly, intervention is needed; however, determining the types of intervention that should be given, when they should be given, and in what amount remains a challenge. Computational modeling and control methodologies can provide fresh insight into this challenging biomedical problem and potentially offer techniques to answer these difficult questions. This talk will discuss computational control methodologies that are being explored to determine the what, when, and how of therapeutic intervention strategies for controlling complex immune responses.<\/p>\n\n<\/div>\n <\/p>\n <\/p>\n \u201cThe Gale-Berlekamp Light-Switching Problem and a Permutation Variation\u201d<\/strong> Consider an n<\/em> by n<\/em> array of light bulbs each controlled by a switch. Suppose there are also 2n<\/em> other switches which allow one to simultaneously switch all the light bulbs in a row or all the light bulbs in a column. Now use the individual switches and turn some of the light bulbs on. With the row and column switches only, can one get all the lights in the off position? If not, how few on-lights are possible? This problem, its connections to coding theory, and a permutation variation is the subject of this talk.<\/p>\n \u201cAll Things Bruhat: Matrix Bruhat Decomposition,Complete Flags, Bruhat Order of Permutations, (0,1) and Integral Matrices, and Tournaments\u201d<\/strong> The title is a bit of an exaggeration, but we will discuss the topics it contains and various connections between them.<\/p>\n\n<\/div>\n <\/p>\n
\nProfessor of Mathematics
\nMissouri University of Science & Technology
\nJanuary 23 – 24, 2025\n<\/p><\/div>\n<\/div>\n\n\n<\/div>\n\n
\nThursday, January 23, 2025 \u2022 Smith 621 \u2022 1:00pm \u2022 PDF<\/a><\/p>\n
\nWe will offer a brief introduction into the calculus involved, including the so-called delta derivative of a function on a time scale. This delta
\nderivative is equal to the usual derivative if the time scale is the set of all real numbers, and it is equal to the usual forward difference operator if
\nthe time scale is the set of all integers. However, in general, a time scale may be any closed subset of the reals. We present some basic facts concerning dynamic equations on time scales (those are differential and difference equations, resp., in the above two mentioned cases) and initial value problems involving them. We introduce the exponential function on a general time scale and use it to solve initial value problems involving first-order linear dynamic equation. We also present a unification of the Laplace and Z-transform, which serves
\nto solve any higher-order linear dynamic equations with constant coefficients. Throughout, we discuss some recent developments and applications of time scales theory to biology, economics, and finance.<\/p>\n
\nFriday, January 24, 2025 \u2022 Smith 518 \u2022 1:00pm \u2022 PDF<\/a><\/p>\n
\nFall 2024 \u2013 ARI Mathematics Speaker<\/h2>\n
<\/a>\n\n<\/div>\n<\/div>\n\n
\nProfessor of Mathematics
\nUniversity of Delaware
\nNovember 4 & 5, 2024\n<\/p><\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, November 4, 2024 \u2022 Smith 154 \u2022 1:00pm \u2022 PDF<\/a><\/p>\n
\n
\nTuesday, November 5, 2024 \u2022 Smith Hall 516 \u2022 1:00pm \u2022 PDF<\/a><\/p>\n
\nDespite a lot of research, there are just a few graphs for which the precise least distortion and a least distortion embedding is known. In 2008, Vallentin studied this problem for distance-regular graphs and obtained a lower bound for the least distortion of a distance-regular graph. In addition, he showed that this bound is tight for Hamming and Johnson graphs as well as strongly regular graphs and conjectured that his bound is always tight for distance-regular graphs. In this talk, I will describe our current progress on this problem This is joint work with Himanshu Gupta (University of Delaware) and Ferdinand Ihringer (Ghent University, Belgium) and Hirotake Kurihara (Yamaguchi University, Japan).<\/p>\n\n<\/div>\nFall 2023 \u2013 ARI Mathematics Speaker<\/h2>\n
<\/a>\n\n<\/div>\n<\/div>\n\n
\nProfessor of Mathematics
\nPurdue University
\nNovember 9 & 10, 2023\n<\/p><\/div>\n<\/div>\n\n\n<\/div>\n\n
\nThursday, November 9, 2023 \u2022 Smith 154 \u2022 4:00pm \u2022 PDF<\/a><\/p>\n
\nThese problems are to determine information about the mathematical model provided that one has measured values of the solution. The applications span the areas of medical imaging, non destructive testing, cosmology, and geophysics. We will discuss how one can solve inverse shape problems using qualitative (i.e. non-iterative) methods. These methods require little a priori information and are computationally simple to implement when one collects enough data.<\/p>\n
\n
\nFriday, November 10, 2023 \u2022 Smith Hall 518 \u2022 4:00pm \u2022 PDF<\/a><\/p>\nFall 2022 \u2013 ARI Mathematics Speaker<\/h2>\n
<\/a>\n\n<\/div>\n<\/div>\n\n
\nProfessor of Mathematics
\nUniversity of Kentucky
\nOctober 24 & 25, 2022\n<\/p><\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, October 24, 2022 \u2022 Science 376 \u2022 4:00pm \u2022 PDF<\/a><\/p>\n
\nthe spirit of man.\u201d Without assuming any specialized knowledge of the audience, it is my
\ngoal to lay the foundation for a deeper understanding of Hilbert\u2019s remark by engaging in a
\nconversation around some of the paradoxes associated with the concept of infinity. The most
\nfamous are perhaps Zeno\u2019s paradoxes of motion, and they are still being debated today. On
\nthe other hand, one of the works in the Aristotelian corpus, known as Mechanica, contains a
\nproblem which attracted wide attention at an earlier time, but is now hardly mentioned.
\nThat is the problem of Aristotle\u2019s Wheel, which is exemplified in something as ordinary
\nas a common rolling pin. Nevertheless, more than two millennia after its inception the
\nproblem surrounding the Wheel played a central role in Galileo\u2019s greatest work: Dialogues
\nConcerning Two New Sciences, published in 1638. The occasion in the Dialogues prompting
\na discussion of the Wheel is a question as important as the ultimate constitution of matter.
\nAfter examining a few seemingly paradoxical ideas, and noting their impact in the long
\nhistory of thought, I hope that by evening\u2019s end you can with William Blake begin
\nto see a World in a Grain of Sand<\/em>
\nand a Heaven in a Wild Flower,<\/em>
\nHold Infinity in the Palm of your Hand<\/em>
\nand Eternity in an Hour<\/em>.<\/p>\n
\n
\nTuesday, October 25, 2022 \u2022 Smith Hall 511 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\ncompact nowhere dense subset X of the complex plane, and obtained as limits of analytic
\nfunctions in various metrics, can sometimes inherit the property of unique continuation
\ncharacteristic of the approximating family. The first example of the transfer of the uniqueness
\nproperty in this way to R(X), the space of functions that can be uniformly approximated
\non X by a sequence of rational functions whose poles lie outside of X, was obtained by M.
\nV. Keldysh around 1940, but apparently never published. Years later in 1975 A. A. Gonchar
\nexhibited a qualitatively definitive improvement of Keldysh\u2019s example. My goal here is to
\npresent a survey of the early results on the uniqueness question, beginning with its origin at
\nEmile Borel\u2019s thesis defense of 1894, concluding with a brief summary of its impact on the
\ngeneral theory of approximation by analytic functions.<\/p>\n\n<\/div>\nSpring 2020 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nDepartment of Mathematics
\nCentral Michigan University
\nMarch 2 & 3, 2020\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, March 2, 2020 \u2022 Corbly Hall 117 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nTuesday, March 3, 2020 \u2022 Smith Hall 514 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nFall 2019 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nMathematics Department
\nLehigh University
\nNovember 6 & 7, 2019\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nWednesday, November 6, 2019 \u2022 Corbly Hall 104 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nThursday, November 7, 2019 \u2022 Smith Hall 530 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nSpring 2019 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nDepartment of Digital and Computational Studies
\nBates College
\nFebruary 18 & 19, 2019\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, February 18, 2019 \u2022 Corbly Hall 105 \u2022 4:00pm \u2022 PDF Flyer <\/a><\/p>\n
\n
\nTuesday, February 19, 2019 \u2022 Smith Hall 529 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nFall 2018 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nDepartment of Mathematics
\nUniversity of Vermont
\nOctober 29 & 30, 2018\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, October 29, 2018 \u2022 Corbly Hall 105 \u2022 4:00pm \u2022 PDF Flyer\u00a0<\/a><\/p>\n<\/p>\n
\n
\nTuesday, October 30, 2018 \u2022 Smith Hall 516 \u2022 3:30pm \u2022 PDF Flyer<\/a><\/p>\nFall 2017 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nProfessor of Mathematics
\nCentral Michigan University\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nWednesday, November 1, 2017 \u2022 Smith Hall 154 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nThursday, November 2, 2017 \u2022 Smith Hall 530 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nSpring 2017 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nAssistant Professor of Mathematics
\nUniversity of Connecticut\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, April 10, 2016 \u2022 Corbly Hall 105 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nTuesday, April 11, 2016 \u2022 Smith Hall 530 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nFall 2016 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nProfessor of Mathematics
\nUniversity of Kentucky\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, October 10, 2016 \u2022 Corbly Hall 104 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nTuesday, October 11, 2016 \u2022 Smith Hall 516 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nSpring 2016 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nResearch Assistant Professor of Mathematics
\nDivision of General Internal Medicine,
\nDepartment of Medicine, University of Washington\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, March 7, 2016 \u2022 Science Building 376 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nTuesday, March 8, 2016 \u2022 Smith Hall 529 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nFall 2015 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nAssociate Professor of Mathematics
\nVirginia Tech\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nMonday, September 28, 2015 \u2022 Location TBA \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nTuesday, September 29, 2015 \u2022 Location TBA \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nSpring 2015 \u2013ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nAssistant Professor of Mathematics
\nUniversity of Tennessee\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nTuesday, April 14, 2015 \u2022 Science Building 276 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nWednesday, April 15, 2015 \u2022 376 Science Building \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nFall 2014 \u2013 ARI Mathematics Speaker<\/h2>\n
\n<\/div>\n<\/div>\n\n
\nUWF Beckwith Bascom Professor of Mathematics (Emeritus)
\nUniversity of Wisconsin \u2013 Madison\n<\/div>\n<\/div>\n\n\n<\/div>\n\n
\nWednesday, November 5, 2014 \u2022 Smith Hall 154 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\n
\n
\nThursday, November 6, 2014 \u2022 Science Building 375 \u2022 4:00pm \u2022 PDF Flyer<\/a><\/p>\nSpring 2014 \u2013 ARI Mathematics Speaker<\/h2>\n