The Mathematics Calendar
http://www.math.psu.edu/seminars/calendar.php
Seminars and special events the Pennsylvania State University Mathematics Department2015-04-18webmaster@math.psu.eduComputational Challenges in Reservoir Simulations
http://www.math.psu.edu/seminars/meeting.php?id=26490
Speaker(s): Ilya Mishev
Reservoir simulations are extensively used in the petroleum industry to predict the optimal way to produce oil and gas from the reservoirs. Understanding how oil, gas, and water flow in the subsurface is essential for the success of the simulations. Modeling of fluid flow in porous media requires solving a strongly couple system of nonlinear PDEs in highly heterogeneous and anisotropic media. The PDEs exhibit both hyperbolic and parabolic features. Following accurately the geologic layers leads to grids that challenge the approximation methods. We will sketch the approaches used in the petroleum industry and some of the academic research for the discretization of the equations and solving the linear systems and discuss the challenges.2015-04-20T12:20:00CCMA Luncheon Seminarmsm37@math.psu.edushaffer@math.psu.eduliu@math.psu.eduLinear Solvers for Reservoir Simulation problems
http://www.math.psu.edu/seminars/meeting.php?id=25554
Speaker(s): Ilya Mishev
Linear solvers are usually the most time consuming part of reservoir simulations. A considerable amount of research has been devoted to reducing the time necessary for solving the linear system. One approach is to use an operator splitting scheme that replace the fully implicit formulation with IMPES (Implicit Pressure Explicit Saturation) or Sequential Implicit (Implicit Pressure followed by Implicit Saturation). The size of the linear systems is reduced considerably and there is no coupling of hyperbolic and parabolic features. Nevertheless, the linear systems from the discretization of the pressure equation are still difficult to solve because of the size and the properties of the mesh, the heterogeneity and the anisotropy of the porous media. I will share my experience in development of overlapping and non-overlapping Additive Schwarz Domain Decomposition preconditioners for solving the pressure linear systems and discuss the use of Algebraic MultiGrid.2015-04-20T14:30:00Computational and Applied Mathematics Colloquiummsm37@math.psu.edushaffer@math.psu.eduliu@math.psu.edufuw7@math.psu.eduTBA
http://www.math.psu.edu/seminars/meeting.php?id=27460
Speaker(s): Atendees
2015-04-21T12:20:00Teaching Mathematics Discussion Group Seminarzach@math.psu.eduzelenberg@math.psu.eduStable Polyhedral Self-Assembly by Dimers
http://www.math.psu.edu/seminars/meeting.php?id=24704
Speaker(s): Tomo Pisanski
Recently synthetic biologists began designing polypeptide strands that can self-assemble
in the shape of a stable polyhedron in such a way that each polyhedral edge is com-
posed of two intertwined polypeptide segments. The model that best describes a
self-assembly polyhedron comes from topological graph theory. It can be interpreted,
on the one hand, as a gluing process turning a fundamental polygon into a closed
surface and on the other hand, as an Eulerian trail in a doubled skeleton graph of
the corresponding polyhedron. Several mathematical questions are addressed, such as
existence, uniqueness and enumeration. Determining optimal gluing sequence can be
considered as a problem of combinatorial optimization. The problem of multi strand
self-assembly is also considered with emphasis on vertex-stability. The method can be
applied not only to proteins but also to certain DNA self-assemblies.2015-04-21T13:00:00Theoretical Biology Seminarcpc16@math.psu.edutreluga@math.psu.eduTBA
http://www.math.psu.edu/seminars/meeting.php?id=24764
Speaker(s): Francesco D'Andrea
2015-04-21T14:30:00GAP Seminarping@math.psu.edustienon@math.psu.eduhigson@math.psu.eduroyer@math.psu.eduNO WORKING SEMINAR-Conference in Maryland
http://www.math.psu.edu/seminars/meeting.php?id=25368
Speaker(s): Andrew Belmonte and group using room for an hour today
2015-04-21T15:00:00Working Seminar: Dynamics and its Working Toolskatok_a@math.psu.edusaz11@math.psu.eduhertz@math.psu.edukalinin@math.psu.eduA Compositional Approach to Networks
http://www.math.psu.edu/seminars/meeting.php?id=25827
Speaker(s): Brendan Fong
Throughout engineering and computer science, network-type diagrams are used to represent and reason about systems. The most familiar such framework is perhaps that of electrical circuit diagrams, while other examples include signal flow graphs, bond graphs, Petri nets, automata, and similar. In this talk we ask what common algebraic structures underlie such diagrams, finding suitable language to address this question in the mathematical field known as monoidal category theory. This allows us to formalise relationships between different diagrammatic languages, as well as discuss their semantics; we shall give examples arising from electrical circuits. This is joint work with John Baez.2015-04-22T15:30:00Applied Algebra and Network Theory Seminarmorton@math.psu.edusaz11@math.psu.educpc16@math.psu.eduvui1@math.psu.eduTo be announced
http://www.math.psu.edu/seminars/meeting.php?id=24854
Speaker(s): Alina Cojocaru
2015-04-23T11:15:00Algebra and Number Theory Seminarrvaughan@math.psu.edupapikian@math.psu.eduyee@math.psu.edueisentra@math.psu.eduSingular foliations and their C* algebras: calculations. 2.
http://www.math.psu.edu/seminars/meeting.php?id=25496
Speaker(s): Iakovos Androulidakis
Singular foliations are examples of dynamical systems. They are abundant in many branches of mathematics, for instance control theory and Poisson geometry. In fact singular foliations appear much more often than regular ones. In this series of talks we discuss how to deal with the leaf space of such foliations, including calculations of various examples. Information about this space is encapsulated in the holonomy groupoid of the foliation and the associated C*-algebra. A tentative program for these lectures is: (1) singular foliations and bisubmersions, with examples (foliation by the flow of a single vector field, by orbits of the SO(3) action, by orbits of the action of SL(2,R)), (b) calculation of the holonomy groupoid for the above examples, (c) construction of the foliation C*-algebra, and (d) K-theory calculation for the above examples (the right-hand side of the Baum-Connes assembly map).2015-04-23T14:30:00Noncommutative Geometry Seminarhigson@math.psu.edusaz11@math.psu.eduCongruent numbers and L-functions
http://www.math.psu.edu/seminars/meeting.php?id=24931
Speaker(s): Professor Shou-Wu Zhang (Host: Winnie Li)
A thousand years old problem is to determine which positive integers are congruent numbers, i,e, which positive integers could be the areas of right angled triangles with sides of rational lengths.
This problem has some beautiful connections with elliptic curves and L-functions. In fact by the Birch and Swinnerton-Dyer conjecture, all n= 5, 6, 7 mod 8 should be congruent numbers, and most of n=1, 2, 3 mod 8 should not be congruent numbers.
In this lecture, I will explain these connections and some recent developments.2015-04-23T15:30:00Department of Mathematics Colloquiumsaz11@math.psu.eduliu@math.psu.eduFaltings heights and modular forms
http://www.math.psu.edu/seminars/meeting.php?id=27929
Speaker(s): Prof. Shouwu Zhang
In his seminal work on Tate, Shafarevich and Mordell conjectures, Faltings introduced his modular height for
an abelian variety over a number field. Despite its importance in many applications in arithmetic geometry,
it is difficult to evaluate this height in dimension greater than 1. I will first describe some construction of modular forms attached
to abelian varieties with Faltings heights as constant terms, and then give some applications.2015-04-24T11:15:00Algebra and Number Theory Seminarwli@math.psu.eduTBA
http://www.math.psu.edu/seminars/meeting.php?id=24891
Speaker(s): Yuri Suhov
2015-04-24T15:35:00Probability and Financial Mathematics Seminardenker@math.psu.eduanovikov@math.psu.edumazzucat@math.psu.eduroyer@math.psu.edunistor@math.psu.edu