Colloquia for the Fall 2009 Semester
|
|
More
|
Haim Brezis
Rutgers, Paris 6, and Technion
Friday, September 18
KAP 414
03:00 PM - 04:00 PM
|
Can you hear the winding number?
A few years ago – following a suggestion by I. M. Gelfand – I discovered an intriguing connection between the topological degree of a map from the circle into itself and its Fourier coefficients. This relation is easily justified when the map is smooth. However, the situation turns out to be much more delicate if one assumes only continuity, or even Holder continuity. I will present recent developments and open problems. I will also discuss new estimates for the degree of maps from $S^n$ into $S^n$, leading to unusual characterizations of Sobolev spaces. I will also discuss the continuity of the Jacobian in the sense of distributions. The initial motivation for this direction of research came from the analysis of the Ginzburg-Landau model occuring in superconductivity.
|
|
|
More
|
A.V. Balakrishnan
UCLA
Monday, September 21
KAP 414
03:30 PM - 04:30 PM
|
On the Problem of Wing Flutter Instability in AeroElasticity
Wing Flutter is an endemic instability that limits aircraft speed at any altitude. FAA mandates a 15% safety margin from the Flutter-Boundary. Currently all the work on the problem is Computational-FEM, CFD. This talk is on the Analytical Theory with Continuum Models. The Wing structure model is a Goland beam allowing for pitch and plunge. The AeroDynamics is based on the Conservation Laws in Differential Form. Inviscid flow is Characterized by the Euler Full Potential Equation .The Wing Dynamics is shown to be NonLinear Convolution/Evolution in a Hilbert Space. Flutter is an LCO and the Speed is a Hopf Bifurcation Point,determined by the Linearised Model. The aeroelastic modes are eigenvalues of the State Space Stability Operator. A closed form formula is obtained for the Transonic Dip phenomenon. Viscous flow is handled by the Prandtl Boundary Layer Theory, still Under Construction.
|
|
|
More
|
Dmitri Krioukov
CAIDA, San Diego
Monday, October 05
KAP 414
03:30 PM - 04:30 PM
|
Hyperbolic geometry of complex networks
We establish a connection between observed scale-free topology and hidden hyperbolic geometry of complex networks. The topologies of many complex networks in nature and society (biological networks, the Internet, social networks, etc.) share two common properties: (1) strong clustering, i.e., high concentration of triangular subgraphs, and (2) heterogenous (scale-free) node degree distributions, which often closely follow power laws. We show that these two common topological properties of complex networks can be explained by the existence of hidden spaces, which are: (1) metric, and (2) hyperbolic. Strong clustering in a network appears as a reflection of the triangle inequality in its hidden space, while the negative curvature of this hidden space affects the heterogeneity of the degree distribution. We also discuss implications for transport phenomena on networks, such as routing. Embedding a real scale-free network into an appropriate hyperbolic space allows for efficient geometric routing without global knowledge of the network topology, which holds a significant promise to find a variety of practical applications, such as improving the performance of Internet routing.
|
|
|
More
|
Margaret Wright
Courant Institute, NYU (the CAMS Distinguished Lecture, preceded by a reception at 3:00)
Friday, October 09
Andrus Gerontology Center
03:30 PM - 04:30 PM
|
Optimization without derivatives: consensus and controversies
Non-derivative methods for optimization have had a sometimes rocky relationship for more than 50 years with applied mathematicians who specialize in optimization. Although practitioners have never wavered in their fondness for non-derivative methods, their mathematical foundations were mostly lacking until the late 1980s. Since then, significant progress has been made concerning theoretical underpinnings, but several perplexing mysteries remain. In addition, there has been continuing and lively controversy about which methods are ``most effective'' on real-world applications, with disagreements about both the selection of test problems and the choice of criteria for assessing computational results. This talk will briefly survey the current state of the art, trying along the way to highlight a few of the interesting open questions.
|
|
|
More
|
Susan Friedlander, Eric Friedlander, Igor Kukavica
Monday, October 12
KAP 414
03:30 PM - 04:30 PM
|
Panel Discussion. Optimizing your chances: questions and answers on applying for jobs in academia
How, when and where does one apply for a job? What should you expect? What are employers looking for? What is "mathjobs"? Tips on the presentation of your CV, research statement and teaching statement. How to ask for letters of recommendation. How serious are deadlines? The panel welcomes your questions about the job process and we will try to share experiences.
|
|
|
More
|
Roger G. Ghanem
Civil and Environmental Engineering, USC
Monday, October 19
KAP 414
03:30 PM - 04:30 PM
|
Verification and Validation: A paradigm for trustworthy predictions.
With multifold increases in computational and sensing power, the technology is available to compare very high fidelity resolution of complex models of nature with very high resolution observations of these same phenomena. The resulting challenge to mathematics, science and technology, is to (re)define the new field of prediction science, where physics-based inferences can be used as useful surrogates of reality. Central to this effort are the concepts of verification and validation (V&V) which, in recent years, have grown as the bridge between computational science, experimental science, statistics, and other branches of mathematics.
In this talk, I will describe current efforts in V&V, both at USC and elsewhere, highlighting opportunities and challenges.
|
|
|
More
|
Jerry Bona
UIC
Monday, October 26
KAP 414
03:30 PM - 04:30 PM
|
Decay of Nonlinear, Dispersive Waves in the Presence of Dissipation
While solitary waves and other coherent phenomena dominate the long-time behavior of solutions of nonlinear, dispersive wave equations, real phenomena usually features dissipation as well. In the absence of continual forcing, the coherent structures no longer exist and finite energy disturbances decay back to the rest state.
Motivated by some water wave experiments, we pose some delicate questions about the long-time asymptotics of this decay. Theory pertaining to this question has been worked out in a number of contexts, one or two of which will be discussed in a bit more depth.
|
|
|
More
|
Bela Bollobas
Cambridge University
Monday, November 02
KAP 414
03:30 PM - 04:30 PM
|
Probabilistic Cellular Automata
Although probabilistic cellular automata have been around for close to forty years, there are very few rigorously proved theorems about them. In this talk I shall review some of these results, and shall present a number of theorems obtained jointly with Paul Balister, Robert Johnson and Mark Walters. Our results go far beyond anything obtainable by simulation, and provide evidence for the existence of critical probabilities for the random majority-vote cellular automata on tori.
|
|
|
More
|
Peter Jones
Yale
Wednesday, November 11
KAP 414
03:30 PM - 04:30 PM
|
Diffusion Geometry and Local Coordinates on Sets or Manifolds
For a finite metric space X or a smooth manifold M, one can define, in a canonical manner, a Laplace Operator. One then obtains Laplacian eigenfunctions. The study of Laplacian eigenfunctions is quite old and plays a central role in many areas of mathematics. The point of view of Diffusion Geometry is to use these eigenfunctions to provide local (or global) coordinate systems. The point here is that the object under study (X or M) might be easier to work with if one had new coordinate systems for it. This point of view has become popular recently in areas of applied mathematics. It is unclear however, why using eigenfunctions in this fashion should come with any guarantee of providing "good" representations of the original object. In this lecture we explain a theorem (joint work with Mauro Maggioni and Raanan Schul) that provides strong guarantees for local coordinate charts. For example, on a D dimensional, smooth manifold M of finite volume, we can choose D eigenfunctions to provide "good local charts". Perhaps surprisingly, in the case of simply connected, planar domains, this proof is closely related to the Riemann Mapping Theorem. Before presenting the theorem we will show some applications of diffusion geometry to various applied problems.
|
|
|
More
|
Robert Penner
USC and Aarhus University
Monday, November 16
KAP 414
03:30 PM - 04:30 PM
|
TBA
|
|
|
More
|
Edriss Titi
UCI and Weizmann
Monday, November 23
KAP 414
03:30 PM - 04:30 PM
|
TBA
|
|
Colloquia for the Spring 2009 Semester
|
|
More
|
Shamgar Gurevich
UC Berkeley
Monday, January 12
KAP 249
03:30 PM - 04:30 PM
|
Group representation patterns in digital signal processing
In the lecture we will explain how various fundamental structures from group representation theory appear naturally in the context of discrete harmonic analysis and can be applied to solve concrete problems from digital signal processing. We will begin the lecture by describing our solution to the problem of finding a canonical orthonormal basis of eigenfunctions of the discrete Fourier transform (DFT). Then we will explain how to generalize the construction to obtain a larger collection of functions that we call "The oscillator dictionary". Functions in the oscillator dictionary admit many interesting properties, in particular, we will explain several of these properties which arise in the context of problems of current interest in areas such as communication, radar, sparsity and compressive sensing.
|
|
|
More
|
Louis Goldstein
Linguistics, USC
Monday, January 26
KAP 249
04:00 PM - 05:00 PM
|
Coupled oscillators, speech timing, and syllables
In recent work, we have proposed that human speech communication can be modeled as a combinatorial system (phonology), in which the primitive elements are articulatory gestures, ie., constriction actions of the vocal organs that can be modeled as point attractor dynamical systems in a constriction task space. A small number of gestures (about 25 in English) recombine to form the speech patterns of all English words. Articulatory analysis of running speech shows that the gestural regimes constituting a word are not activated in a simple sequence. Rather the gestures are organized into temporal patterns in which some are synchronous, some are sequential, some are partially overlapping in time. In order to explain how speakers produce these stable patterns of relative timing, we have developed a speech planning model in which each gesture is associated with an internal planning oscillator whose task is to trigger the activation of its gesture. Pairs of oscillators are coupled to one in stable modes (in-phase and anti-phase), so as to insure stable relative timing between the production of that pair of gestures. Thus, a word (or longer stretch of speech) is modeled as network of coupled oscillators that can be represented as a coupling graph. The topology of these graphs correctly accounts for regularities in the relative timing of gestures and in stochastic variability of their relative timing. It also provides an explanation of the internal combinatorial structure of syllables that linguistic research has uncovered over the years.
|
|
|
More
|
Michael Arbib
Director, USC Brain Project
Monday, February 02
KAP 146
03:30 PM - 04:30 PM
|
Mirror Neurons to Computational Neurolinguistics
The Mirror System Hypothesis for the evolution of the language-ready brain (e.g., Rizzolatti & Arbib, TINS, 1998; Arbib, BBS, 2005) suggests a path for evolution of brain mechanisms atop the mirror system for grasping, with new processes supporting simple imitation, complex imitation, gesture, pantomime and finally protosign and protospeech. The present talk will briefly summarize the evolutionary story as background for a suggested program of research in neurolinguistics, with modeling challenges at the levels both of schemas and neural networks to make contact with data from psycholinguistics, neurophysiology, and neurology.
|
|
|
More
|
Roman Shvydkoy
Univ. of Illinois-Chicago
Monday, February 09
KAP 146
03:30 PM - 04:30 PM
|
C*-algebras, cocycles, and shortwave instabilities in ideal fluids
Shortwave instabilities of ideal fluids are instabilities that appear in the form of a highly oscillating localized wavelet. Discovered some 30 years ago they were first recognized as an important stage in the transition process from a laminar to fully turbulent flow in a pipe as well as in flows with exponential stretching of trajectories. Mathematically, shortwave instabilities unlike various classes of modal instabilities are linked to the Fredholm spectrum of the linearized Euler equation. Finding the structure of the Fredholm spectrum is in fact equivalent to finding the range of all possible exponential growth rates for geometric optics solutions. In this talk we give an overview of new tools and developments that appeared recently in the area. In particular, we will show via the use of the hair ball theorem that the Fredholm spectrum of 3D Euler equation consists of a solid single annulus centered at the origin. We will also discuss the problem of nonlinear instability of ideal fluids and the role the Fredholm spectrum plays in its understanding.
|
|
|
More
|
Terence Tao
UCLA, Joint with the Whiteman Lectures
Thursday, February 19
Gerentology Auditorium
03:30 PM - 04:30 PM
|
Compressed Sensing
Suppose one wants to recover an unknown signal x in Rn from a given vector Ax=b in Rm of linear measurements of the signal x. If the number of measurements m is less than the degrees of freedom n of the signal, then the problem is underdetermined and the solution x is not unique. However, if we also know that x is sparse or compressible with respect to some basis, then it is a remarkable fact that (given some assumptions on the measurement matrix A) we can reconstruct x from the measurements b with high accuracy, and in some cases with perfect accuracy. Furthermore, the algorithm for performing the reconstruction is computationally feasible. This observation underlies the newly developing field of compressed sensing. In this talk we will discuss some of the mathematical foundations of this.
|
|
|
More
|
Jack Xin
UC Irvine
Monday, February 23
KAP 146
03:30 PM - 04:30 PM
|
Soft-Constrained Iterative Methods for Blind Source Separation
Blind source separation is a statistical inverse problem aiming to recover source signals and mixing filters (discrete Green's functions) without detailed knowledge of the environment. Cocktail party problem is an example of how humans perform this task by paying attention. Yet little is known of the computation inside human brain for this task. For sound mixtures, source signals viewed as time series are much more independent of each other than their mixtures. The separation is formulated mathematically as minimization of generalized cross correlations. We derive iterative methods from statistical principles, however, the resulting dynamics are nonlinear and solutions may blow up. We devise a class of discrete ordinary integral differential equations to impose soft constraints, and control the scaling behavior of iterations. The solutions then exist globally and converge in some weak sense to the desired separation conditions.
|
|
|
More
|
Emmanuel Candes
Cal Tech
Monday, March 02
KAP 146
03:30 PM - 04:30 PM
|
Exact Matrix Completion via Convex Optimization: Theory and Algorithms
This talk considers a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. In partially filled out surveys, for instance, we would like to infer the many missing entries. In the area of recommender systems, users submit ratings on a subset of entries in a database, and the vendor provides recommendations based on the user's preferences. Because users only rate a few items, we would like to infer their preference for unrated items (this is the famous Netflix problem). Formally, suppose that we observe m entries selected uniformly at random from a matrix. Can we complete the matrix and recover the entries that we have not seen?
We show that perhaps surprisingly, one can recover low-rank matrices exactly from what appear to be highly incomplete sets of sampled entries; that is, from a comparably small number of entries. Further, perfect recovery is possible by solving a simple convex optimization program, namely, a convenient semidefinite program (SDP). This result hinges on powerful techniques in probability theory. We will also present a very efficient algorithm based on iterative singular value thresholding, which can complete matrices with about a billion entries in a matter of minutes on a personal computer.
|
|
|
More
|
Shouhong Wang
U of Indiana
Monday, March 09
KAP 146
03:30 PM - 04:30 PM
|
El Nino Southern Oscillation as Sporadic Oscillations between Metastable States
El Nino Southern Oscillation (ENSO) is a global coupled ocean-atmosphere phenomenon, associated with floods, droughts, and other disturbances in a range of locations around the world. ENSO is the most prominent known source of inter-annual variability in weather and climate around the world (about 3 to 8 years). In spite of its importance and a long history of studies, the understanding of its nature and mechanism is still lacking, and a careful fundamental level examination of the problem is crucial.
We present in this talk a new mechanism of the ENSO, as a self-organizing and self-excitation system, with two highly coupled processes. The first is the oscillation between the two metastable warm (El Nino phase) and cold events (La Nina phase), and the second is the spatiotemporal oscillation of the sea surface temperature (SST) field. The interplay between these two processes gives rises the climate variability associated with the ENSO, leads to both the random and deterministic features of the ENSO, and defines a new natural feedback mechanism, which drives the sporadic oscillation of the ENSO. The new mechanism is rigorously derived using a dynamic transition theory developed recently by the authors, which has also been successfully applied to a wide range of problems in nonlinear sciences. This is joint work with Tian Ma.
|
|
|
More
|
Inez Fung
Director, Berkeley Institute for the Environment
Monday, March 23
KAP 146
03:30 PM - 04:30 PM
|
New Challenges in Climate Modeling
Climate models solve the equations for the conservation of momentum, mass and energy in the atmosphere and oceans, the equations of state for air and for sea water, as well as equations for energy and water exchange with the land and cryosphere. This talk reviews the mathematical basis of climate models, and presents new challenges in climate modeling. Much fundamental research is needed to improve our predictions of the timing and magnitude of climate change for the next decades. The Lorenz 1963 model of chaos will be used to explore whether we can predict abrupt climate change.
|
|
|
More
|
Alexander Kiselev
Univ. of Wisconsin
Monday, April 13
KAP 146
03:30 PM - 04:30 PM
|
Recent Results on Surface Quasi-geostrophic Equation
The 2D surface quasi-geostrophic equation (SQGE) has recently been a focus of much research. This equation appears naturally in geophysics. It has a simple structure yet its solutions exhibit rich and complex behaviors. The SQGE is perhaps the simplest looking evolutionary equation of fluid dynamics for which the fundamental question of global existence of smooth solutions remains open. I will review some recent results on the regularity and roughening of solutions of the SQGE. In particular, I will talk about nonlocal maximum principle for SQGE, a new idea which found wider applicability, and about search for monotone quantities which can help understand energy transfer to higher modes.
|
|
|
More
|
George Papanicolaou
Stanford, CAMS Distinguished Lecturer
Friday, April 17
Gerentology Auditorium
03:30 PM - 04:30 PM
|
Imaging with Noise
It is somewhat surprising at first that it is possible to locate a network of sensors from cross correlations of noise signals that they record. This is assuming that the speed of propagation in the ambient environment is known and that the noise sources are sufficiently diverse. If the sensor locations are known and the propagation speed is not known then it can be estimated from cross correlation information. Although a basic understanding of these possibilities had been available for some time, it is the success of recent applications in seismology that have revealed the great potential of correlation methods, passive sensors and the constructive use of ambient noise in imaging. I will introduce these ideas in an interdisciplinary, mathematical way and show that a great deal can be done with them. Things become more complicated, and a mathematically more interesting, when the ambient medium is also strongly scattering. I will end with a review of what is known so far in this case, and what might be expected.
|
|
Colloquia for the Fall 2008 Semester
|
|
More
|
Susan Friedlander
USC
Monday, September 29
KAP 249
03:30 PM - 04:30 PM
|
Onsager's Conjecture, Kolmogorov's Law and a Model for Turbulence
We discuss properties of a shell type model for the inviscid fluid equations. We prove that the forced system has a unique equilibrium which is an exponential global attractor. Every solution blows up in H5/6 in finite time . After this time, all solutions stay in Hs, s<5/6, and "turbulent" dissipation occurs. Onsager's conjecture is confirmed for the model system. We discuss the augmented viscous system and show that Kolmogorov's law for turbulence holds in the limit of vanishing viscosity. This is joint work with Alexey Cheskidov and Nataša Pavlović.
|
|
|
More
|
Gunnar Carlsson
Stanford University
Monday, October 06
KAP 249
03:00 PM - 04:00 PM
|
Topology and Data
In recent years, it has become clear that there is a great need for methods of handling data of very diverse kinds and of very large size. In addition, it is important that the analysis be robust to small changes in metric information. I will discuss various topological methods which allow this kind of analysis, and give examples of the methodology.
|
|
|
More
|
Solomon Golomb
USC
Monday, October 13
KAP 249
04:00 PM - 05:00 PM
|
Periodic Binary Sequences: Solved and Unsolved Problems
An m-sequence of degree n is a binary sequence of 0's and 1's of period $2^d-1$ generated by an n-stage linear feedback shift register. These sequences have several pseudo-randomness properties that make them useful in many communications applications (cryptography, radar, CDMA wireless, etc). There is a bijection between m-sequences and primitive polynomials over GF(2). Numerous solved and unsolved problems about m-sequences and their randomness will be discussed.
|
|
|
More
|
Lawrence Craig Evans
UC Berkeley
Wednesday, October 15
KAP 249
03:30 PM - 04:30 PM
|
New PDE methods for weak KAM theory
The PDE approach to so-called ``weak KAM'' theory extracts information about Hamiltonian dynamics from a Hamilton-Jacobi equation and a coupled transport equation. In my expository lecture, I will discuss some old and new perspectives on this issue, emphasizing several unusual new variational methods.
|
|
|
More
|
Anna Mazzucato
Penn State
Monday, October 20
KAP 249
03:30 PM - 04:30 PM
|
Dissipation in turbulent flows
In Kolmogorov theory of turbulence there is a "cascade" of energy from large to small scales where energy is dissipated by viscosity. In two-dimensional flows (which have been used for example to model geophysical flows if rotation can be neglected), the flow is dominated by the formation of small stable vortices and what cascades to small scales is not energy but enstrophy. Informally, enstrophy can be thought of as the energy associated to vortices. In both cases, there must be a finite rate of dissipation as viscosity vanishes, as observed experimentally and in simulations. Mathematically, this is the case if there are irregular solutions to the Euler equations, modeling inviscid fluid flow, which do not conserve energy in 3D or enstrophy in 2D. We will discuss some results concerning the behavior of enstrophy in 2D Euler solutions, in particular how to reconcile turbulence with the fact Euler solutions conserve enstrophy exactly. This is joint work with Milton Lopes and Helena Nussenzveig Lopes.
|
|
|
More
|
Alan Edelman
MIT
Wednesday, October 22
KAP 249
03:30 PM - 04:30 PM
|
The random matrix technique of ghosts and shadows
On and off, I have been interested in novel computational approaches in random matrix theory for theoretical and practical use. I will review a few of my favorites, and then discuss current work on realizing schemes that include reals, complexes, and quaternions as special cases in the hopes of getting to the bottom of some key random matrix facts as well as building useful numerical approaches.
|
|
|
More
|
Persi Diaconis
Stanford
Friday, October 24
KAP 249
03:30 PM - 04:30 PM
|
Adding Numbers and Shuffling Cards
The usual process of "carries" when adding numbers turns out to have interesting mathematics hidden in it. It begins with an "amazing" matrix discovered by Holte, which has close connections to the usual way of mixing cards by riffle shuffling. The connections give new results for addition and for shuffling. This is joint work with Jason Fulman.
|
|
|
More
|
Gunther Uhlmann
Univ. of Washington
Monday, November 03
KAP 249
03:30 PM - 04:30 PM
|
Invisibility and Inverse Problems
We describe recent theoretical and experimental progress on making objects invisible. The equations that govern a variety of wave phenomena, including electrostatics, electromagnetism, acoustics and quantum mechanics, have transformation laws that allow one to design material parameters that steer waves around a hidden region, returning them to their original path on the far side. Not only are observers unaware of the contents of the hidden region, they are not even aware that something was being hidden; the object, which casts no shadow, is said to be cloaked. We recount the recent history of the subject and discuss some of the mathematical issues involved.
|
|
|
More
|
Donald G. Saari
UC Irvine
Monday, November 10
KAP 249
03:30 PM - 04:30 PM
|
Mathematics of Voting
We know that voting rules experience all sorts of difficulties, e.g., as shown in this lecture, the problems are sufficiently bad that we should seriously worry whether the person elected is who the voters really want. The central issue is to understand why this is so and whether any rule has reliable outcomes. Because voting rules serve as a prototype for a wide class of aggregation rules, ranging from statistics, much of what is done in the social sciences, to even engineering multiscale processes, answers could be of wide value. In this lecture, Donald Saari will outline the mathematical structure of voting rules, and show how these structures completely explain all of those many troubling paradoxes.
|
|
|
More
|
Craig A. Tracy
UC Davis
Wednesday, November 19
KAP 249
03:30 PM - 04:30 PM
|
The Asymmetric Simple Exclusion Process: Integrable Structure & Limit Theorems
Since its introduction by Frank Spitzer nearly forty years ago, the asymmetric simple exclusion process (ASEP), has become the "default stochastic model for transport phenomena." Some have called the ASEP the "Ising model for nonequilibrium physics." In ASEP on the integer lattice Z particles move according to two rules: (1) A particle at x waits an exponential time with parameter one (independently of all the other particles), and then it chooses y with probability p(x, y ); (2) If y is vacant at that time it moves to y, while if y is occupied it remains at x and restarts the clock. The adjective "simple" refers to the fact that allowed jumps are one step to the right, p(x, x + 1) = p, or one step to the left, p(x, x - 1) = 1 - p = q. The asymmetric condition means p = q so that there is a net drift to either the right or the left.
In this lecture we consider ASEP on the integer lattice Z with step initial condition: At time zero the particles are located at Z^+ = {1, 2, . . . , } and there is a drift to the left (q > p). If x_m(t) denotes the position of the mth particle from the left at time t (so that x_m (0) = m), a basic quantity is the distribution function P(x_m (t) x) which describes the "current fluctuations." Physicists have conjectured that the limiting distribution of x_m (t) as m , t -> infinity with m/t fixed is in the 1 + 1 KPZ Universality Class. We show that this is indeed the case and describe the limiting distribution function. (This limiting distribution function first appeared in the random matrix theory literature.) This result extends an earlier theorem of Kurt Johansson on the T(totally)ASEP where q = 1 and p = 0. This work is joint work with Harold Widom.
The lecture itself is for a general audience.
|
|
|
More
|
Christian M. Reidys
Center of Combinatorics, Nankai University
Tuesday, December 09
KAP 249
03:30 PM - 04:30 PM
|
Algebraic Combinatorics of RNA Structures
In this talk we report recent progress based on the seminal work of M. Waterman on the combinatorics of RNA secondary structures. We first discuss a new idea to obtain the generating function of pseudoknot RNA via the reflection principle. Then we discuss the singularity analysis of the latter and extend the results to the biologically relevant canonical RNA structures which satisfy certain minimum stack-length conditions. Then we observe that these ideas can be generalized for tertiary interactions and introduce the concept of tangles. Finally we introduce a new diagram algebra which is related to the Brauer centralizer algebra.
|
|