Events
Yeeka Yau, University of Sydney, Coxeter systems for which the Brink-Howlett automaton is minimal
SAS 4201In their celebrated 1993 paper, Brink and Howlett proved that all finitely generated Coxeter groups are automatic. In particular, they constructed a finite state automaton recognising the language of reduced words in a Coxeter group. This automaton is not minimal in general, and recently Christophe Hohlweg, Philippe Nadeau and Nathan Williams stated a conjectural criteria…
Georgy Scholten, NC State, Hyperplane Arrangements
SAS 4201The study of hyperplane arrangements begins at fundamental questions such as: how many pieces can one cut a cake into with n slices? Quickly, hyperplane arrangements generate many intricately interesting mathematical structures and connections to many seemingly unrelated topics appear. I will attempt to show how matroids offer a convenient framework to study hyperplane arrangements…
Nicolette Price, NC State, Let’s Talk IT: File Sharing
SAS 4201Nicolette Price from Mathematics IT will be leading an interactive seminar on today's best features of file sharing using cloud services. You'll have the opportunity to go hands on with her as she walks you through multiple platforms and different ways to get your files where they need to be, and to who needs access to…
Mariana Olvera-Cravioto, UNC-Chapel Hill, Queues with Synchronization
Riddick 325During this talk I will present a queuing model for database locking systems, where jobs represent user requests for simultaneous access to a set of files in a large database. While files are in use, their content can change, so to preserve consistency throughout the database files currently in use are locked, creating blocking and…
Brown Bag Lunch
SAS 4201Rossana Capuani, NC State, Mean field games with state constraints
SAS 4201This talk will address deterministic mean field games for which agents are restricted in a closed domain of R^n with smooth boundary. In this case, the existence and uniqueness of Nash equilibria cannot be deduced as for unrestricted state space because, for a large set of initial conditions, the uniqueness of solutions to the minimization…
Grant Barkley, NC State, Spectral Sequences Working Seminar part 5
Computing Tor with spectral sequences.
Sharon Lubkin and Cynthia Vinzant
SAS 4201Jason Elsinger, Florida Southern College, On the irreducible characters and representations of orbifold lattice vertex algebras
Given a positive-definite even lattice Q, one can construct a lattice vertex algebra V. An important problem in vertex algebra theory and conformal field theory is to classify the representations of the subalgebra of fixed points, known as an orbifold, corresponding to an isometry of the underlying lattice. Once the representations are known, one can calculate their characters to further…
Benjamin Hollering, NC State, The Monomial Model and Limits of Trees
In this talk I'll introduce a new random tree model that associates a family of probability distributions on binary trees to each binary tree shape. We'll then use this new model, convex geometry, and the combinatorics of multisets and trees to obtain a finite form of a deFinetti-type theorem for rooted binary trees. This talk…
Pedro Aceves Sanchez, NC State, Fractional diffusion limit of a linear kinetic transport equation in a bounded domain
SAS 4201In recent years, the study of evolution equations featuring a fractional Laplacian has received much attention due to the fact that they have been successfully applied into the modelling of a wide variety of phenomena, ranging from biology, physics to finance. The stochastic process behind fractional operators is linked, in the whole space, to an…
Jai Aslam and Ezra Nance, NC State, Spectral Sequences Working Seminar
Knot homology theories
Heekyoung Hahn , Duke, The Ramanujan congruences for partitions
SAS 2102The remarkable Ramanujan’s congruences for the partition function p(n) will be presented. Here is Ramanujan’s own account: “I have proved a number of arithmetic properties of p(n)...in particular that p(5n+4)≡0 (mod 5), p(7n+5)≡0 (mod 7). ... I have since found another method which enables me to prove all of theses properties and a variety of…
Kaska Adoteye, Microsoft, Online Controlled Experiments, Learning From Running A/B/n Tests At Scale
SAS 1216How much is an idea really worth? What defines success for a product? How can we quantify "better" or “worse”? At Microsoft we have tens of thousands of engineers and data scientists trying to improve products that touch over a billion people worldwide. The data scale is enormous, and we're trying to learn from that…
Casey Dietrich, NC State, Forecasting and Mapping of Coastal Flooding during Hurricanes
SAS 4201When a hurricane threatens North Carolina, researchers use computational models to predict how the ocean waters will rise, and what areas will be flooded. Emergency managers rely on fast and accurate storm surge predictions from these models to make decisions and estimate damages during storm events. These models use unstructured, finite-element meshes to describe the…
14th Annual Graduate Student Research Symposium
McKimmon Center, Raleigh NCThe the 14th Annual NC State University Graduate Student Research Symposium will be held in the Jane S. McKimmon Center on Wednesday, March 20, 2019. The poster session will be from 1:30pm to 4:00pm. This year, there will be over 200 poster presentations representing research being conducted in 70 graduate programs from all colleges. …