Introduction to SIAM
The SIAM student chapter will be hosting an introductory lecture aimed at Undergraduates and Graduate students on national SIAM events, SIAM resources, and upcoming student chapter events. Cookies and coffee will be provided.
The SIAM student chapter will be hosting an introductory lecture aimed at Undergraduates and Graduate students on national SIAM events, SIAM resources, and upcoming student chapter events. Cookies and coffee will be provided.
One way to effectively show a group is non-trivial is to find a non-trivial representation. A major open question in low-dimensional topology is whether the fundamental group of a closed three-manifold other than S^3 has a non-trivial SU(2) representation, and this is a strategy for an alternate proof of the three-dimensional Poincare conjecture. We will…
In this talk, we demonstrate one way of exploiting smooth structures hidden in convex functions to develop optimization algorithms. Our key idea is to generalize a powerful concept so-called "self-concordance" introduced by Y. Nesterov and A. Nemirovskii to a broader class of convex functions. We show that this structure covers many applications in statistics and machine learning. Then, we develop a…
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…
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.…
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…
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.
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…
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…
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…
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…
In this talk I'll explain a surprising relationship between the objects in the title. Two n-dimensional polytopes, $P$, $Q$ are said to be scissors congruent if one can cut $P$ along a finite number of hyperplanes, and re-assemble it into $Q$. The scissors congruence problem asks: when can we do this? what obstructs this? In…
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…
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.
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…