The Mathematics Calendar
http://www.math.psu.edu/seminars/calendar.php
Seminars and special events the Pennsylvania State University Mathematics Department2015-08-27webmaster@math.psu.eduNumerical methods for fine-scale petroleum reservoir simulation
http://www.math.psu.edu/seminars/meeting.php?id=27523
Speaker(s): Chensong Zhang
Computer simulation is widely used by petroleum engineers to understand oil recovery mechanisms. We will first briefly review a few mathematical models for petroleum reservoir simulation. Then we focus on a general compositional model and develop a fully-implicit method as well as effective preconditioners for solving the Jacobian systems. We will also discuss efficient parallel implementation of the proposed preconditioners on different platforms. The accuracy, robustness, and parallel scalability of the parallel simulator are then validated using large-scale black oil benchmark problems.2015-08-28T15:00:00CCMA PDEs and Numerical Methods Seminar Seriessxw58@math.psu.edusaz11@math.psu.edufuw7@math.psu.eduma_y@math.psu.eduMarkov processes in a random environment
http://www.math.psu.edu/seminars/meeting.php?id=26942
Speaker(s): Yuri Suhov
Abstract. We propose a construction of a Markov process (MP) in a (Markovian) random environment. (I am not 100 percent sure: may be some special cases/elements of this constructions can be found in the existing literature.) A feature of this construction is that it allows an invariant measure (IM) which is naturally built from IMs for the basic MPs and IMs for the MP (or (MPs)) describing the dynamics of state of environment (SE). In general tems, the generator of the combined process is obtained as a sum of generators for components (with non-commuting summands). This construction gives quite spectacular results for some interesting examples: Jackson network, simple exclusion, Ornstein--Uhlenbeck. (The latter is related to the concept of stochastic volatility in Math Finance.)
In the course of presentation, I will not assume any special knowledge from the theory of Markov processes or their applications. However, exposure to basic probabilistic concepts would make understanding easier.2015-08-28T15:35:00Probability and Financial Mathematics Seminaranovikov@math.psu.edumazzucat@math.psu.eduroyer@math.psu.edunistor@math.psu.edudenker@math.psu.eduSlow entropy for smooth flows on surfaces
http://www.math.psu.edu/seminars/meeting.php?id=27208
Speaker(s): Adam Kanigowski
We will discuss slow entropy in the class of mixing smooth flows on surfaces. As a consequence we will find countably many non-isomorphic (disjoint) smooth flows. Moreover, we will show that they don't have finite rank.2015-08-31T15:35:00Dynamical systems seminarkatok_s@math.psu.edusaz11@math.psu.edukatok_a@math.psu.eduhertz@math.psu.eduA Combinatorial Proof of a Relationship Between Maximal (2k-1,2k+1)-cores and (2k-1,2k,2k+1)-cores
http://www.math.psu.edu/seminars/meeting.php?id=26943
Speaker(s): James Sellers
Integer partitions which are simultaneously t-cores for distinct values of t have attracted significant interest in recent years. When s and t are relatively prime, Olsson and Stanton have determined the size of the maximal (s,t)-core. When k > 1, a conjecture of Amdeberhan on the maximal (2k-1,2k,2k+1)-core has also recently been verified by numerous authors.
In this work, we analyze the relationship between maximal (2k-1,2k+1)-cores and maximal (2k-1,2k,2k+1)-cores. In previous work, Nath noted that, for all k > 0, the size of the maximal (2k-1,2k+1)-core is exactly four times the size of the maximal (2k-1,2k,2k+1)-core and requested a combinatorial interpretation of this unexpected identity. Here, using the theory of abaci, partition dissection, and elementary results relating triangular numbers and squares, we provide such a combinatorial proof. This is joint work with Rishi Nath.2015-09-01T11:15:00Combinatorics/Partitions Seminarsellersj@math.psu.edukatz@math.psu.edusaz11@math.psu.eduandrews@math.psu.eduNote special time: *Thursday* at 12:20pm
http://www.math.psu.edu/seminars/meeting.php?id=27464
Speaker(s): Igor Aronson
2015-09-01T13:30:00Theoretical Biology Seminarcpc16@math.psu.edutreluga@math.psu.eduTBA
http://www.math.psu.edu/seminars/meeting.php?id=27015
Speaker(s): Stephen Simpson
2015-09-01T14:30:00Logic Seminarjmr71@math.psu.edusimpson@math.psu.edureimann@math.psu.eduTBA
http://www.math.psu.edu/seminars/meeting.php?id=27016
Speaker(s): Vincent Caudrelier
2015-09-01T14:30:00GAP Seminarping@math.psu.edustienon@math.psu.eduhigson@math.psu.edueus25@math.psu.eduSome Open Problems Arising from my Recent Finite Field Research
http://www.math.psu.edu/seminars/meeting.php?id=26944
Speaker(s): Gary Mullen
We will discuss a number of my favorite open problems and
conjectures which have arisen in my recent research related
to finite fields. These discussions will focus on a variety
of areas including some theoretical topics as well as some
topics from combinatorics and coding theory.2015-09-03T11:15:00Algebra and Number Theory Seminarrvaughan@math.psu.edupapikian@math.psu.eduyee@math.psu.edueisentra@math.psu.eduComputational model of cell motility
http://www.math.psu.edu/seminars/meeting.php?id=28707
Speaker(s): Igor Aronson
Cell motility and collective migration are among the most important themes in cell biology, mathematical biology, and bioengineering, and are crucial for morphogenesis, wound healing, and immune response in eukaryotic organisms. It is also relevant for the development of effective treatment strategies for diseases such as cancer, and for the design of bioactive surfaces for cell sorting and manipulation. Substrate-based cell motility is, however, a very complex process as both regulatory pathways and physical force generation mechanisms are intertwined.
To understand the interplay between adhesion, force generation and motility, we develop a computational model based on the phase field method, which is especially suited to treat the moving and deformable boundaries involved in both individual and collective cell motility. The resulting system of coupled PDEs with the non-local volume-conservation constraint is solved by the quasi-spectral method in a periodic two-dimensional square domain. The model captures all essential phenomenology exhibited by moving cells, including the abrupt onset of motion and the response to external stimuli. We investigate by the means of large-scale GPU computations how cells navigate on substrates with patterned adhesion properties and modulated stiffness of substrate. Such substrates are currently under technological development to collect and sort cells. For multiple cells, the generalized multiphase-field model is able to predict that collective cell migration emerges spontaneously as a result of inelastic collision-type interactions of cells.2015-09-03T12:20:00Center for Interdisciplinary Mathematics Seminarbressan@math.psu.eduberlyand@math.psu.eduA tour of Pritchard Lab
http://www.math.psu.edu/seminars/meeting.php?id=28189
Speaker(s): Diane Henderson
The MASS students will be introduced to the Pritchard Fluids Lab, a physics that is a part of the Mathematics Department.2015-09-03T13:25:00MASS Colloquiumtabachni@math.psu.edusaz11@math.psu.eduNoncommutative Geometry 102: Asymptotics and spectral theory
http://www.math.psu.edu/seminars/meeting.php?id=27119
Speaker(s): Nigel Higson
I shall give two lectures introducing some of the ideas that appear in the research of Penn State's noncommutative geometry group. In the first I shall discuss differential and Hilbert space operators, and various sorts of "symbols" that can be attached to them. In the second I shall examine how the general theory applies to Sturm-Liouville operators on a half-line, following some remarkable early work Hermann Weyl that has proved to be very influential in representation theory.2015-09-03T14:30:00Noncommutative Geometry Seminarroe@math.psu.eduhigson@math.psu.edusaz11@math.psu.eduDepartmental Reception
http://www.math.psu.edu/seminars/meeting.php?id=25672
Speaker(s): Departmental Reception
2015-09-03T15:30:00Department of Mathematics Colloquiumsaz11@math.psu.eduliu@math.psu.edu