As part of the R.W. Yeagy Colloquium Series, on Monday September 25th, Dr. Katie Anders from the University of Texas at Tyler will be giving a talk titled “Rooted Forests That Avoid Sets of Permutations” in room 357 of the Mathematics Building at 3:30 PM.
Abstract: An unordered rooted labeled forest avoids the pattern if the sequence obtained from the labels along the path from the root to any vertex does not contain a subsequence that is in the same relative order as . We enumerate several classes of forests that avoid certain sets of permutations, including the set of unimodal forests, via bijections with set partitions with certain properties. (flyer in PDF form)
On Monday September 11th at 4 PM in Math 357, Dr. Matt Beauregard will be doing a presentation on using the Remind App. Interested faculty across the university are encouraged to attend.
“Remind – A Useful Approach to Increase Student Communication”
Abstract: Would you like instant communication with your entire class? Would you like to better manage your planning time by creating regular announcements four your class? Are you tired of unread emails and handouts? If so, let me briefly go over a program called Remind that may revolutionize the way you communicate with your students outside of class. Remind is an easy to use and free program that utilizes texting while maintaining phone privacy. Join us, as we discover Remind’s basic functionality and how to utilize this to save planning time, organize your class, and improve our communication with students.
On Monday, May 1, at 3:30 pm in Math Building 357, Dylan Jager-Kujawa will be giving a presentation on computer aided proofs titled Automated Propositional Logic Proofs using Gentzen Deduction Trees as part of an Honors Project. This talk is open to all faculty and students.
Abstract: In the mid 1930s, Gerhard Gentzen devised an algorithm to prove propositional logic theorems. Gentzen’s method is similar to previous algorithms, in that it attempts to search for counterexamples to disprove a theorem, however it differs in that it breaks propositions into a number of sequents, each containing assumptions and conclusions.
While this results in a somewhat more intuitive proof, it has the added benefit of being very well suited to implementation by a computer. The use of trees, as well as a well-defined set of permitted operations, makes implementation of this algorithm far more natural than those of Gentzen’s peers. (Flyer in PDF form)
As part of the R. W. Yeagy Colloquium Series, Wednesday, April 26 at 3:00 PM in Math Building 357, Dr. Jacob Turner will be speaking about “Going With the Flow: Statistical Considerations in Cell Composition Analysis.”
Abstract: Flow cytometry (FCM) is a single cell technology that is routinely applied to quantify and evaluate cell populations present in biological samples. In a typical FCM study, thousands of cells are used to determine the proportion of important cell subpopulations and the difference in the proportions between diseased groups or drug treatments is often hypothesized. The process of identifying cell populations has been rigorously explored; however, the statistical analysis of data derived from these processes has not received much attention. This presentation will introduce the general process of an FCM experiment, illustrate some of the distributional properties exhibited by FCM derived data, and summarize an alternative modeling and testing procedure. (flyer in PDF form)
As part of the R.W. Yeagy Colloquium Series, Dr. David Lax will be speaking at 1:30pm on Friday, April 7 in Math Building 357 on An Order Filter Model for the Algebraic Relations Defining the Grassmannian and its Cousins.
Abstract: The Grassmann manifolds consist of planes in a vector space and have coordinates given by determinants. These coordinates are naturally partially ordered, and the relations among the coordinates are straightening laws–meaning they respect this order. For any of the Grassmann manifolds’ cousins, the ‘minuscule flag manifolds,’ we present a model for its coordinates that uses colored partially ordered sets and some straightening laws shared by these coordinates.
On Thursday March 9th at 2 PM in Math Building 357, Ryan Jensen from the University of Tennessee will be talking about “Topological Data Analysis”.
Abstract: What is the shape of the following collection of data points (original image from Persistence Theory: From Quiver Representations to Data Analysis by Steve Y. Oudot)?
It depends on the “scale” from which the points are viewed. From a very small scale, all that is visible is a point; from a larger scale, there are multiple “B’s”; at an even larger scale, an “A” appears; finally, when viewed from a great distance, there is nothing but a blob.
In this talk we will give an introduction (accessible to undergraduates) to persistent homology, which is a tool from algebraic topology used to study the shape (homology) of data and through which scales that shape persists. We will look at the persistent homology of the above example as well as real life examples, including the shape of protein distribution in medicated cells. Finally, we will briefly discuss new results from large scale geometry which could be useful in determining other persistent properties of a data set.