Skip to main content

Events

Kirk Main, Let’s Talk IT: HPC Cluster

The High Powered Computing Cluster is a great resource available to all Mathematics staff, faculty, and graduate students. Unfortunately, it is underutilized due to the fairly technical use standards. In this presentation I will go over the basics, answer questions, and give examples on how to use this HPC resource effectively, and easily. Please join…

Undergrads Union Grads Meeting

The UUG program provides free mentoring for undergraduates in the math program here at NC State. We will hold several seminars and panels throughout the semester on subjects such as applying to REUs and applying to graduate schools. We also pair undergrads with graduate student mentors for individual mentoring on classes, research, and other things mathematical.…

Cynthia Vinzant, NC State, Solving Cubics with Paper and Turtles

SAS 2102

What is the mathematics behind origami? What can be achieved by just folding paper? We'll talk about the beautiful geometry underlying these questions and more, including a classical algorithm for solving polynomials with a turtle and more modern algorithm for solving cubic polynomials with a piece of paper. No background will be assumed and this…

Applying for Graduate Research Fellowships

Speaker:  Seth Sullivant This presentation will explain the ins and outs of applying for graduate research fellowships, with special emphasis on the NSF graduate research fellowship.

Corey Jones, Ohio State University, Vanishing of categorical obstructions for permutation orbifolds

Modular tensor categories are rich mathematical structures. They are important in the study of 2D conformal field theory, arising as categories of modules for rational vertex operator algebras. The orbifold construction A-> A^{G}  for a finite group G is a fundamental method for producing new theories from old. In the case the orbifold theory is also rational, the construction of…

Sherry Gong, UCLA, On the Kronheimer-Mrowka concordance invariant

We will talk about Kronheimer and Mrowka’s knot concordance invariant, $s^\sharp$. We compute the invariant for various knots. Our computations reveal some unexpected phenomena, including that $s^\sharp$ differs from Rasmussen's invariant $s$, and that it is not additive under connected sums. We also generalize the definition of $s^\sharp$ to links by giving a new characterization…

Kazufumi Ito, NC State, Optimal control of sate constrained PDEs system with Spars controls

In this talk we discuss a point-wise state constraint problem for a general class of PDEs optimal control problems and sparsity optimization. We use the penalty formulation and derive the necessary optimality condition based on the Lagrange multiplier theory.The existence of Lagrange multiplier associated with  the point-wise state constraint as a measure is established. Also we…

Mette Olufsen, NC State, How mathematical techniques can be used to better understand cardiovascular dynamics in health and disease

SAS 2102

Dating back to the 1600s modeling has been used to study cardiovascular dynamics enabling scientist to answer essential questions. In fact, todays knowledge that the cardiovascular system is circulating was first discovered via a mathematical model. In this talk I will discuss the role mathematical analysis has played in cardiovascular physiology and how we use…

Yulong Lu, Duke University, Understanding and accelerating statistical sampling algorithms: a PDE perspective

A fundamental problem in Bayesian inference and statistical machine learning is to efficiently sample from probability distributions. Standard Markov chain Monte Carlo methods could be prohibitively expensive due to various complexities of the target distribution, such as multimodality, high dimensionality, large datesets, etc. To improve the sampling efficiency, several new interesting ideas/methods have recently been proposed in the community…

Ricky Liu, NC State, RSKy Business

SAS 2102

The Robinson-Schensted-Knuth (RSK) correspondence is an important combinatorial bijection that associates to any permutation a pair of objects called standard Young tableaux. We will describe this correspondence in detail and discuss some interesting connections to combinatorics, algebra, and geometry. This talk will assume no background and will be accessible to all undergraduates.

Pratik Misra, NC State, Bounds on the expected size of the maximum agreement subtree

Rooted binary trees are used in evolutionary biology to represent the evolution of a set of species where the leaves denote the existing species and the internal nodes denote the unknown ancestors. Maximum agreement subtree is used as a measure of discrepancy between two trees. In this talk, I will define the notion of "maximum…

Jean-Pierre Fouque, University of California Santa Barbara, Stochastic Games with Delay: a Toy Model

Park Shops 200

Motivated by modeling borrowing and lending between banks, we start by illustrating systemic risk with a toy model of diffusions processes coupled through their drifts. We then show that such a simplistic model is in fact a Nash equilibrium of a Linear-Quadratic differential game. In order to take into account clearing debt obligations a delay…

Meet the Staff

All of the math department staff relevant for graduate students will be here to tell you what they do and answer your pressing questions.