Skip to main content
College of Sciences
Department of Mathematics

Events

Events Search and Views Navigation

Event Views Navigation

Filters

Changing any of the form inputs will cause the list of events to refresh with the filtered results.

Today

John Harlim, Penn State University, Data-driven methods for estimating operator and parameters of dynamical systems

SAS 4201

I will discuss a nonparametric modeling approach for forecasting stochastic dynamical systems on smooth manifolds embedded in Euclidean space. This approach allows one to evolve the probability distribution of non-trivial dynamical systems with an equation-free modeling. In the second part of this talk, I will discuss a nonparametric estimation of likelihood functions using data-driven basis functions and the…

Andrew Belmonte, Pennsylvania State U, Koh Lecture on Mathematics in Our Time: Games, Decisions, Evolution, and Chance

SAS 2203

Humans play games. Sometimes we roll the dice, or buy lottery tickets - sometimes we play chess, or mind games of manipulation. History gives us two examples of the development of new mathematical ideas and directions from our playful habits: games of chance, which led to the formulation of Probability Theory, and games of strategy,…

Andrew Belmonte, Pennsylvania State University, Careers in Mathematics: Be Nonlinear

1911 Building Room 124

Students are often given the impression that there is one way to have an academic career, the right way. Reality is much more complicated, but this can also be empowering. We will discuss such things informally, while drawing some examples from my own path: from particle physics at Fermilab and CERN to cancer research at…

Andew Belmonte, Pennsylvania State U, Do Your Fair Share! Evolutionary Games and the Tragedy of the Commons

SAS 1102

Public goods games involve interactions between players or organisms who produce a commonly available good (cooperators) and those who consume it without producing (cheaters, defectors, freeloaders) - several instances are known to occur in nature and economics. The solution that freeloading is a better individual choice is known as the “tragedy of the commons” -…

Ying Zhou, Brandeis University, Tame Hereditary Algebras have finitely many m-Maximal Green Sequences

SAS 4201

Keller introduced the concept of maximal green sequences. Brustle-Dupont-Perotin proved that tame quivers have finitely many maximal green sequences. We have generalized the result to m-maximal green sequences. This talk will include a gentle introduction to tame path algebras, their indecomposable modules, silting objects and their mutations, the Auslander-Reiten quiver of bounded derived categories of tame path algebras and the outline…

Caprice Stanley, Suzanne Crifo, NC State

SAS 1102

Speaker 1: Caprice Stanley Title: Markov Chain Mixing Time Abstract: Informally a Markov chain is a memoryless stochastic process and its mixing time is the time required for the chain to be near its stationary distribution. Depending on the context, analysis of mixing time can be of great importance. For example, random walk-based algorithms for…

Mario Ricchiuto, INRIA Bordeaux, On dispersive-like effects in channels with banks

SAS 4201

The study of the propagation of undular bores in channels is relevant to many applications which go from the propagation of tsunami waves, to that of tidal bores/waves, to the propagation of strong waves in manmade channels due to hazards (e.g. dam breaking). In absence of banks, the flow exhibits a transition across which undulating waves  start breaking and transform…

Aliakbar Daemi, Simons Center for Geometry and Physics, Chern-Simons functional and the Homology Cobordism Group

SAS 4201

The set of 3-manifolds with the same homology as the 3-dimensional sphere, modulo an equivalence relation called homology cobordance, forms a group. The additive structure of this group is given by taking connected sum. This group is called the homology cobordism group and plays a special role in low dimensional topology and knot theory. In this talk, I…

SIAM info session, discussion, and lunch

Daniels 353

The outgoing student chapter president Joey Hart will give a short presentation overviewing SIAM and the opportunities its provides for graduate student members. A discussion time will follow. Pizza will be served.

Daphne Klotsa, University of North Carolina at Chapel Hill, A touch of non-linearity at intermediate Reynolds numbers: where spheres “think” collectively and swim together

SAS 4201

From crawling cells to orca whales, swimming in nature occurs at different scales. The study of swimming across length scales can shed light onto the biological functions of natural swimmers or inspire the design of artificial swimmers with applications ranging from targeted drug delivery to deep-water explorations. In this talk, I will present experiments and simulations…

Alie Falastien, Conor Perks and Jaye Sudweeks, Honors Students Research Presentation

Alie Falastein Title: Connectivity Estimation in Neuronal Networks: The Hidden Node Problem Abstract: The human brain is a complex system consisting of billions of neurons. The network connectivity of these neurons gives rise to a variety of dynamical behaviors and understanding it is key to describing the underlying evolution of the system. However, in our analysis of…

The Fourth Duke Mathematical Journal Conference April 26-29, 2018

Duke University

The goal of this conference is to bring young mathematicians together, both as speakers and as participants. The talks will cover an array of subject areas that are well represented in the Duke Journal. There will be nine talks by young mathematicians. More information can be found at: https://sites.duke.edu/dmj2018/

Faye Pasley, Molly Lynch, NC State

Speaker 1: Faye Pasley Title: Determinantal Representations, the Numerical Range, and Invariance We study hyperbolic polynomials with symmetry and express them as the determinant of a Hermitian matrix with special structure. By properly modifying a construction of Dixon (1902), we show for every hyperbolic polynomial of degree $n$ invariant under the cyclic group of order $n$ there…

Maggie Figueroa, Olivia Trogdon, Benjamin Wendt and Gautam Niagara, NC State, Honors Students Research Presentation

Maggie Figueroa   Title: Breaking Cryptography – the Discrete Log Problem   Abstract: The goal of cryptography is to allow ciphertext to be decoded only by the intended recipient. The privacy of the message relies heavily on the key used in the encryption function. Once a key is obtained, the decryption function follows easily. Cryptosystems such as…

Emily Barnard, Northeastern University, Graph Associahedra and the Poset of Maximal Tubings

SAS 4201

Given a graph G on n vertices, Postnikov defined a graph associahedron  P_G as an example of a generalized permutohedron, a polytope whose  normal fan coarsens the braid arrangement. Combinatorially, each face of  P_G corresponds to certain collections of compatible subgraphs of G called tubings. Graph associahedra were introduced independently by Carr  and Devadoss and…