In the first part of this talk we introduce a classical family of symmetric polynomials called Schur polynomials and discuss some of their properties, and a problem that arises from their study, namely the combinatorial interpretation of Littlewood–Richardson coefficients.
In the second part, we explain how the work of Robinson, Schensted, Knuth, Lascoux, and Schuetzenberger on words in an ordered alphabet led to a solution of this combinatorial problem. We will then mention some relatively recent developments in this subject.
I will start by recalling some classical formulae that one usually encounters in a first course in Calculus. For example, Euler proved in the 1730’s that the sum of reciprocals of squares of positive integers is onesixth of the square of \pi. Such formulae are the prototypical examples of an entire of research in modern number theory called special values of Lfunctions. The idea of an Lfunction is crucial in the work of Andrew Wiles in his proof of Fermat’s Last Theorem. The aim of this lecture will be to give an appreciation for Lfunctions and to convey the grandeur of this subject that draws upon several different areas of mathematics such as representation theory, algebraic and differential geometry, and harmonic analysis. Towards the end of the talk, I will present some of my own recent results on the special values of certain automorphic Lfunctions.
Let $G$ be a finite simple graph. The Lie algebra $\mathfrak{g}$ of $G$ is defined as follows: $\mathfrak{g}$ is generated by the vertices of $G$ modulo the relations $[u, v]=0$ if there is no edge between the vertices $u$ and $v$. Many properties of $\mathfrak{g}$ can be obtained from the properties of $G$ and vice versa. The Lie algebra $\mathfrak{g}$ of $G$ is naturally graded and the graded dimensions of the Lie algebra $\mathfrak{g}$ of $G$ have some deep connections with the vertex colorings of $G$. In this talk, I will explain how to get the generalized chromatic polynomials of $G$ in terms of graded dimensions of the Lie algebra of $G$. We will use this connection to give a Lie theoretic proof of of Stanley’s reciprocity theorem of chromatic polynomials.
I will give a gentle introduction to the Diamond Lemma. This is a useful technique to prove that certain “PBWtype” bases exist of algebras given by generators and relations. In particular, we will see the PBW theorem for usual Lie algebras.
This is joint work with N. Prabhu (IISER Pune). We derive new bounds for moments of the error in the SatoTate law over families of elliptic curves. As applications, we deduce new almostall results for the said errors and a conditional Central Limit Theorem on the distribution of these errors. Our method builds on recent work by N. Prabhu and K. Sinha who derived a Central Limit Theorem on the distribution of the errors in the SatoTate law for families of cusp forms for the full modular group. In addition, identities by Birch and Melzak play a crucial rule in this paper. Birch’s identities connect moments of coefficients of HasseWeil Lfunctions for elliptic curves with the Kronecker class number and further with traces of Hecke operators. Melzak’s identity is combinatorial in nature.
The five Platonic solids are some of the oldest known objects of mathematical study. In this talk (in joint work with David Aulicino and Pat Hooper) we discuss how understanding the flat geometry of Platonic solids leads to very interesting 20th and 21st century mathematics. In particular, we use the geometry of Riemann surfaces to construct a closed geodesic on the dodecahedron that passes through exactly one vertex, solving a longstanding open question.
A grove is a spanning forest of a triangular portion of the triangular lattice with a prescribed boundary connectivity. A large random grove exhibits a limit shape i.e. there is a nonrandom algebraic curve outside which the grove is “frozen”. TK Petersen and D Speyer proved that for the uniform measure on groves, the curve is the inscribed circle. I will talk about extensions of their results to probability measures on groves that are periodic in appropriate coordinates. These measures give interesting algebraic curves with higher genus and cusp singularities as limit shapes, as well as new “gaseous” phases.
We consider the primary Brownian loop soup (BLS) layering vertex fields and show the existence of the fields in smooth bounded domains for a suitable range of parameters $\beta$’s. To show this at a fixed cutoff, we use Kahane’s theory of Gaussian multiplicative chaos. On the other hand, when the cutoff is removed, we use WeinerIto chaos expansion to establish that the $\lambda\beta^2$ limit as the intensity $\lambda$ of the BLS diverges and $\beta$ goes to 0 such that $\lambda\beta^2$ is constant, is a complex Gaussian multiplicative Chaos. Based on joint work with F. Camia, A. Gandolfi and G. Peccati.
We consider the collection of near maxima of the discrete logcorrelated Gaussian field in the interior of a box. We provide a rough description of the geometry of the set of near maxima. We show that two near maxima can other either simultaneously either at microscopic or at macroscopic level, but not at mesoscopic level.
Weyl’s law gives an asymptotic formula for the number of eigenfunctions of the LaplaceBeltrami operator on a Riemannian manifold. In 2005, Elon Lindenstrauss and Akshay Venkatesh gave a proof of this law for quite general quotients of semisimple Lie groups. The proof crucially uses the fact that solutions of the corresponding wave equation propagate with finite speed. I will try to explain what they did in the simplest setting of the upper half plane. I will also try to explain why such eigenfunctions, also known as automorphic forms, are of central importance in number theory. The first 45 minutes of the talk should be accessible to students who have a knowledge of some basic complex analysis and calculus.
Proofs of many famous problems in Number Theory (including Fermat’s Last Theorem) rely on understanding some properties about Elliptic Curves, which makes this topic inevitable and very interesting . One of the seven ‘Millennium Prize Problems’ stated by the Clay Mathematics Institute is the Birch SwinnertonDyer Conjecture, which is a statement regarding Elliptic Curves.
In this talk I will briefly describe the idea of a proof of the MordellWeil Theorem and introduce the nSelmer group and TateShafarevitch group associated to Elliptic Curves. I will define the Lfunction and some other arithmetic invariants attached to the Elliptic Curves and state the celebrated BirchSwinnertonDyer Conjecture.
Elliptic curves are important objects of study in various areas of research in modern mathematics. In this talk I will develop some algebraic and geometric tools to understand the group structures on elliptic curves and their Isogenies (certain kind of homomorphisms). I will specialise the general study of Elliptic Curves over finite fields, define zeta functions of associated Elliptic Curve and state the Weil Conjectures.
The main aim of this thesis is to explain the behaviour of some conformal metrics and invariants near a smooth boundary point of a domain in the complex plane. We will be interested in the invariants associated to the Carathéodory metric such as its higher order curvatures that were introduced by Burbea and the AumannCarathéodory rigidity constant, the Sugawa metric and the Hurwitz metric. The basic technical step in all these is the method of scaling the domain near a smooth boundary point.
To estimate the higher order curvatures using scaling, we generalize an old theorem of Suita on the real analyticity of the Caratheodory metric on planar domains and in the process, we show convergence of the Szego and Garabedian kernels as well. By using similar ideas we also show that the AumannCaratheodory rigidity constant converges to 1 near smooth boundary points.
Next on the line is a conformal metric defined using holomorphic quadratic differentials. This was done by T. Sugawa and we will refer to this as the Sugawa metric. It is shown that this metric is uniformly comparable to the quasihyperbolic metric on a smoothly bounded domain.
We also study the Hurwitz metric that was introduced by D. Minda. It’s construction is similar to the Kobayashi metric but the essential difference lies in the class of holomorphic maps that are considered in its definition. We show that this metric is continuous and also strengthen Minda’s theorem about its comparability with the quasihyperbolic metric by estimating the constants in a more natural manner.
Finally, we get some weak estimates on the generalized upper and lower curvatures of the Sugawa and Hurwitz metrics.
Let G be a finitedimensional complex simple Lie algebra and G[t] be its current algebra. The degree grading on the polynomial ring gives a natural grading on G[t] and makes it a graded Lie algebra. Local Weyl modules introduced by Chari and Pressley are interesting finitedimensional graded G[t]modules. Corresponding to a dominant integral weight x of G there is a local Weyl module denoted by W(x). The zeroth graded piece of W(x) is the irreducible Gmodule V(x). In this talk, we discuss how to obtain a basis for W(x) from the basis of V(x) given by GelfandTsetlin patterns, when G is of type A and C.
In this talk we shall see three very different areas of applications of combinatorics in mathematics and computer science, illustrating four different flavours of combinatorial reasoning.
The first problem is on the decomposition, into irreducible representations, of the Weil representation of the full symplectic group associated to a finite module of odd order over a Dedekind domain. We shall discuss how a poset structure defined on the orbits of finite abelian pgroups under automorphisms can be used to show the decomposition of the Weil representation is multiplicityfree, as well as parametrize the irreducible subrepresentations, compute their dimensions in terms of p, etc. Joint works with Amritanshu Prasad (IMSc, Chennai).
Next, we consider lower bounds on the maximum size of an independent set, as well as the number of independent sets, in kuniform hypergraphs, together with an extension to the maximum size of a subgraph of bounded degeneracy in a hypergraph. Joint works with C. R. Subramanian (IMSc, Chennai), Dhruv Mubayi (UIC, Chicago) and Jeff Cooper (UIC, Chicago) and Arijit Ghosh.
Finally, we shall look at Haussler’s Packing Lemma from Computational Geometry and Machine Learning, for set systems of bounded VC dimension. We shall go through its generalisation to the Shallow Packing Lemma for systems of shallow cell complexity, and see how it can be used to prove the existence of small representations of set systems, such as epsilon nets, Mnets, etc. Joint works with Arijit Ghosh (IMSc, Chennai), Nabil Mustafa (ESIEE Paris), Bruno Jartoux (ESIEE Paris) and Esther Ezra (Georgia Inst. Tech., Atlanta).
Let G be a central product of two groups H and K. In this talk, I shall discuss about the second cohomology group of G, having coefficients in a divisible abelian group D with trivial Gaction, in terms of the second cohomology groups of certain quotients of H and K.
For an elliptic curve $E$ over $\mathbb{Q}$, the distribution of the number of points on $E$ mod $p$ has been wellstudied over the last few decades. A relatively recent study is that of extremal primes for a given curve $E$. These are the primes $p$ of good reduction for which the number of points on $E$ mod $p$ is either maximal or minimal. If $E$ is a curve with CM, an asymptotic for the number of extremal primes was determined by James and Pollack. The talk will discuss the nonCM case and focus on obtaining upper bounds. This is joint work with C. David, A. Gafni, A. Malik and C. TurnageButterbaugh.
The aim of this talk is to answer the Nielsen Realisation problem: Can every finite subgroup of the mapping class group can be realised as a subgroup of the isometry group of some hyperbolic surface? In other words, does every finite subgroup fix a point in the Teichmüller space of the surface?
The usual FenchelNielsen coordinates can be thought of as fixing a pants decomposition and keeping track of the length of the boundary of these together with the amount on ‘twist’ while glueing. Shear coordinates on the other hand, instead of using pair of pants, use ideal triangles as the basic pieces. As ideal triangles are unique up to isometry, only the gluing data needs to be tracked in this case. We shall see a convexity result concerning the length of simple closed curves with respect to these coordinates. This result leads to a positive answer for the Nielsen Realisation problem. I’ll be mainly following the paper by Bestvina, Bromberg, Fujiwara, and Souto (AMJ, 2013). Some technical results will be assumed. Familiarity with FenchelNielsen coordinates will be helpful.
Since its introduction, the class of entanglement breaking maps played a crucial role in the study of quantum information science and also in the theory of completely positive maps. In this talk, I will present a certain class of linear maps on matrix algebras that have the property that they become entanglement breaking after composing finite or infinite number of times with themselves. These maps are called eventually entanglement breaking maps. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. It turns out that the set of eventually entanglement breaking maps forms a rich class within the set of all unital completely positive maps. I will relate these maps with irreducible positive linear maps which have been studied a lot in the noncommutative PerronFrobenius theory. Various spectral properties of a ucp map on finite dimensional C*algebras will be discussed. The motivation of this work is the “PPTsquared conjecture” made by M. Christandl that says that every PPT channel, when composed with itself, becomes entanglement breaking. In this work, it is proved that every unital PPTchannel becomes entanglement breaking after finite number of iterations. This is a joint work with Sam Jaques and Vern Paulsen.
A hyperplane arrangement cuts up a vector space into several pieces. The combinatorics and topology of this subdivision is encoded in the associated abelian category of perverse sheaves. This category has an alternate algebraic description due to Kapranov and Schechtman, in terms of representations of a quiver with relations. I will first explain the background and setup. I will then focus on gluing, or “recollement”, which is a recipe to reconstruct the category of perverse sheaves on a space from an open subset and its complement. The aim of the talk is to describe how recollement on the above category of perverse sheaves translates to the category of quiver representations.
A Riemann surface appears in many different guises in mathematics, for example, as a branched cover of the Riemann sphere, an algebraic subset of a projective space, or a complex analytic 1manifold. What is the relationship between various representations of the same Riemann surface? In the first part of my talk, I will describe a conjectural answer to one aspect of this question, due to Mark Green. In the second part, I will talk about ribbons. Ribbons are a particular kind of nonreduced schemes—spaces that carry “infinitesimal functions.” I will explain how studying these seemingly strange objects helps us understand properties of regular Riemann surfaces relevant for Green’s conjecture.
Let K be a bounded domain and K:\Omega \times \Omega \to C be a sesquianalytic function. We show that if \alpha,\beta>0 be such that the functions K^{\alpha} and K^{\beta}, defined on \Omega\times\Omega, are nonnegative definite kernels, then the M_m(C) valued function
K^{(\alpha,\beta)}: =K^{\alpha+\beta}(\partial_i\bar{\partial}_j\log K)_{i,j=1}^ m is also a nonnegative definite kernel on \Omega\times\Omega. Then we find a realization of the Hilbert space (H,K^{(\alpha,\beta)})determined by the kernel K^{(\alpha, \beta)} in terms of the tensor product (H, K^{\alpha})\otimes (H, K^{\beta}).
For two reproducing kernel Hilbert modules (H,K_1) and (H,K_2), let A_n, n\geq 0, be the submodule of the Hilbert module (H, K_1)\otimes (H, K_2) consisting of functions vanishing to order n on the diagonal set \Delta:={(z,z):z\in \Omega}. Setting S_0=A_0^\perp, S_n=A_{n1}\ominus A_{n}, n\geq 1, leads to a natural decomposition of (H, K_1)\otimes (H, K_2) into infinite direct sum \oplus{n=0}^{\infty} S_n. A theorem of Aronszajn shows that the module S_0 is isometrically isomorphic to the pushforward of the module (H,K_1K_2) under the map \iota:\Omega\to \Omega\times\Omega, where iota(z)=(z,z), z\in \Omega. We prove that if K_1=K^{\alpha} and K_2=K^{\beta}, then the module S_1 is isometrically isomorphic to the pushforward of the module (H,K^{(\alpha, \beta)}) under the map \iota. We also show that if a scalar valued nonnegative kernel K is quasiinvariant, then K^{(1,1)} is also a quasiinvariant kernel.
In this talk I will outline a proof of the classical GaussBonnet theorem. The proof uses ChernWeil theory (which is standard) but more interestingly, Morse theory. The proof has appeared in a recent paper of mine in the Journal of Pure and Applied Mathematics of INSA.
Algebraic identities play a pivotal role in the study of many mathematical structures although once understood, they are subconsciously regarded as being obvious or even tautological. For instance, polarization identity in convexity results in Hilbert space theory, Sylvester’s determinant identity in the study of determinantal processes, rank identities in the proof of Cochran’s theorem, etc. In this talk, the main goal is to discuss a systematic approach towards developing a theory of rank identities and determinant identities. This makes contact with Cohn’s work on free ideal rings, particularly free associative algebras over a field. By taking a universal approach, we will see how these methods translate to the world of finite von Neumann algebras (specifically II1 factors) where there is a natural notion of centervalued rank which measures the degree of nondegeneracy of an operator, and a notion of determinant known as the FugledeKadison determinant. We will also see some applications to the (nonselfadjoint) algebraic structure of finite von Neumann algebras and to certain operator inequalities.
In this talk we will describe connections between second order partial differential equations and Markov processes associated with them. This connection had been an active area of research for several decades. The talk is aimed at Analysts and does not assume familiarity with probability theory.
We consider a finite version of the onedimensional Toom model with closed boundaries. Each site is occupied either by a particle of type 0 or of type 1, where the total number of particles of type 0 and type 1 are fixed to be n_0 and n_1 respectively. We call this an (n_0,n_1)system. The dynamics are as follows: the leftmost particle in a block can exchange its position with the leftmost particle of the block to its right.
In this thesis, we have shown the following. Firstly, we have proven a conjecture about the density of 1’s in a system with arbitrary number of 0’s and 1’s. Secondly, we have made progress on a conjecture for the nonequilibrium partition function. In particular, we have given an alternate proof of the conjecture for the (1, n_1)system and (n_0, 1)system, using an enriched twodimensional model.
In this talk, we present a portion of the paper “Sur certains espaces de fonctions holomorphes.I.” by Alexandre Grothendieck. For a function f: O → E, where O is an open subset of the complex plane and E a locally convex topological vector space, we define two notions: holomorphicity and weak derivability. We discuss some properties of the holomorphic functions and see the condition under which these two notions coincide.
For Ω_1 a subset of the Riemann sphere, we consider the space of locally holomorphic maps of Ω_1 into E vanishing at infinity if infinity belongs to Ω_1, denoted by P(Ω_1,E). For two complementary subsets Ω_1 and Ω_2 of the Riemann sphere we prove that given two locally convex topological vector spaces E and F in separating duality, under some general conditions, we can define a separating duality between P(Ω _1,E) and P(Ω_2,F).
We will survey recent progress of birational geometry in positive characteristic fields. As well, we will introduce subadditiviy of Kodaira dimension and canonical bundle formula in positive characteristics. These are joint work with Caucher Birkar, Lei Zhang and Yi Gu.
We will consider the following question:
Given a system of a fixed number of linearly independent homogeneous polynomial equations of a fixed degree with coefficients in a finite field F, what is the maximum number of common solutions they can have in the corresponding protective space over F?
The case of a single homogeneous polynomial (i.e., hypersurface) corresponds to a classical inequality proved by Serre in 1989. For the general case, an elaborate conjecture was made by Tsfasman and Boguslavsky, which was open for almost two decades. We will outline these developments and report on some recent progress.
An attempt will be made to keep the prerequisites at a minimum. If there is time and interest, connections to coding theory or to the problem of counting points of sections of Veronese varieties by linear subvarieties of a fixed dimension will also be outlined.
Kazhdan’s theory loosely states that the complex representation theory of the group G($F$), where G is a split connected reductive group over $\mathbb{Z}$ and $F$ is a nonarchimedean local field of characterstic $p$, can be viewed as a “limit” of the complex representation theories of the groups G($F’$), where $F’$ varies over nonarchimedean local fields of characteristic 0 with residue characteristic $p$. A similar theory for representations of the Galois group Gal($F_s/F$) is due to Deligne. In this talk we will review this theory, discuss some applications of this theory to the local Langlands correspondence, and some ingredients in generalizing the work of Kazhdan and some variants of it to nonsplit groups.
We give examples of two inequivalent smooth structures on the complex projective 9space such that one admits a metric of nonnegative scalar curvature and the other does not. Following this example and the work of Thomas Farrell and Lowell Jones, we also construct examples of closed negatively curved Riemannian 18manifolds, which are homeomorphic but not diffeomorphic to complex hyperbolic manifolds. (Joint work with Samik Basu.)
In this talk, we present our new results on the numerical analysis of nonlocal fracture models. We begin by giving a brief introduction to the Peridynamic theory and the nonlocal potentials considered in our work. We consider a force interaction characterized by a double well potential. Here, one well, near zero strain, corresponds to the linear response of a material, and the other well, for large strain, corresponds to the softening of a material. We show the existence of a regularized model with evolving displacement field in either Hölder space or Sobolev space. Assuming exact solutions in Hölder space, we obtain apriori error estimates due to finite difference approximation. We show that the error converges to zero, uniformly in time, in the mean square norm. The rate depends on the nonlocal length scale and is proportional to 𝐶(Δ𝑡+ℎ𝛾/𝜖2). Here $ℎ$ is the size of mesh, $\epsilon$ is the nonlocal length scale, $\Delta t$ is the size of time step, and $\gamma \in (0,1]$ is the Hölder exponent. $C$ is the constant independent of mesh size and size of time step and may depend on nonlocal length scale through the norm of the exact solution. We also study the finite element approximation and show that the error uniformly converges to zero at the rate C(Δt+h2/ϵ2). We consider piecewise linear continuous elements. Theoretical claims are supported by numerical results. This is a joint work with Dr. Robert Lipton and is funded by the US Army Research Office under grant/award number W911NF1610456.
An embedding of a metric graph $(G, d)$ on a closed hyperbolic surface is called \emph{essential}, if each complementary region has a negative Euler characteristic. We show, by construction, given any metric graph, its metric can be rescaled so that it can be essentially and isometrically embedded on a closed hyperbolic surface. The essential genus $g_e(G)$ of a metric graph $(G, d)$ is the lowest genus of a surface on which such an embedding of the graph is possible. In the next result, we establish a formula to compute $g_e(G)$. Furthermore, we show that for every integer $g\geq g_e(G)$, $(G, d)$ can be essentially and isometrically embedded (possibly after a rescaling the metric $d$) on a surface of genus $g$.
Next, we study minimal embeddings, where each complementary region has Euler characteristic $1$. The maximum essential genus $g_e^{\max}(G)$ a graph $(G, d)$ is the largest genus of a surface on which the graph is minimally embedded. Finally, we describe a method explicitly for an essential embedding of $(G, d)$, where $g_e(G)$ and $g_e^{\max}(G)$ are realized.
Obtaining a sparse representation of high dimensional data is often the first step towards its further analysis. Conventional Vector Autoregressive (VAR) modelling methods applied to such data results in noisy, nonsparse solutions with a too many spurious coefficients. Computing auxiliary quantities such as the Power Spectrum, Coherence and Granger Causality (GC) from such nonsparse models is slow and gives wrong results. Thresholding the distorted values of these quantities as per some criterion, statistical or otherwise, does not alleviate the problem.
We propose two sparse Vector Autoregressive (VAR) modelling methods that work well for high dimensional time series data, even when the number of time points is relatively low, by incorporating only statistically significant coefficients. In numerical experiments using simulated data, our methods show consistently higher accuracy compared to other contemporary methods in recovering the true sparse model. The relative absence of spurious coefficients in our models permits more accurate, stable and efficient evaluation of auxiliary quantities. Our VAR modelling methods are capable of computing Conditional Granger Causality (CGC) in datasets consisting of tens of thousands of variables with a speed and accuracy that far exceeds the capabilities of existing methods.
Using the Conditional Granger Causality computed from our models as a proxy for the weight of the edges in a network, we use community detection algorithms to simultaneously obtain both local and global functional connectivity patterns and community structures in large networks.
We also use our VAR modelling methods to predict time delays in manyvariable systems. Using simulated data from nonlinear delay differential equations, we compare our methods with commonly used delay prediction techniques and show that our methods yield more accurate results.
We apply the above methods to the following real experimental data:
Application to the Hela gene interaction dataset: The network obtained by applying our methods to this dataset yields results that are at least as good as those from a specialized method for analysing gene interaction. This demonstrates that our methods can be applied to any time series data for which VAR modelling is valid.
In addition to the above methods, we apply nonparametric Granger Causality analysis (originally developed by A. Nedungadi, G. Rangarajan et al) to mixed pointprocess and real timeseries data. Extending the computations to Conditional GC and by increasing the efficiency of the original computer code, we can compute the Conditional GC spectrum in systems consisting of hundreds of variables in a relatively short period. Further, combining this with VAR modelling provides an alternate faster route to compute the significance level of each element of the GC and CGC matrices. We use these techniques to analyse mixed Spike Train and LFP data from monkey electrocorticography (ECoG) recordings during a behavioural task. Interpretation of the results of the analysis is an ongoing collaboration.
Classical geometric notion of the YangMills functional has been generalized to the noncommutative context by A. Connes. In this talk we will see a suitable formulation of “subadditivity” and “additivity” of this action functional under a natural hypothesis on spectral triples, and show that in general the YangMills functional is always subadditive. An instance of additivity will be discussed for the case of noncommutative torus.
The main emphasis of this thesis is on developing and implementing linear and quadratic finite element methods for 3dimensional (3D) elliptic obstacle problems. The study consists of a priori and a posteriori error analysis of conforming as well as discontinuous Galerkin methods on a 3D domain. The work in the thesis also focuses on constructing reliable and efficient error estimator for elliptic obstacle problem with inhomogenous boundary data on a 2D domain. Finally, a MATLAB implementation of uniform mesh refinement for a 3D domain is also discussed. In this talk, we first present a quadratic finite element method for three dimensional ellipticobstacle problem which is optimally convergent (with respect to the regularity). We derive a priorierror estimates to show the optimal convergence of the method with respect to the regularity, forthis we have enriched the finite element space with elementwise bubble functions. Further, aposteriori error estimates are derived to design an adaptive mesh refinement algorithm. The result on a priori estimate will be illustrated by a numerical experiment. Next, we discuss on two newly proposed discontinuous Galerkin (DG) finite element methods for the elliptic obstacle problem.Using the localized behavior of DG methods, we derive a priori and a posteriori error estimates forlinear and quadratic DG methods in dimension 2 and 3 without the addition of bubble functions.We consider two discrete sets, one with integral constraints (motivated as in the previous work)and another with point constraints at quadrature points. The analysis is carried out in a unified setting which holds for several DG methods with variable polynomial degree. We then proposea new and simpler residual based a posteriori error estimator for finite element approximation of the elliptic obstacle problem. The results here are two fold. Firstly, we address the influence of the inhomogeneous Dirichlet boundary condition in a posteriori error control of the elliptic obstacle problem. Secondly, by rewriting the obstacle problem in an equivalent form, we derive simpler a posteriori error bounds which are free from min/max functions. To accomplish this, we construct a postprocessed solution ˜uh of the discrete solution uh which satisfies the exact boundaryconditions although the discrete solution uh may not satisfy. We propose two post processing methods and analyse them. We remark that the results known in the literature are either for the homogeneous Dirichlet boundary condition or that the estimator is only weakly reliable in the case of inhomogeneous Dirichlet boundary condition. Finally, we discuss a uniform mesh refinement algorithm for a 3D domain. Starting with orientation of a face of the tetrahedron and orientation of the tetrahedron, we discuss the ideas for nodes to element connectivity and redrefinement of a tetrahedron. We present conclusions and possible extensions for the future works.
In these talks, we’ll outline a simple proof of the Helgason conjecture for Riemannian symmetric spaces of rank one, which gives a correspondence between the eigenfunctions of moderate growth of the Laplacian on the symmetric space with distributions on the distinguished boundary. We’ll then see how to use this to compare quantum resonances and scattering poles on these symmetric spaces. We also intend to indicate progress made towards a new proof of the Helgason conjecture in symmetric spaces of higher rank.
In these talks, we’ll outline a simple proof of the Helgason conjecture for Riemannian symmetric spaces of rank one, which gives a correspondence between the eigenfunctions of moderate growth of the Laplacian on the symmetric space with distributions on the distinguished boundary. We’ll then see how to use this to compare quantum resonances and scattering poles on these symmetric spaces. We also intend to indicate progress made towards a new proof of the Helgason conjecture in symmetric spaces of higher rank.
A geodesic conjugacy between two closed manifolds is a homeomorphism between their unit tangent bundles that takes geodesic flow orbits of one to that of the other in a timepreserving manner. One of the central problems in Riemannian geometry is to understand the extent to which a geodesic conjugacy determines a closed Riemannian manifold itself. While an answer to the question in this generality has yet remained elusive, we give an overeview of results on closed surfaces – the most important illustrative case where a complete picture about questions of geodesic conjugacy rigidity is available.
We begin with a introduction to the notion of a resolution of a module over a Noetherian ring, leading to Betti numbers over local or graded rings, and some problems related to them. Most of the talk will focus on the graded case. One of the recent developments in this area is the resolution of the BoijSoderberg conjectures by EisenbudSchreyer (2009). We discuss the motivation behind the conjectures, with a quick word on the techniques used in their resolution. If time permits, we will see other scenarios where parts of the BoijSoderberg conjectures hold, and discuss obstacles in extending the EisenbudSchreyer techniques in general. This last part is joint work with Rajiv Kumar.
Let G be a group and H a subgroup of G. Let $\pi_1$ and $\pi_2$ be irreducible representations of $G$ and $H$ respectively. By “branching laws” one refers to the rules of describing the vector space $Hom_{H} (\pi_1, \pi_2)$. The well known Langlands’ conjectures predict connections between the representation theory of reductive groups (over local and global fields) and the study of Galois representations. In the nineties, B. Gross and D. Prasad started a systemic investigations into the study of branching laws for the groups of interest to Langlands program, and their predictions are known as GrossPrasad conjectures. We discuss two basic examples of these predictions. A covering group of a reductive groups is a certain central extensions. We discuss branching laws involving covering groups (namely, a two fold central extension of padic $GL_2$) which may be seen as a variation of GrossPrasad conjectures for covering groups.
In a topological space, a point x is said to be a specialization of another point y if x is in the closure of y. Specialization closed subsets occur naturally when considering the notion of support in the Zariski topology in algebra/algebraic geometry. We will define them and show their classical use in classifying certain subcategories. This will allow us to give a characterization of CohenMacaulay local rings. Time permitting, we will also discuss some reductions of Ktheoretic invariants (of derived categories with support).
In these talks, we’ll outline a simple proof of the Helgason conjecture for Riemannian symmetric spaces of rank one, which gives a correspondence between the eigenfunctions of moderate growth of the Laplacian on the symmetric space with distributions on the distinguished boundary. We’ll then see how to use this to compare quantum resonances and scattering poles on these symmetric spaces. We also intend to indicate progress made towards a new proof of the Helgason conjecture in symmetric spaces of higher rank.
In this talk I will give a brief introduction to Liouville firstpassage percolation (LFPP) which is a model for random metric on a finite planar grid graph. It was studied primarily as a way to understand the random metric associated with Liouville quantum gravity (LQG), one of the major open problems in contemporary probability theory. In short the Liouville quantum gravity is a (conjectured) one parameter family of ``canonical’’ random metrics on a Riemann surface. I will discuss some recent results on this metric and the main focus will be on estimates of the typical distance between two points. I will highlight the apparent disagreement of these estimates with a prediction made in the physics literature about the LQG metric. I will also mention some (of many) future problems in this program. Based on a joint work with Jian Ding.
In this talk, we present a portion of the paper “Sur certains espaces de fonctions holomorphes.I.” by Alexandre Grothendieck. For a function f: O → E, where O is an open subset of the complex plane and E a locally convex topological vector space, we define two notions: holomorphicity and weak derivability. We discuss some properties of the holomorphic functions and see the condition under which these two notions coincide.
For Ω_1 a subset of the Riemann sphere, we consider the space of locally holomorphic maps of Ω_1 into E vanishing at infinity if infinity belongs to Ω_1, denoted by P(Ω_1,E). For two complementary subsets Ω_1 and Ω_2 of the Riemann sphere we prove that given two locally convex topological vector spaces E and F in separating duality, under some general conditions, we can define a separating duality between P(Ω_1,E) and P(Ω_2,F).
We consider a finite version of the onedimensional Toom model with closed boundaries. Each site is occupied either by a particle of type 0 or of type 1, where the total number of particles of type 0 and type 1 are fixed to be n_0 and n_1 respectively. We call this an (n_0, n_1)system. The dynamics are as follows: the leftmost particle in a block can exchange its position with the leftmost particle of the block to its right.
In this thesis, we have shown the following. Firstly, we have proven a conjecture about the density of 1’s in a system with arbitrary number of 0’s and 1’s. Secondly, we have made progress on a conjecture for the nonequilibrium partition function. In particular, we have given an alternate proof of the conjecture for the (1, n_1)system and (n_0, 1)system, using an enriched twodimensional model.
We will begin by providing a brief introduction to selfnormalizing concentration inequalities for scalar and finitedimensional martingales, which are very useful in measuring the size of a stochastic process in terms of another, growing, process (the 2009 book of de la Pena et al is a good reference). We will then present a selfnormalizing concentration inequality for martingales that live in the (potentially infinitedimensional) Reproducing Kernel Hilbert Space (RKHS) of a p.s.d. kernel. We will conclude by illustrating applications to online kernel leastsquares regression and multiarmed bandits with infinite action spaces, a.k.a. sequential noisy function optimization [Joint work with Sayak Ray Chowdhury (IISc)].
In these talks, we’ll outline a simple proof of the Helgason conjecture for Riemannian symmetric spaces of rank one, which gives a correspondence between the eigenfunctions of moderate growth of the Laplacian on the symmetric space with distributions on the distinguished boundary. We’ll then see how to use this to compare quantum resonances and scattering poles on these symmetric spaces. We also intend to indicate progress made towards a new proof of the Helgason conjecture in symmetric spaces of higher rank.
The main aim of this talk is to construct a canonical Fisocrystal $H(A)_K$ for an abelian scheme A over a padic complete discrete valuation ring of perfect residue field K. This Fisocrystal $H(A)_K$ comes with a filtration and admits a natural map to the usual Hodge sequence of A. Even though $H(A)_K$ admits a map to the crystalline cohomology of A, the Fstructure on $H(A)_K$ is fundamentally distinct from the one on the crystalline cohomology. When A is an elliptic curve, we further show that $H(A)$ itself is an Fcrystal and that implies a strengthened version of Buium’s result on differential characters. The weak admissibility of $H(A)$ depends on a modular parameter over the points of the moduli of elliptic curves. Hence the Fontaine functor associates a new padic Galois representation to every such weakly admissible Fcrystal $H(A)$. This is joint work with Jim Borger.
Let $\Omega\subset\mathbb{R}^d$ be a unbounded domain. A positive harmonic function u in $\Omega$ that vanishes on the boundary $\partial\Omega$ is called a Martin function on $\Omega$. In this talk, we will discuss various analytic and geometric aspects of Martin functions, namely how fast they grow at infinity, maximum on a slice, and convexity properties of their level lines. If time permits, we will also present a inverse balayage problem from Potential theory.
In recent years, the theory of complex valued analytic functions defined on multiply connected domains has been recognized to have several applications in applied mathematics. In this talk, we will review the theory of SchottkyKlein prime functions and other allied special functions defined on multiply connected circular domains, and discuss the numerical computation of these special functions. We will also briefly present applications to selected problems in fluid dynamics through conformal mapping methods.
In 1980, Gross conjectured a formula for the expected leading term at s=0 of the padic Lfunction associated to characters of totally real number fields. The conjecture states a precise relation between this leading term and padic regulator of punits in an abelian extension. In the talk I will present a precise formulation of the conjecture and describe its relevance for Hilbert’s 12th problem. I will then sketch proof of this conjecture of Gross. This is a joint work with Samit Dasgupta and Kevin Ventullo.
I will present work done with students and colleagues on the collective behaviour of motile organisms, viewed as interacting particles with an autonomous velocity and noise. The talk will include a bit of stochastic processes, some statistical mechanics, and some hydrodynamics. I will discuss experiments, analytical theory and some computation.
Edelman and Greene constructed a bijective correspondence between the reduced words of the reverse permutation (n, n  1, …, 2, 1) and standard Young tableaux of the staircase shape (n  1, …, 1). Recently, motivated by random sorting networks, we studied this bijection and discovered some new properties in joint work with Svante Linusson. In this talk, I will discuss them and, if time permits, also a related project with Linusson and Robin Sulzgruber on random sorting networks where the intermediate permutations avoid the pattern 132.
The classification of homogeneous scalar weighted shifts is known. Recently, Koranyi obtained a large class of inequivalent irreducible homogeneous bilateral 2by2 block shifts. We construct two distinct classes of examples not in the list of Koranyi. It is then shown that these new examples of irreducible homogeneous bilateral 2by2 block shifts, together with the ones found earlier by Koranyi, account for every unitarily inequivalent irreducible homogeneous bilateral 2by2 block shift.
In this talk we will discuss an analytic model theory for pure hypercontractions (introduced by J. Agler) which is analogous to Sz.NagyFoias model theory for contractions. We then proceed to study analytic model theory for doubly commuting ntuples of operators and analyze the structure of joint shift coinvariant subspaces of reproducing kernel Hilbert spaces over polydisc. In particular, we completely characterize the doubly commuting quotient modules of a large class of reproducing kernel Hilbert Modules, in the sense of Arazy and Englis, over the unit polydisc.
Inspired by Halmos, in the second half of the talk, we will focus on the wandering subspace property of commuting tuples of bounded operators on Hilbert spaces. We prove that for a large class of analytic functional Hilbert spaces H_k on the unit ball in $\mathbb{C}^n$, wandering subspaces for restrictions of the multiplication tuple $M_z = (M_{z_1},…,M_{z_n})$ can be described in terms of suitable H_kinner functions. We also prove that H_kinner functions are contractive multipliers and deduce a result on the multiplier norm of quasihomogeneous polynomials as an application. Along the way we also prove a refinement of a result of Arveson on the uniqueness of the minimal dilations of pure row contractions.
Given the recent successfully concluded Polymath project – and the next Polymath that has already started over the weekend – I will present the origins of Polymath and discuss its workings, using slides of myself and of a Polymath collaborator.
Mirror symmetry is a phenomenon predicted by string theory. It allows one to translate questions in symplectic geometry to questions in complex geometry, and vice versa. The homological mirror symmetry program interprets mirror symmetry within the unifying categorical framework of derived noncommutative geometry. After introducing these ideas, I will describe an approach to a theory of Kähler metrics in derived noncommutative geometry. We will see how this leads to (i) a nonArchimedean categorical analogue of the DonaldsonUhlenbeckYau theorem, inspired by symplectic geometry, and (ii) the discovery of a refinement of the HarderNarasimhan filtration which controls the asymptotic behavior of certain geometric flows. This talk is based on joint work with Fabian Haiden, Ludmil Katzarkov, and Maxim Kontsevich.
Let X1 , X2 , X3, … Xn be iid random variables. Laws of large numbers roughly state that the average of these variables converges to the expectation value of each of them when n is large. Various forms of these laws have many applications. The strong and weak laws along with the following three applications will be discussed: a) Cointossing. b) The Weierstrass approximation theorem. c) The Glivenko–Cantelli theorem.
In the second half of this talk, a law of large numbers is proven for spaces with infinite “volume” (measure) as opposed to the above version for probability measures (“volume” =1).
In joint work with Steve Lalley and Jenya Sapir, we study the tessellation of a compact, hyperbolic surface induced by a typical long geodesic segment. We show, that when properly scaled, the local behavior of a typical geodesic is that of a Poisson line process. This implies that the global statistics of the tessellation – for instance, the fraction of triangles – approach those of the limiting Poisson line process.
Determinantal point processes, which first appeared in Dyson’s work on random matrices, arise in diverse problems of asymptotic combinatorics, ergodic theory, representation theory. They have strong chaotic properties: for example, the sineprocess has the Kolmogorov property and satisfies the Central Limit Theorem. A Functional Limit Theorem for the sineprocess has been established in joint work with A. Dymov.
A delicate aspect of the behaviour of a determinantal point process is that particles interact at infinite radius. For instance, Ghosh and Peres showed that, under the sineprocess, the number of particles in a bounded interval is determined by the configuration in the outside of the interval. For determinantal point processes with socalled integrable kernels, an explicit description is given of conditional measures of the process in a bounded interval with respect to the fixed exterior. These conditional measures are given by orthogonal polynomial ensembles with explicitly found weights. A key step in the argument is that projections inducing our processes satisfy a weaker analogue of the division axiom of de Branges: in fact, this weak division property, as shown in joint work with Roman Romanov, characterizes integrable kernels. Similar results for determinantal point processes governed by orthogonal projections onto Hilbert spaces of holomorphic functions are obtained in joint work with Y. Qiu. The talk is based on the preprints
https://arxiv.org/abs/1707.03463, (joint with R. Romanov), https://arxiv.org/abs/1701.00111 (joint with A. Dymov), and the paper
Alexander I. Bufetov, Yanqi Qiu, “Conditional measures of generalized Ginibre point processes”, J. Funct. Anal., 272:11 (2017), 4671–4708.
Terence Tao posted on his blog a question of Apoorva Khare, asking whether the free group on two generators has a length function $l: F_2 \to\mathbb{R}$ (i.e., satisfying the triangle inequality) which is homogeneous, i.e., such that $l(g^n) = nl(g)$. A week later, the problem was solved by an active collaboration of several mathematicians (with a little help from a computer) through Tao’s blog. In fact a more general result was obtained, namely that any homogeneous length function on a group $G$ factors through its abelianization $G/[G, G]$.
I will discuss the proof of this result and also the process of discovery (in which I had a minor role).
Gorenstein rings are very common and significant in many areas of mathematics. The following are two important and widely open problems in commutative algebra and algebraic geometry:
Recently, in a joint work with M.E. Rossi, we obtained partial results to these problems in some cases (Kalgebras of socle degree 4). In this talk, we will discuss these new developments.
The main emphasis of this thesis is on developing and implementing linear and quadratic finite element methods for 3dimensional (3D) elliptic obstacle problems. The study consists of a priori and a posteriori error analysis of conforming as well as discontinuous Galerkin methods on a 3D domain. The work in the thesis also focuses on constructing reliable and efficient error estimator for elliptic obstacle problem with inhomogenous boundary data on a 2D domain.
Finally, a MATLAB implementation of uniform mesh refinement for a 3D domain is also discussed. In this talk, we first present a quadratic finite element method for three dimensional ellipticobstacle problem which is optimally convergent (with respect to the regularity). We derive a priorierror estimates to show the optimal convergence of the method with respect to the regularity, forthis we have enriched the finite element space with elementwise bubble functions. Further, aposteriori error estimates are derived to design an adaptive mesh refinement algorithm. The result on a priori estimate will be illustrated by a numerical experiment. Next, we discuss on two newly proposed discontinuous Galerkin (DG) finite element methods for the elliptic obstacle problem.Using the localized behavior of DG methods, we derive a priori and a posteriori error estimates forlinear and quadratic DG methods in dimension 2 and 3 without the addition of bubble functions.We consider two discrete sets, one with integral constraints (motivated as in the previous work)and another with point constraints at quadrature points. The analysis is carried out in a unified setting which holds for several DG methods with variable polynomial degree. We then proposea new and simpler residual based a posteriori error estimator for finite element approximationof the elliptic obstacle problem. The results here are two fold. Firstly, we address the influenceof the inhomogeneous Dirichlet boundary condition in a posteriori error control of the elliptic obstacle problem. Secondly, by rewriting the obstacle problem in an equivalent form, we derive simpler a posteriori error bounds which are free from min/max functions. To accomplish this, we construct a postprocessed solution uh of the discrete solution uh which satisfies the exact boundaryconditions although the discrete solution uh may not satisfy. We propose two post processing methods and analyse them. We remark that the results known in the literature are either for the homogeneous Dirichlet boundary condition or that the estimator is only weakly reliable in the case of inhomogeneous Dirichlet boundary condition. Finally, we discuss a uniform mesh refinement algorithm for a 3D domain. Starting with orientation of a face of the tetrahedron and orientation of the tetrahedron, we discuss the ideas for nodes to element connectivity and redrefinement of a tetrahedron. We present conclusions and possible extensions for the future works.
This talk will focus on the rooted GaltonWatson (GW) tree. The offspring distribution we consider is Poisson(\lambda), but our results extend to more general distributions. First order properties on rooted trees capture the local, finite structures inside the tree. We analyze the probabilities of first order properties under the GW measure, and obtain these probabilities as fixed points of contracting distributional maps. Moreover, we come up with nice functions that express these probabilities conditioned on survival of the GW tree. This is joint work with Joel Spencer.
A version of the uniformization theorem states that any compact Riemann surface admits a metric of constant curvature. A deep and important problem in complex geometry is to characterize Kahler manifolds admitting constant scalar curvature Kahler (cscK) metrics or extremal Kahler metrics. Even in the special case of KahlerEinstein metrics, starting with the work of Yau and Aubin in the 1970’s, a complete solution was obtained only very recently by ChenDonaldsonSun (and Tian). Their main results says that a Fano manifold admits a KahlerEinstein metric if and only if it is Kstable. I will survey some of these recent developments, and then focus on a refinement obtained in collaboration with Gabor Szekelyhidi. This has led to the discovery of new KahlerEinstein manifolds. If time permits, I will also talk about some open problems on constructing cscK and extremal metrics on blowups of extremal manifolds, and mention some recent progress.
Homogenization of boundary value problems posed on rough domains has paramount importance in real life problems. Materials with oscillating (rough) boundary are used in many industrial applications like micro strip radiator and nano technologies, biological systems, fractaltype constructions, etc. In this talk, we will be focusing on homogenization of optimal control problems. We will begin with homogenization of a boundary control problem on an oscillating pillar type domain. Then, we will consider a timedependent control problem posed on a little more general domain called branched structure domain. Asymptotic analysis of this interior control problem will be explained. Next, we will present a generalized unfolding operator that we have developed for a general oscillatory domain. Using this unfolding operator, we study the homogenization of a nonlinear elliptic problem on this general highly oscillatory domain. Also, we analyse an optimal control problem on a circular oscillating domain with the assistance of this operator. Finally, we consider a nonlinear optimal control problem on the above mentioned general oscillatory domain and study the asymptotic behaviour.
Derived category is an important tool in homological algebra invented by Grothendieck and Verdier. In these days derived categories play important roles in many areas of algebraic geometry. In this talk, I will discuss derived categories and their applications to study Ulrich bundles on some Fano manifolds.
In this talk, I will tell you about the BoreldeSibenthal theorem which gives the classification of all maximal closed subroot systems of finite crystallographic root systems. I will start my talk by introducing the notion of finite root systems and it’s closed subroot systems.
The concept of root system is very fundamental in the theory of Lie groups and Lie algebras. Especially they play a vital role in the classification of finite dimensional semisimple Lie algebras. Closed subroot systems of finite root systems naturally appear in the BoreldeSibenthal theory which describes the closed connected subgroups of a compact Lie group that have maximal rank. The classification of closed subroot systems is essential in the classification of semisimple subalgebras of semisimple Lie algebras.
Through out this talk, we will try to stay within the theory of root systems and reflection groups. No knowledge of Lie algebras or Lie groups will be assumed. If time permits I will discuss about my joint work with R. Venkatesh which gives explicit descriptions of the maximal closed subroot systems of affine root systems.
We will present results obtained in collaboration with J. Burgos and M. Sombra. These extend the well known dictionary between the geometric properties of toric varieties and convex geometry. In particular, we give combinatorial descriptions of classical invariants of arithmetic geometry, such as metric, height or essential minimum.
In this talk, we prove the unique factorization property of Schur functions. This fundamental property of Schur functions was first observed and proved by C. S. Rajan in 2004. I give a different proof of this beautiful fact which I jointly obtained with my adviser S. Viswanath. I begin my talk with introducing the Schur functions and their connections with representation theory of general linear groups. Basic knowledge of elementary algebra will be assumed like group theory and linear algebra. If time permits, I will tell you about the possible generalizations of this result.
It is a wellknown result from Hermann Weyl that if alpha is an irrational number in [0,1) then the number of visits of successive multiples of alpha modulo one in an interval contained in [0,1) is proportional to the size of the interval. In this talk we will revisit this problem, now looking at finer joint asymptotics of visits to several intervals with rational end points. We observe that the visit distribution can be modelled using random affine transformations; in the case when the irrational is quadratic we obtain a central limit theorem as well. Not much background in probability will be assumed. This is in joint work with Jon Aaronson and Michael Bromberg.
We consider the computation of nvariate polynomials over a field F via a sequence of arithmetic operations such as additions, subtractions, multiplications, divisions, etc. It has been known for at five decades now that a random nvariate polynomial of degree n is hard to compute. Yet not a single explicit polynomial is provably known to be hard to compute (although we have a lot of good candidates). In this talk we will first describe this problem and its relationship to the P vs NP problem. We will then describe several partial results on this problem, both old and new, along with a more general approach/framework that ties together most of these partial results.
A partition of integer $n$ is a sequence $\lambda = (\lambda_1, \lambda_2, \cdots, \lambda_k, \cdots)$ of non negative integers such that $\lambda_i \ge \lambda_{i+1}$ and $\sum_i \lambda_i = n$. It follows that there are finitely many nonzero $\lambda_i$’s. One can restrict the number of them and the largest value of $\lambda_i$ and observe that the set of such partitions form a poset under a suitable relation. Several natural questions arise in this setting. Some of these questions have been answered by Proctor, Stanley and Kathy O’Hara among others. We take a look at some techniques as given by Stanley and ask if it is possible to extend it to higher dimensions.
I will describe our work that establishes (akin to) von Neumann’s conjecture on condition number, the ratio of the largest and the smallest singular values, for sparse random matrices. Nonasymptotic bounds on the extreme singular values of large matrices have numerous uses in the geometric functional analysis, compressed sensing, and numerical linear algebra. The condition number often serves as a measure of stability for matrix algorithms. Based on simulations von Neumann and his collaborators conjectured that the condition number of a random square matrix of dimension $n$ is $O(n)$. During the last decade, this conjecture was proved for dense random matrices.
Sparse matrices are abundant in statistics, neural networks, financial modeling, electrical engineering, and wireless communications. Results for sparse random matrices have been unknown and requires completely new ideas due to the presence of a large number of zeros. We consider a sparse random matrix with entries of the form $\xi_{i,j} \delta_{i,j}, \, i,j=1,\ldots,n$, such that $\xi_{i,j}$ are i.i.d. with zero mean and unit variance and $\delta_{i,j}$ are i.i.d. Ber$(p_n)$, where $p_n \downarrow 0$ as $n \to \infty$. For $p_n < \frac{\log n}{n}$, this matrix becomes noninvertible, and hence its condition number equals infinity, with probability tending to one. In this talk, I will describe our work showing that the condition number of such sparse matrices (under certain assumptions on the moments of $\{\xi_{i,j}\}$) is $O(n^{1+o(1)})$ for all $p_n > \frac{\log n}{n}$, with probability tending to one, thereby establishing the optimal analogous version of the von Neumann’s conjecture on condition number for sparse random matrices.
This talk is based on a sequence of joint works with Mark Rudelson.
We shall discuss a theorem of Bernstein published in 1975 about the number of common solutions of n complex polynomials in n variables in terms of the mixed volumes of their Newton polytopes. This is a far reaching generalisation of the Fundamental Theorem of Algebra and Bezout’s Theorem about intersections of plane algebraic curves. If time permits, we shall sketch a proof of Bernstein’s theorem using Hilbert functions of monomial ideals in polynomial rings.
I will give a gentle historical (and ongoing) account of matrix positivity and of operations that preserve it. This is a classical question studied for much of the past century, including by Schur, PolyaSzego, Schoenberg, Kahane, Loewner, and Rudin. It continues to be pursued actively, for both theoretical reasons as well as applications to highdimensional covariance estimation. I will end with some recent joint work with Terence Tao (UCLA).
The entire talk should be accessible given a basic understanding of linear algebra/matrices and onevariable calculus. That said, I will occasionally insert technical details for the more advanced audience. For example: this journey connects many seemingly distant mathematical topics, from Schur (products and complements), to spheres and Gram matrices, to Toeplitz and Hankel matrices, to rank one updates and Rayleigh quotients, to CauchyBinet and JacobiTrudi identities, back full circle to Schur (polynomials).
In this talk we discuss a formulation of Quantum Theory of Dark matter and discuss some operators on Hilbert spaces of singular measures.
The Pick–Nevanlinna interpolation problem in its fullest generality is as follows:
Given domains $D_1$, $D_2$ in complex Euclidean spaces, and a set ${(z_i,w_i): 1\leq i\leq N}\subset D_1\times D_2$, where $z_i$ are distinct and $N$ is a positive integer $\geq 2$, find necessary and sufficient conditions for the existence of a holomorphic map $F$ from $D_1$ into $D_2$ such that $F(z_i) = w_i$, $1\leq N$.
When such a map $F$ exists, we say that $F$ is an interpolant of the data. Of course, this problem is intractable at the above level of generality. However, two special cases of the problem – which we shall study in this thesis – have been of lasting interest:
INTERPOLATION FROM THE POLYDISC TO THE UNIT DISC: This is the case $D_1 = D^n$ and $D_2 = D$, where $D$ denotes the open unit disc in the complex plane and $n$ is a positive integer. The problem itself originates with Georg Pick’s wellknown theorem (independently discovered by Nevanlinna) for the case $n=1$. Much later, Sarason gave another proof of Pick’s result using an operatortheoretic approach, which is very influential. Using this approach for $n\geq 2$, Agler–McCarthy provided a solution to the problem with the restriction that the interpolant is in the Schur–Agler class. This is notable because when $n = 2$ the latter result completely solves the problem for the case $D_1 = D^2$, $D_2 = D$. However, Pick’s approach can also be effective for $n\geq 2$. In this thesis, we give an alternative characterization for the existence of a $3$point interpolant based on Pick’s approach and involving the study of rational inner functions.
Cole, Lewis and Wermer lifted Sarason’s approach to uniform algebras – leading to a characterization for the existence of an interpolant in terms of the positivity of a large, rather abstractlydefined family of $(N\times N)$ matrices. McCullough later refined their result by identifying a smaller family of matrices. The second result of this thesis is in the same vein, namely: it provides a characterization of those data that admit a $D^n$to$D$ interpolant in terms of the positivity of a family of matrices parametrized by a class of polynomials.
INTERPOLATION FORM THE UNIT DISC TO THE SPECTRAL UNIT BALL: This is the case $D_1 = D$ and $D_2$ is the set of all $(n\times n)$ matrices with spectral radius less than $1$. The interest in this arises from problems in Control Theory. Bercovici, Fois and Tannenbaum adapted Sarason’s methods to give a (somewhat hardtocheck) characterization for the existence of an interpolant under a very mild restriction. Later, Agler–Young established a relation between the interpolation problem in the spectral unit ball and that in the symmetrized polydisc – leading to a necessary condition for the existence of an interpolant. Bharali later provided a new inequivalent necessary condition for the existence of an interpolant for any $n$ and $N=2$. We shall present a necessary condition for the existence of a $3$point interpolant. This we shall achieve by modifying Pick’s approach and applying the aforementioned result due to Bharali.
In this talk we will discuss an analytic model theory for pure hyper contractions (introduced by J. Agler) which is analogous to Sz.NagyFoias model theory for contractions. We then proceed to study analytic model theory for doubly commuting $n$tuples of operators and analyze the structure of joint shift coinvariant subspaces of reproducing kernel Hilbert spaces over polydisc. In particular, we completely characterize the doubly commuting quotient modules of a large class of reproducing kernel Hilbert Modules, in the sense of Arazy and Englis, over the unit polydisc.
Inspired by Halmos, in the second half of the talk, we will focus on the wandering subspace property of commuting tuples of bounded operators on Hilbert spaces. We prove that for a large class of analytic functional Hilbert spaces $H_k$ on the unit ball in $\mathbb{C}^n$, wandering subspaces for restrictions of the multiplication tuple $M_z = (M_{z_1},…,M_{z_n})$ can be described in terms of suitable $H_k$inner functions. We also prove that $H_k$inner functions are contractive multipliers and deduce a result on the multiplier norm of quasihomogeneous polynomials as an application. Along the way we also prove a refinement of a result of Arveson on the uniqueness of the minimal dilations of pure row contractions.
It is known that the characteristic function $\theta_T$ of a homogeneous contraction $T$ with an associated representation $\pi$ is of the form $\theta_T(a) = \sigma_{L}(\phi_a)^{*} \theta(0) \sigma_{R}(\phi_a),$ where, $\sigma_{L}$ and $\sigma_{R}$ are projective representation of the M"{o}bius group M"{o}b with a common multiplier. We give another proof of the “product formula’’.
Also, we prove that the projective representations $\sigma_L$ and $\sigma_R$ for a class of multiplication operators, the two representations $\sigma_{R}$ and $\sigma_{L}$ are unitarily equivalent to certain known pair of representations $\sigma_{\lambda + 1}$ and $\sigma_{\lambda  1},$ respectively. These are described explicitly.
Let $G$ be either (i) the direct product of $n$copies of the biholomorphic automorphism group of the disc or (ii) the biholomorphic automorphism group of the polydisc $\mathbb D^n.$
A commuting tuple of bounded operators $\mathsf{T} = (T_1, T_2,\ldots ,T_n)$ is said to be $G$homogeneous if the joint spectrum of $\mathsf{T}$ lies in $\overline{\mathbb{D}}^n$ and $\varphi(\mathsf{T}),$ defined using the usual functional calculus, is unitarily equivalent with $\mathsf{T}$ for all $\varphi \in G.$
We show that a commuting tuple $\mathsf{T}$ in the CowenDouglas class of rank $1$ is $G$homogeneous if and only if it is unitarily equivalent to the tuple of the multiplication operators on either the reproducing kernel Hilbert space with reproducing kernel $\prod_{i = 1}^{n} \frac{1}{(1  z_{i}\overline{w}_{i})^{\lambda_i}}$ or $\prod_{i = 1}^{n} \frac{1}{(1  z_{i}\overline{w}_{i})^{\lambda}},$ where $\lambda,$ $\lambda_i$, $1 \leq i \leq n,$ are positive real numbers, according as $G$ is as in (i) or (ii).
Let $\mathsf T:=(T_1, \ldots ,T_{n1})$ be a $G$homogeneous $(n1)$tuple of rank $1$ CowenDouglas class, where $G$ is the the direct product of $n1$copies of the biholomorphic automorphism group of the disc. Let $\hat{T}$ be an irreducible homogeneous (with respect to the biholomorphic group of automorphisms of the disc) operator in the CowenDouglas class on the disc of rank $2$. We show that every irreducible $G$homogeneous operator, $G$ as in (i), of rank $2$ must be of the form $(T_1\otimes I_{\widehat{H}},\ldots , T_{n1}\otimes I_{\widehat{H}}, I_H \otimes \hat{T}).$
We also show that if $G$ is chosen to be the group as in (ii), then there are no irreducible $G$homogeneous operators of rank $2$.
In this talk the interplay between the combinatorial structures of finite simple graphs and various homological invariants like regularity, depth etc. of related algebraic objects shall be discussed. Some open problems, recent developments and ongoing projects shall be discussed. In particular some new techniques developed in my thesis to study CastelnuovoMumford regularity of algebraic objects related to graphs shall be discussed in some details.
The aim of this talk is to give an overview of some recent results in two interconnected areas:
a) Random discrete structures: One major conjecture in probabilistic combinatorics, formulated by statistical physicists using nonrigorous arguments and enormous simulations in the early 2000s, is as follows: for a wide array of random graph models on $n$ vertices and degree exponent $\tau>3$, typical distance both within maximal components in the critical regime as well as on the minimal spanning tree on the giant component in the supercritical regime scale like $n^{\frac{\tau\wedge 4 3}{\tau\wedge 4 1}}$. In other words, the degree exponent determines the universality class the random graph belongs to. The mathematical machinery available at the time was insufficient for providing a rigorous justification of this conjecture.
More generally, recent research has provided strong evidence to believe that several objects, including (i) components under critical percolation, (ii) the vacant set left by a random walk, and (iii) the minimal spanning tree, constructed on a wide class of random discrete structures converge, when viewed as metric measure spaces, to some random fractals in the GromovHausdorff sense, and these limiting objects are universal under some general assumptions. We will discuss recent developments in a larger program aimed at a complete resolution of these conjectures.
b) Stochastic geometry: In contrast, less precise results are known in the case of spatial systems. We discuss a recent result concerning the length of spatial minimal spanning trees that answers a question raised by Kesten and Lee in the 90’s, the proof of which relies on a variation of Stein’s method and a quantification of a classical argument in percolation theory.
Based on joint work with Louigi AddarioBerry, Shankar Bhamidi, Nicolas Broutin, Sourav Chatterjee, Remco van der Hofstad, and Xuan Wang.
The notion of a weakly proregular sequence in a commutative ring was first formally introduced by AlonsoJeremiasLipman (though the property that it formalizes was already known to Grothendieck), and further studied by Schenzel and PortaShaulYekutieli: a precise definition of this notion will be given during the talk. An ideal in a commutative ring is called weakly proregular if it has a weakly proregular generating set. Every ideal in a commutative noetherian ring is weakly proregular. It turns out that weak proregularity is the appropriate context for the MatlisGreenleesMay (MGM) equivalence: given a weakly proregular ideal I in a commutative ring A, there is an equivalence of triangulated categories (given in one direction by derived local cohomology and in the other by derived completion at I) between cohomologically Itorsion (i.e. complexes with Itorsion cohomology) and cohomologically Icomplete complexes in the derived category of A.
In this talk, we will give a categorical characterization of weak proregularity: this characterization then serves as the foundation for a noncommutative generalisation of this notion. As a consequence, we will arrive at a noncommutative variant of the MGM equivalence. This work is joint with Amnon Yekutieli.
Dualizing complexes were first introduced in commutative algebra and algebraic geometry by Grothendieck and play a fundamental role in SerreGrothendieck duality theory for schemes. The notion of a dualizing complex was extended to noncommutative ring theory by Yekutieli. There are existence theorems for dualizing complexes in the noncommutative context, due to Van den Bergh, Wu, Zhang, and Yekutieli amongst others.
Most considerations of dualizing complexes over noncommutative rings are for algebras defined over fields. There are technical difficulties involved in extending this theory to algebras defined over more general commutative base rings. In this talk, we will describe these challenges and how to get around them. Time permitting, we will end by presenting an existence theorem for dualizing complexes in this more general setting.
The material described in this talk is work in progress, carried out jointly with Amnon Yekutieli.
The field of geodynamics deals with the large scale forces shaping the Earth. Computational geodynamics, which uses numerical modeling, is one of the most important tools to understand the mechanisms within the deep Earth. With the help of these numerical models we can address some of the outstanding questions regarding the processes operating within the Earth’s interior and their control on shaping the surface of the planet. Much of Earth’s surface observations such as gravity anomalies, plate motions, dynamic topography, lithosphere stress field, owe their origin to convection within the Earth’s mantle. While we understand the basic nature of such flow in the mantle, a lot remains unexplained, including the complex rheology of the deep mantle and how this density driven convective flow couples with the shallow surface. In this talk I will discuss how my group is using numerical modeling to understand the influence of the deep mantle on surface observations.
For a finite abelian group $G$ with $G = n$, the Davenport Constant $DA(G)$ is defined to be the least integer $k$ such that any sequence $S$ with length $k$ of elements in $G$ has a nonempty $A$ weighted zerosum subsequence. For certain sets $A$, we already know the precise value of constant corresponding to the cyclic group $\mathbb{Z} / n \mathbb{Z}$. But for different group $G$ and $A$, the precise value of it is still an open question. We try to find out bounds for these combinatorial invariant for random set $A$. We got few results in this connection. In this talk I would like to present those results and discuss about an extremal problem related to this combinatorial invariant.
The study of weighted inequalities in Classical Harmonic Analysis started in 70’s, when B. Muckenhoupt characterised in 1972 the weights $w$ for which the Hardy–Littlewood maximal function is bounded in $L^p(w)$. At that time the question about how the operator depended on the constant associated with $w$, which we denote by $[w]_{A_p}$, was not considered (i.e., quantitative estimates) were not investigated.
From the beginning of 2000’s, a great activity has been carried out in order to obtain the sharp dependence for singular integral operators, reaching the solution of the socalled $A_2$ conjecture by T. P. H\“ytonen.
In this talk we consider operators with homogeneous singular kernels, on which we assume smoothness conditions that are weaker than the standard ones (this is why they are called rough). The first qualitative weighted estimates are due to J. Duoandikoetxea and J. L. Rubio de Francia. For the norm of these operators in the space $L^2(w)$ we obtain a quantitative estimate which is quadratic in the constant $[w]_{A_2}$.
The results are based on a classical decomposition of the rough operators as a sum of other operators with a smoother kernel, for which a quantitative reelaboration of a dyadic decomposition proposed by M. T. Lacey is applied.
We will overview as well the most recent advances, mainly associated with quantitative estimates for these rough singular integrals. In particular, CoifmanFefferman type inequalities (which are new even in their qualitative version), weighted $A_p$$A_{\infty}$ inequalities and a quantitative version of weak $(1,1)$ estimates will be shown.
Conformal blocks are refined invariants of tensor product of representations of a Lie algebra that give a special class of vector bundles on the moduli space of curves. In this talk, I will introduce conformal blocks and explore connections to questions in algebraic geometry and representation theory. I will also focus on some ``strange” dualities in representation theory and how they give equalities of divisor classes on the moduli space of curves.
We shall consider sampling procedures to construct subgraphs to infer properties of a network. Specifically, we shall consider sampling procedures in the context of dense and sparse graph limits. We will explore open questions and interesting explorations at the undergraduate level. The talk will be accessible to a general audience.
Given a metric space (X, d), there are several notions of it being negatively curved. In this talk, we single out certain consequences of negative curvature – which are themselves weaker than (X, d) being negatively curved – that turn out to be very useful in proving results about holomorphic maps. We shall illustrate what this means by giving a proof of the WolffDenjoy theorem. (This theorem says that given a holomorphic selfmap f of the open unit disc, either f has a fixed point in the open unit disc or there exists a point p on the unit circle such that ALL orbits under the successive iterates of f approach p.) For most of this talk, we shall focus on metric spaces or on geometry in one complex variable. Towards the end, we shall briefly point out what can be proved in domains in higher dimensions that have the aforementioned negativecurvaturetype properties. This part of the talk is joint work with Andrew Zimmer.
The RiemannRoch theorem is fundamental to algebraic geometry. In 2006, Baker and Norine discovered an analogue of the RiemannRoch theorem for graphs. In fact, this theorem is not a mere analogue but has concrete relations with its algebrogeometric counterpart. Since its conception this topic has been explored in different directions, two significant directions are i. Connections to topics in discrete geometry and commutative algebra ii. As a tool to studying linear series on algebraic curves. We will provide a glimpse of these developments. Topics in commutative algebra such as Alexander duality and minimal free resolutions will make an appearance. This talk is based on my dissertation and joint work with i. Bernd Sturmfels, ii. FrankOlaf Schreyer and John Wilmes and iii. an ongoing work with Alex Fink.
The Hadamard product of two matrices is formed by multiplying corresponding entries, and the Schur product theorem states that this operation preserves positive semidefiniteness.
It follows immediately that every analytic function with nonnegative Maclaurin coefficients, when applied entrywise, preserves positive semidefiniteness for matrices of any order. The converse is due to Schoenberg: a function which preserves positive semidefiniteness for matrices of arbitrary order is necessarily analytic and has nonnegative Maclaurin coefficients.
For matrices of fixed order, the situation is more interesting. This talk will present recent work which shows the existence of polynomials with negative leading term which preserve positive semidefiniteness, and characterises precisely how large this term may be. (Joint work with D. Guillot, A. Khare and M. Putinar.)
Commutators of singular integral operators with BMO functions were introduced in the seventies by CoifmanRochberg and Weiss. These operators are very interesting for many reasons, one of them being the fact that they are more singular than CalderonZygmund operators. In this lecture we plan to give several reasons showing the “bad” behavior of these operators.
I will introduce the concepts of backward, forward, and covariant Lyapunov vectors (that are basically “eigenfunctions” of certain operators) for a dynamical system and discuss their relevance in studying various stability results, both for the system itself and for nonlinear filtering problem, which will also be introduced along the way. The “relevance” to nonlinear filters is in the form of open questions whose answers (as a set of conjectures) may be gleaned from numerical results and linear filtering theory.
Given n random points on a manifold embedded in a Euclidean space, we wish to understand what topological features of the manifold can be inferred from the geometry of these points. One procedure is to consider union of Euclidean balls of radius r around the points and study the topology of this random set (i.e., the union of balls). A more robust method (known as persistent homology) of inferring the topology of the underlying manifold is to study the evolution of topology of the random set as r varies. What topological information (for example, Betti numbers and some generalizations) about the underlying manifold can we glean for different choices of r ? This question along with some partial answers in the recent years will be the focus of the talk. I shall try to keep the talk mostly selfcontained assuming only knowledge of basic probability and pointset topology.
The goal of this talk is to present an algorithm which takes a compact square complex belonging to a special class as input and decides whether its fundamental group splits as a free product. The special class is built by attaching tubes to finite graphs in such a way that they satisfy a nonpositive curvature condition. This construction gives rise to a rich class of complexes, including, but not limited to, closed surfaces of positive genus. The algorithm can be used to deduce the celebrated Stallings theorem for this special class, as also the well known Grushko decomposition theorem.
A group is cyclic iff its subgroup lattice is distributive. Ore’s generalized one direction of this result. We will discuss a dual version of Ore’s result, for any boolean interval of finite groups under the assumption that the dual Euler totient of the interval is nonzero. We conjecture that the dual Euler totient is always nonzero for boolean intervals. We will discuss some techniques which may be helpful in proving it. We first see that dual Euler totient of an interval of finite groups is the Mobius invariant (upto a sign) of its coset poset P. Next in the boolean group complemented case, we prove that P is CohenMacaulay, using the existence of an explicit ELlabeling. We then see that nontrivial betti number of the order complex is nonzero, and so is the dual Euler totient.
Quasialgebras were introduced as algebras in a monoidal category. Since the associativity constraints in these categories are allowed to be nontrivial, the class of quasialgebras contains various important examples of nonassociative algebras like the octonions and other Cayley algebras. The diamond lemma is a reduction method used in algebra. The original diamond lemma was stated in graph theory by Newman which was later generalized to associative algebras by Bergman. In this talk, we will see the analog of this lemma for the group graded quasialgebras with some interesting examples like octonion algebra and generalized octonions
Vortex streets are a common feature of fluid flows at high Reynolds numbers and their study is now well developed for incompressible fluids. Much less is known, however, about compressible vortex streets. A fundamental reason appears to be the inapplicability of the point vortex model to compressible flows. In this talk, we discuss point vortices in the context of weakly compressible flows and elaborate on the problems involved. We then adopt the hollow vortex model where each vortex is modelled as a finitearea constant pressure region with nonzero circulation. For weakly compressible flows steady hollow vortex solutions are well known to be candidates for the leading order solution in a perturbative RayleighJansen expansion of a compressible flow. Here we give details of that expansion based on the vortex street solutions of Crowdy & Green (2012). Physical properties of the compressible vortex streets are described. Our approach uses the ImaiLamla method coupled with analytic function theory and conformal mapping. (Joint work with Darren Crowdy)
The formalism of an “abelian category” is meant to axiomatize the operations of linear algebra. From there, the notion of “derived category” as the category of complexes “upto quasiisomorphisms” is natural, motivated in part by topology. The formalism of tstructures allows one to construct new abelian categories which are quite useful in practice (giving rise to new cohomology theories like intersection cohomology, for example). In this talk we want to discuss a notion of punctual (=”pointwise”) gluing of tstructures which is possible in the context of algebraic geometry. The essence of the construction is classical and well known, but the new language leads to useful constructions in the motivic world.
In this talk, I would continue dealing with Sabra shell model of Turbulence and study one of the important questions for fluid flow problems namely, finding controls which are capable of preserving the invariant quantities of the flow. Controls are designed in the feedback form such that resultant controlled flow will preserve certain physical properties of the state such as enstrophy, helicity. We use the theory of nonlinear semigroups and represent the feedback control as a multivalued feedback term which lies in the normal cone of the convex constraint space under consideration.
Graphpartitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to error correcting codes, sampling algorithms, metric embeddings, among others, and to practitioners, as algorithms for graph partitioning can be used as fundamental building blocks in many applications. One of the central problems studied in this field is the sparsest cut problem, where we want to compute the cut which has the least ratio of number of edges cut to size of smaller side of the cut. This ratio is known as the expansion of the cut. In this talk, I will talk about higher order variants of expansion (i.e. notions of expansion corresponding to partitioning the graph into more than two pieces, etc.), and how they relate to the graph’s eigenvalues. The proofs will also show how to use the graph’s eigenvectors to compute partitions satisfying these bounds. Based on joint works with Prasad Raghavendra, Prasad Tetali and Santosh Vempala.
In this lecture I am going to present control problems associated with shell models of Turbulence. Shell models of turbulence are simplified caricatures of equations of fluid mechanics in wavevector representation. They exhibit anomalous scaling and local nonlinear interactions in wave number space. We would like to study control problem related to one such widely accepted shell model of turbulence known as sabra shell model. We associate two cost functionals: one ensures minimizing turbulence in the system and the other addresses the need of taking the ow near a priori known state. We derive the optimal controls in terms of the solution of adjoint equation for corresponding linearised problems.
Understanding the origins of intermittency in turbulence remains one of the most fundamental challenges in applied mathematics. In recent years there has been a fresh attempt to understand this problem through the development of the method of Fourier decimation. In this talk, we will review these recent results and analyse the role of precise numerical simulations in understanding the mathematics of the NavierStokes and Euler equations.
It is generally well known that there is an innate notion of things like isomorphisms or epimorphisms. This allows us to talk about isomorphisms or epimorphisms of various objects: groups, rings, algebras, etc. In other words, “isomorphism” is really a categorical notion. However, it is not so well known that finiteness itself is alsocategorical. In this talk, we will discuss how finiteness applies to various categories. This will allow usto see finite sets, finite dimensional vector spaces, finitely generated algebras and compact sets as manifestations of the same basic idea.
Consider the infinite Ginibre ensemble (the distributional limit of the eigenvalues of nxn random matrices with i.i.d. standard complex Gaussian entries) in the complex plane. For a bounded set U, let H_r(U) denote the probability (hole probability) that no points of infinite Ginibre ensemble fall in the region rU. We study the asymptotic behavior of H_r(U) as r–>\infty. Under certain conditions on U we show that \log H_r(U)=C_U.r^4 (1+o(1)) as r–> \infty. Using potential theory, we give an explicit formula for C_U in terms of the minimum logarithmic energy of the set with a quadratic external field. We calculate C_U explicitly for some special sets such as the annulus, cardioid, ellipse, equilateral triangle and half disk.
Moreover, we generalize the above hole probability results for a class of determinantal point processes in the complex plane.
In algebraic geometry the concept of height pairing (a particular example of linking numbers) of algebraic cycles lies at the confluence of arithmetic, Hodge theory and topology. In a series of two talks, I will explain the notion of Beilinson’s height pairing for cycles homologous to zero. This will bring into picture the notion of Arakelov/arithmetic intersection theory. I will give sufficient background of this theory and provide examples. Finally, I will talk about my recent work with Dr. Jose Ignacio Burgos, about a generalization of Beilinson’s height pairing for higher algebraic cycles.
In this talk, I shall consider an abstract Cauchy problem for a class of impulsive subdiffusion equation. Existence and regularity of solution of the problem shall be established via eigenfunction expansion. Further, I shall establish the approximate controllability of the problem by applying unique continuation property via internal control acts on a subdomain.
It was shown by Basu, Sidoravicius and Sly that a TASEP starting with the step initial condition, i.e., with one particle each at every nonpositive site of $\mathbb{Z}$ and no particle at positive sites, with a slow bond at the origin where a particle jumping from the origin jumps at a smaller rate $r < 1$, has an asympototic current which is strictly less than 1/4. Here we study the limiting measure of the TASEP with a slow bond. The distribution of regular TASEP started with the step initial condition converges to the invariant product Bernoulli measure with density 1/2. The slowdown due to the slow bond implies that there is a long range effect near the origin where the region to the right of origin is sparser and there is a traffic jam to the left of the slow bond with particle density higher than a half. However, the distribution becomes close to a product Bernoulli measure as one moves far away from the origin, albeit with a different density ? < 1/2 to the right of the origin and ?’ > 1/2 to the left of the origin. This answers a question due to Liggett. The proof uses the correspondence between TASEP and directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times, and the geometric properties of the maximal paths there.
A porous medium (concrete, soil, rocks, water reservoir, e.g.) is a multiscale medium where the heterogeneities present in the medium are characterized by the micro scale and the global behaviors of the medium are observed at the macro scale. The upscaling from the micro scale to the macro scale can be done via averaging methods.
In this talk, diffusion and reaction of several mobile chemical species are considered in the pore space of a heterogeneous porous medium. The reactions amongst the species are modelled via mass action kinetics and the modelling leads to a system of multispecies diffusion; reaction equations (coupled semilinear partial differential equations) at the micro scale where the highly nonlinear reaction rate terms are present at the right hand sides of the system of PDEs, cf. [2]. The existence of a unique positive global weak solution is shown with the help of a Lyapunov functional, Schaefer’s fixed point theorem and maximal Lpregularity, cf. [2, 3]. Finally, with the help of periodic homogenization and twoscale convergence we upscale the model from the micro scale to the macro scale, e.g. [1, 3]. Some numerical simulations will also be shown in this talk, however for the purpose of illustration, we restrict ourselves to some relatively simple 2 dimensional situations.
As an extension to the previous model, we consider the mixture of two fluids. For such models, a system of StokesCahnHilliard equations will be considered at the micro scale in a perforated porous medium. We first explain the periodic setting of the model and the existence results. At the end homogenization of the model will be shown using some extension theorems on Sobolev spaces, twoscale convergence and periodic unfolding.
As big data sets have become more common, there has been significant interest in finding and understanding patterns in them. One example of a simple pattern is the distance between data points, which can be thought of as a 2point configuration. Two classic questions, the Erdos distinct distance problem, which asks about the least number of distinct distances determined by N points in the plane, and its continuous analog, the Falconer distance problem, explore that simple pattern. Questions similar to the Erdos distinct distance problem and the Falconer distance problem can also be posed for more complicated patterns such as triangles, which can be viewed as 3point configurations. In this talk I will present recent Falconer type theorems, established by myself and my collaborators, for a wide class of finite point configurations in any dimension. The techniques we used come from analysis and geometric measure theory, and the key step was to obtain bounds on multilinear analogues of generalized Radon transforms.
Let H denote a connected component of a stratum of translation surfaces. We show that the SiegelVeech transform of a bounded compactly supported function on R2 is in L2(H,μ), where μ is the MasurVeech measure on H, and give applications to bounding error terms for counting problems for saddle connections. We will review classical results in the Geometry of Numbers which anticipate this result. This is joint work with Yitwah Cheung and Howard Masur.
We consider a fourth order traveling wave equation associated to the Suspension Bridge Problem (SBP). This equations are modeled by the traveling wave behavior on the Narrows Tacoma and the Golden Gate bridge. We prove existence of homoclinic solutions when the wave speed is small. We will also discuss the associated fourth order Liouville theorem to the problem and possible link with the De Giorgi’s conjecture. This is an attempt to prove the McKennaWalter conjecture which is open for the last two decades.
I will provide a glimpse at the recent extension of free probability to systems with left and right variables based on a notion of bifreeness. This will include the simplest cases of nonlinear convolution operations on noncommutative distributions snd the analogue of extreme values in this setting.
Given any finite simple graph G one can naturally associate two ideals, namely the edge ideal I(G) and the binomial edge ideal J_G in suitable polynomial rings. In this talk we shall discuss the interplay between combinatorics of the graph and depth and regularity of I(G), J_G and their powers. Some recent progress and some open problems will be discussed.
Differentiable manifolds whose Ricci curvature is proportional to the metric are called Einstein manifolds. Such manifolds have been central objects of study in differential geometry and Einstein’s theory for general relativity, with some strong recent results. In this talk, we shall focus on positively curved 3+1 Lorentzian Einstein manifolds with one spacelike rotational isometry. After performing the dimensional reduction to a 2+1 dimensional Einstein’s equations coupled to ‘shifted’ wave maps, we shall prove two explicit positive mass theorems:
Abstract: Given a proper coarse structure on a locally compact Hausdorff space $X$, one can construct the Higson compactification for the coarse structure. In the opposite direction given a compactification of $X$, one can construct a coarse structure. We use unitizations of a nonunital C$^*$\\nobreakdash algebra $A$ to define a noncommutative coarse structure on $A$. We also set up a framework to abstract coarse maps to this noncommutative setting. The original motivation for this work comes from Physics where quantum phenomenon when probed at large scales give classical results. We show equivalence of the canonical coarse structure on the classical plane $\\mathbb{R}^{2n}$ with a certain noncommutative coarse structure on the Moyal plane which models the hypothetical phase space of Quantum physics. If time permits we shall also discuss other examples of noncommutative coarse equivalences. This is a joint work with Prof. Ralf Meyer.
What functions preserve positive semidefiniteness (psd) when applied entrywise to psd matrices? This question has a long history beginning with Schur, Schoenberg, and Rudin, and has also recently received renewed attention due to its applications in highdimensional statistics. However, effective characterizations of entrywise functions preserving positivity in a fixed dimension remain elusive to date.
I will present recent progress on this question, obtained by: (a) imposing rank and sparsity constraints, (b) restricting to structured matrices, and (c) restricting the class of functions to special families such as polynomials or power functions. These constraints arise in theory as well as applications, and provide natural ways to relax the elusive original problem. Moreover, novel connections to symmetric function theory, matrix analysis, and combinatorics emerge out of these refinements.
Quasilinear symmetric and symmetrizable hyperbolic system has a wide range of applications in engineering and physics including unsteady Euler and potential equations of gas dynamics, inviscid magnetohydrodynamic (MHD) equations, shallow water equations, nonNewtonian fluid dynamics, and Einstein field equations of general relativity. In the past, the Cauchy problem of smooth solutions for these systems has been studied by several mathematicians using semigroup approach and fixed point arguments. In a recent work of M. T. Mohan and S. S. Sritharan, the local solvability of symmetric hyperbolic system is established using two different methods, viz. local monotonicity method and a frequency truncation method. The local existence and uniqueness of solutions of symmetrizable hyperbolic system is also proved by them using a frequency truncation method. Later they established the local solvability of the stochastic quasilinear symmetric hyperbolic system perturbed by Levy noise using a stochastic generalization of the localized MintyBrowder technique. Under a smallness assumption on the initial data, a global solvability for the multiplicative noise case is also proved. The essence of this talk is to give an overview of these new local solvability methods and their applications.
We give a relatively simple proof of the famous theorem of Narasimhan and Seshadri on vector bundles on a compact Riemann surface. The theorem relates the algebraic geometric notion of stability of vector bundles on a compact Riemann surface with a transcendental construct  unitary representations of a suitable Fuchsian group associated to the Riemann surface.
The DeligneHitchin moduli space is a partial compactification of the moduli space of $\lambda$connections. It includes as closed subvarieties the moduli spaces of Hitchin bundles ($\lambda=0$) and of holomorphic connections ($\lambda=1$), exhibiting the later as a deformation of the former. We show a Torelli theorem for a parabolic version of this moduli space (joint work with David Alfaya). I will try to make the talk accessible to a wide mathematical audience.
The PerronFrobenius theorem is a powerful and useful result about the eigenvalues and eigenvectors of a nonnegative matrix. I will not be proving the theorem but will instead focus on its applications. In particular, I will discuss how it can be used to understand the behaviour of a certain class of dynamical systems, namely certain systems of firstorder ordinary differential equations where the couplings between variables are specified by a graph. Some familiarity with graph theory will be useful, but I will try to recapitulate all the basic concepts needed for this talk.
In this talk I will present algorithmic applications of an approximate version of Caratheodory’s theorem. The theorem states that given a set of $d$dimensional vectors $X$, for every vector in the convex hull of $X$ there exists an epsilonclose (under the $p$norm, for $2 \leq p < \infty$) vector that can be expressed as a convex combination of at most $b$ vectors of $X$, where the bound $b$ depends on epsilon and the norm $p$, and is independent of the ambient dimension $d$. This theorem can be obtained by instantiating Maurey’s lemma (c.f. Pisier 1980/81 and Carl 1985).
I will describe how this approximate version of Caratheodory’s theorem leads novel additive approximation algorithms for finding (i) Nash equilibria in twoplayer games (ii) dense subgraphs.
A classical theorem in Riemannian geometry asserts that products of compact manifolds cannot admit Riemannian metrics with negative sectional curvature. A fibration (or a fibre bundle) is a natural generalization of a product and hence one can ask if a fibration can admit such a metric. This question is still open and I will discuss it in the context of Kahler manifolds. This leads to the study of graphs of holomorphic motions, which originally arose in complex dynamics. I will sketch a proof that the graph cannot be biholomorphic to a ball or more generally, a strongly pseudoconvex domain.
The enumeration of isomorphism classes of modules of a polynomial algebra in several variables over a finite field is the same as the classifi cation of commuting tuples of matrices over a finite field up to simultaneous similarity. Let C_{n,k}(q) denote the number of isomorphism classes of ndimensional Fq[x1,…,xk]modules. The generating function in k of the C_{n,k}(q) is a rational function. The computation of this was done explicitly for n <= 4. I shall give a summary of my recently published work on this study of the C_{n,k}(q)s for n <= 2.
In this talk, we’ll report on progress towards a conjecture of B.Krtz about the holomorphic extensions of nonzero Kfinite vectors of irreducible admissible Banach representations of simple real Lie groups and the relation to a distinguished domain  the socalled crown domain. We’ll explain some of the main ideas  the CasselmanWallach smooth globalisation, vanishing of matrix coefficients at infinity etc. Indeed we prove the conjecture with some additional growth conditions on the Banach globalisations. This is joint work with Gang Liu, Uni. Metz.
This talk is about computing (approximately) the “best” map between two polygons taking vertices to vertices. It arises out of a reallife problem, namely, surface registration. Our notion of “best” is extremal quasiconformality (least angledistortion). I will try to keep the talk as selfcontained as possible. It is based on a jointwork with M. Goswami, G. Telang, and X. Gu.
In this talk I will describe the interrelationship between Margulis spacetimes and Anosov representations. Moreover, I will define the pressure metric on the moduli space of Margulis spacetimes and sketch some of it’s properties.
We start with a gentle introduction to tropical algebraic geometry. We then focus on the tropical lifting problem and discuss recent progress. Tropical analogues of graph curves play an important role in this study. This talk will be accessible to the general mathematical audience.
We start with a gentle introduction to tropical algebraic geometry. We then focus on the tropical lifting problem and discuss recent progress. Tropical analogues of graph curves play an important role in this study. This talk will be accessible to the general mathematical audience.
Multiobjective optimisation involves optimising several quantities, such as time and money, simultaneously. The result is a polyhedral frontier of best possible solutions, which cannot improve one quantity without a tradeoff against another. For linear programming, this frontier can be generated using Benson’s outer approximation algorithm, which uses a sequence of scalarisations (singleobjective optimisations), combined with classical algorithms from polytope theory.
We consider a class of wave propagation models with aleatoric and epistemic uncertainties. Using mathematical analysisbased, shapeindependent, a priori parameter estimates, we develop offline/online strategies to compute statistical moments of a key quantity of interest in such models. We present an efficient reduced order model (ROM) and high performance computing (HPC) framework with analysis for quantifying aleatoric and epistemic uncertainties in the propagation of waves through a stochastic media comprising a large number of three dimensional particles. Simulation even for a single deterministic three dimensional configuration is inherently difficult because of the large number of particles. The aleatoric uncertainty in the model leads to a larger dimensional system involving three spatial variables and additional stochastic variables. Accounting for epistemic uncertainty in key parameters of the input probability distributions leads to prohibitive computational complexity. Our hybrid ROM and HPC framework can be used in conjunction with any computational method to simulate a single particle deterministic wave propagation model.
Let $G$ be a connected reductive group over a finite extension $F$ of $\mathbb{Q}_p$. Let $P = MN$ be a Levi decomposition of a maximal parabolic subgroup of $G$, and $\sigma$ an irreducible unitary supercuspidal representation of $M(F)$. One can then consider the representation Ind$_{P(F)}^{G(F)}\sigma$ (normalized parabolic induction). This induced representation is known to be either irreducible or of length two. The question of when it is irreducible turns out to be (conjecturally) related to local $L$functions, and also to poles of a family of so called intertwining operators.
Let $\Delta$ be the Laplacian on a Riemannian symmetric space $X=G/K$ of the noncompact type and let $\sigma(\Delta)\subseteq \mathbb{C}$ denote its spectrum. The resolvent $(\Deltaz)^{1}$ is a holomorphic function on $\mathbb{C} \setminus \sigma(\Delta)$, with values in the space of bounded operators on $L^2(X)$. If we view it as a function with values in Hom$(C_c^\infty(X), C_c^\infty(X)^*)$, then it often admits a meromorphic continuation beyond $\mathbb{C} \setminus \sigma(\Delta)$. We study this meromorphic continuation as a map defined on a Riemann surface above $\mathbb{C} \setminus \sigma(\Delta)$. The poles of the meromorphically extended resolvent are called resonances. The image of the residue operator at a resonance is a $G$module. The main problems are the existence and the localization of the resonances as well as the study of the (spherical) representations of $G$ so obtained. In this talk, based on joint works with Joachim Hilgert and Tomasz Przebinda, we will describe a variety of different situations occurring in the rank two case.
Kardar, Parisi and Zhang introduced a universality class (the socalled KPZ universality class) in 1986 which is believed to explain the universal behaviour in a large class of two dimensional random growth models including first and last passage percolation. A number of breakthroughs has led to an explosion of mathematically rigorous results in this field in recent years. However, these have mostly been restricted to the class of exactly solvable models, where exact formulae are available using powerful tools of random matrices, algebraic combinatorics and representation theory; beyond this class the understanding remains rather limited. I shall talk about a geometric approach to these problems based on studying the geometry of geodesics (optimal paths), and describe some recent progress along these lines.
The ndimensional matrix representations of a group or an associative algebra A form a space (algebraic variety) Rep(A,n) called the nth representation variety of A. This is a classical geometric invariant that plays a role in many areas of mathematics. The construction of Rep(A,n) is natural (functorial) in A, but it is not `exact’ in the sense of homological algebra. In this talk, we will explain how to refine Rep(A,n) by constructing a derived representation variety DRep(A,n), which is an example of a derived moduli space in algebraic geometry. For an application, we will look at the classical varieties of commuting matrices, and present a series of combinatorial conjectures extending the famous Macdonald conjectures in representation theory.
The ndimensional matrix representations of a group or an associative algebra A form a space (algebraic variety) Rep(A,n) called the nth representation variety of A. This is a classical geometric invariant that plays a role in many areas of mathematics. The construction of Rep(A,n) is natural (functorial) in A, but it is not `exact’ in the sense of homological algebra. In this talk, we will explain how to refine Rep(A,n) by constructing a derived representation variety DRep(A,n), which is an example of a derived moduli space in algebraic geometry. For an application, we will look at the classical varieties of commuting matrices, and present a series of combinatorial conjectures extending the famous Macdonald conjectures in representation theory.
Classical invariants for representations of one Lie group can often be related to invariants of some other Lie group. Physics suggests that the right objects to consider for these questions are certain refinements of classical invariants known as conformal blocks. Conformal blocks appear in algebraic geometry as spaces of global sections of line bundles on the moduli stack of parabolic bundles on a smooth curve. Ranklevel duality connects a conformal block associated to one Lie algebra to a conformal block for a different Lie algebra.
Classical invariants for representations of one Lie group can often be related to invariants of some other Lie group. Physics suggests that the right objects to consider for these questions are certain refinements of classical invariants known as conformal blocks. Conformal blocks appear in algebraic geometry as spaces of global sections of line bundles on the moduli stack of parabolic bundles on a smooth curve. Ranklevel duality connects a conformal block associated to one Lie algebra to a conformal block for a different Lie algebra.
The FarrellJones Isomorphism conjecture gives a single statement to understand many standard conjectures in Topology and Algebra= . We will discuss understanding K and Ltheory of groups acting on trees from the vertex stabilizers of the action, in the context of Isomorphism conjecture.
This is a topic in classical algebraic KTheory. I will recall definitions of elementary linear group, elementary symplectic group, linear transvection group, and symplectic transvection group. These group= s have natural action on the set of unimodular elements. I will briefly discuss how bijections between orbit spaces of unimodular elements under different group actions are established. Finally, I will talk about an application of these results, namely improving injective stability bound for the K1 group.
One of the earliest instance of integral geometric discussion can be traced back to Buffon through the “needle problem”. The solution, as we know now, is based on a platform of theory of measures on geometrical spaces which are invariant under some group operations. In this talk, we shall walk through this subject by following a specific line of problems/results called “kinematic fundamental formulae” by studying some specific examples.
Inverse spectral theory in one dimension is to recover a selfadjoint operator given its spectrum and some spectral measure. In general there are lots of selfadjoint operators (of a given form) this collection is called an isospectral set. We will give a brief introduction to the questions in this area and also some connections to other areas of mathematics.
Suppose V is a finite dimensional representation of a complex finite dimensional simple Lie algebra that can be written as a tensor product of irreducible representations. A theorem of C.S. Rajan states that the nontrivial irreducible factors that occur in the tensor product factorization of V are uniquely determined, up to reordering, by the isomorphism class of V. I will present an elementary proof of Rajan’s theorem. This is a joint work with S.Viswanath.
Given a simple graph G, the KacMoody Lie algebra of G is the KacMoody algebra whose simply laced Dynkin diagram is G. We give a new interpretation of the chromatic polynomial of G in terms of the KacMoody Lie algebra of G. We show that the chromatic polynomial is essentially th= e qKostant partition function of the associated KacMoody algebra evaluate= d on the sum of the simple roots. As an application, we construct basis of some of the root spaces of the KacMoody algebra of G. This is a joint work with Sankaran Viswanath.
We shall introduce the definition of a kmode Gaussian state and a chain of such states which determine a C* probability space. We present examples of such states exhibiting properties like exchangeability and stationarity. Stationary chains are determined by block Toeplitz matrices. Using the KacMurdochSzego theorems on asymptotic spectral distributions of Toeplitz matrices we compute the entropy rates of some of these chains. This leaves many natural problems open.
In this talk we discuss how the notion of usual convergence is extended using the notion of ideals and the importance of Pideals. We then show how ideals can be generated and in particular how the P ideals can be generated by matrices other than regular summability matrix
One of the most useful analogies in mathematics is the fundamental group functor (also known as the Galois Correspondence) which sends a topological space to its fundamental group while at the same time sending continuous maps between spaces to corresponding homomorphisms of groups in such a way that compositions of maps are preserved.
I will introduce minimal surfaces and explain the WeierstrassEnneper representation of a minimal surface using hodographic coordinates. I will mention an interesting link between minimal surfaces and BornInfeld solitons. If time permits, I will explain my work (with P. Kumar and R.K. Singh) on interpolation of two real analytic curves by a minimal surface of the BjorlingSchwartz type.
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a very important problem. Theoretically, unconstrained SFM is polynomial time solvable, however, these algorithms are not practical. In 1976, Wolfe proposed a heuristic for projection onto a polytope, and in 1980, Fujishige showed how Wolfe’s heuristic can be used for SFM. For general submodular functions, this FujishigeWolfe heuristic seems to have the best empirical performance. Despite its good practical performance, very little is known about Wolfe’s projection algorithm theoretically.
In this talk, I will describe the first analysis which proves that the heuristic is polynomial time for bounded submodular functions. Our work involves the first convergence analysis of Wolfe’s projection heuristic, and proving a robust version of Fujishige’s reduction theorem.
Having been unclear how to widely define strong (or strict) pseudoconvexity in the infinitedimensional context, we compared the concept in the smoothboundary case with strict convexity. As a result, w= e accomplished establishing definitions of local uniform pseudoconvexity, uniform pseudoconvexity and strict pseudoconvexity for open and bounded subsets of a Banach space. We will see examples of Banach spaces with uniformly pseudoconvex unit ball, as well as examples of Banach spaces whose unit ball is not even strictly pseudoconvex. As an application of the techniques developed, we show that in finite dimension the concept of strict plurisubharmonicity coincides with strict plurisubharmonicity in distribution.
In the 1980s, Goldman introduced a Lie algebra structure on the free vector space generated by the free homotopy classes of oriented closed curves in any orientable surface F. This Lie bracket is known as the Goldman bracket and the Lie algebra is known as the Goldman Lie algebra.
I will present the Funk and Hilbert metrics on convex sets in the setting of Euclidean, nonEuclidean and timelike geometries. I will explain the motivation for studying these metrics and highlight some of their main properties, concerning geodesics, infinitesima structures and isometries.
There exists various possible methods to distribute seats proportionally between states (or parties) in a parliament. In the first half of the talk I will describe some often used methods and discuss their pros and cons (it’s all in the rounding).
One easy method is called Hamilton’s method (also known as the method of largest reminder or Hare’s method). It suffers from a drawback called the Alabama paradox, which e.g. made USA abandon it for the distribution of seats in the house of representatives between states. It is still in use in many other countries including Sweden.
In the second half of the talk I will describe a joint work with Svante Janson (Uppsala Univ.) where we study the probability that the Alabama paradox will happen. We give, under certain assumptions, a closed formula for the probability that the Alabama paradox occurs given the vector $p_1,\dots,p_m$ of relative sizes of the states.
Eigenvalues and eigenvectors appear in many physical and engineering problems, beginning with the noted study by Euler in 1751 of the kinematics of rigid bodies. From a mathematical point of view, for an operator of a suitable class, acting in a vector space, its point spectrum and associated subspaces refer to its “eigenvalues and eigenvectors”, while the subspaces associated with the continuous spectrum of the operator is said to consist of “eigenfunctions”. The basic ideas will be discussed mostly through examples, in some of which a natural connection with the representation of appropriate groups lurks behind.
In the first part we study critical points of random polynomials. We choose two deterministic sequences of complex numbers,whose empirical measures converge to the same probability measure in complex plane. We make a sequence of polynomials whose zeros are chosen from either of sequences at random. We show that the limiting empirical measure of zeros and critical points agree for these polynomials. As a consequence we show that when we randomly perturb the zeros of a deterministic sequence of polynomials, the limiting empirical measures of zeros and critical points agree. This result can be interpreted as an extension of earlier results where randomness is reduced. Pemantle and Rivin initiated the study of critical points of random polynomials. Kabluchko proved the result considering the zeros to be i.i.d. random variables.
Let X be a closed, simply connected and orientable manifold of dimension m and LX the space of free loops on X. We use Rational Homotopy Theory to construct a model for the loop space homology. We further define a BV structure which is equivalent, in some cases, to the ChasSullivan BV operator.
In algebraic geometry the concept of height pairing (a particular example
A porous medium (concrete, soil, rocks, water reservoir, e.g.) is a multi‐scale medium
We consider a fourth order traveling wave equation associated to the Suspension Bridge Problem (SBP). This equations are modeled by the traveling wave behavior on the Narrows Tacoma and the Golden Gate bridge. We prove existence of homoclinic solutions when the wave speed is small. We will also discuss the associated fourth order Liouville theorem to the problem and possible link with the De Giorgi’s conjecture. This is an attempt to prove the McKennaWalter conjecture which is open for the last two decades.
There is a folklore conjecture that there are infinitely many primes p such that p+2 is also prime. This conjecture is still open. However, in the last two years, spectacular progress has been made to show that there are infinitely many primes p such that p+h is also prime with 1< h < 247. We will discuss the history of this problem and explain the new advances in sieve theory that have led to these remarkable results. We will also highlight what we may expect in the future.
Homogenization is a branch of science where we try to understand microscopic structures via a macroscopic medium. Hence, it has applications in various branches of science and engineering. This study is basically developed from material science in the creation of composite materials though the contemporary applications are much far and wide. It is a process of understanding the microscopic behavior of an inhomogeneous medium via a homogenized medium. Mathematically, it is a kind of asymptotic analysis. We plan to start with an illustrative example of limiting analysis in 1D for a second order elliptic partial differential equation. We will also see some classical results in the case of periodic composite materials and oscillating boundary domain. The emphasis will be on the computational importance of homogenization in numerics by the introduction of correctors. In the second part of the talk, we will see a study on optimal control problems posed in a domain with highly oscillating boundary. We will consider periodic controls in the oscillating part of the domain with a model problem of Laplacian and try to understand their optimality and asymptotic behavior.
Voevodsky’s conjecture states that numerical and smash equivalence coincide for algebraic cycles. I shall explain the conjecture in more detail and talk about some of the examples for which this conjecture is known.
Enumerative geometry is a branch of mathematics that deals with the following question: How many geometric objects are there that satisfy certain constraints? The simplest example of such a question is How many lines pass through two points?. A more interesting question is How many lines are there in three dimensional space that intersect four generic lines?. An extremely important class of enumerative question is to ask How many rational (genus 0) degree d curves are there in CP^2 that pass through 3d1 generic points? Although this question was investigated in the nineteenth century, a complete solution to this problem was unknown until the early 90’s, when KontsevichManin and RuanTian announced a formula. In this talk we will discuss some natural generalizations of the above question; in particular we will be looking at rational curves on delPezzo surfaces that have a cuspidal singularity. We will describe a topological method to approach such questions. If time permits, we will also explain the idea of how to enumerate genus one curves with a fixed complex structure by comparing it with the Symplectic Invariant of a manifold (which are essentially the number of curves that are solutions to the perturbed dbar equation).
Interplay between arithmetic and analytic objects are some of the beautiful aspects of number theory. In this talk, we will discuss several examples of this.
We consider an nplayer strategic game with finite action sets. The payoffs of each player are random variables. We assume that each player uses a satisficing payoff criterion defined by a chanceconstraint, i.e., players face a chanceconstrained game. We consider the cases where payoffs follow normal and elliptically symmetric distributions. For both cases we show that there always exists a mixed strategy Nash equilibrium of corresponding chanceconstrained game.
This talk shall be an introduction to some aspects of Teichmüller theory, which is concerned with the parameter space of marked Riemann surfaces. I shall describe Wolf’s parametrization of Teichmüller space using harmonic maps, and discuss how it extends to the Thurston compactification. If time permits, I will describe some recent joint work with Wolf.
We get useful insight about various algebraic structures by studying their automorphisms and endomorphisms. Here we give a brief introduction to the theory of semigroups of endomorphisms of the algebra of all bounded operators on a Hilbert space.
Given an irreducible polynomial f(x) with integer coefficients and a prime number p, one wishes to determine whether f(x) is a product of distinct linear factors modulo p. When f(x) is a solvable polynomial, this question is satisfactorily answered by the Class Field Theory. Attempts to find a nonabelian Class Field Theory lead to the development of an area of mathematics called the Langlands program. The Langlands program, roughly speaking, predicts a natural correspondence between the finite dimensional complex representations of the Galois group of a local or a number field and the infinite dimensional representations of real, padic and adelic reductive groups. I will give an outline of the statement of the local Langlands correspondence. I will then briefly talk about two of the main approaches towards the Langlands program  the type theoretic approach relying on the theory of types developed by BushnellKutzko and others; and the endoscopic approach relying on the trace formula and endoscopy. I will then state a couple of my results involving these two approaches.
The TuraevViro invariants are a powerful family of topological invariants for distinguishing between different 3manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. I will discuss this family of invariants, and present an explicit fixedparameter tractable algorithm for arbitrary r which is practical—and indeed preferable—to the prior state of the art for real computation.
Exact computation with knots and 3manifolds is challenging  many fundamental problems are decidable but enormously complex, and many major algorithms have never been implemented. Even simple problems, such as unknot recognition (testing whether a loop of string is knotted), or 3sphere recognition (testing whether a triangulated 3manifold is topologically trivial), have bestknown algorithms that are worstcase exponential time.
In the seventies of last century, Magnus Landstad characterised the coefficient Calgebra inside the multiplier algebra of a given crossed product Calgebra subject to an action of an Abelian locally compact group G. In 2005, Stefaan Vaes extended the Landstad theory for regular locally compact quantum groups. He gave strong indications that this is not possible for nonregular groups. In this talk I shall explain how LandstadVaes theory extends for nonregular groups. To this end we have to consider not necessary continuous, but measurable, actions of locally compact quantum groups. For regular locally compact quantum groups any measurable action is continuous, so our theory contains that of LandstadVaes. This is a joint work with Stanislaw Lech Woronowicz.
I will present a general approach for constructing a Markov process that describes the dynamics of a nonequilibrium process when one or more observables of this process are observed to fluctuate in time away from their typical values.
We study the local behavior of (extreme) quantiles of the sum of heavytailed random variables, to infer on risk concentration. Looking at the literature, asymptotic (for high threshold) results have been obtained when assuming (asymptotic) independence and second order regularly varying conditions on the variables. Other asymptotic results have been obtained in the dependent case when considering specific copula structures. Our contribution is to investigate on one hand, the nonasymptotic case (i.e. for any threshold), providing analytical results on the risk concentration for copula models that are used in practice, and comparing them with results obtained via MonteCarlo method. On the other hand, when looking at extreme quantiles, we assume a multivariate second order regular variation condition on the vectors and provide asymptotic risk concentration results. We show that many models used in practice come under the purview of such an assumption and provide a few examples. Moreover this ties up related results available in the literature under a broad umbrella. This presentation is based on two joint works, one with M. Dacorogna and L. Elbahtouri (SCOR), the other with B. Das (SUTD).
The usual foundations of mathematics based on Set theory and Predicate calculus (and extended by category theory), while successful in many ways, are so far removed from everyday mathematics that the possibility of translation of theorems to their formal counterparts is generally purely a matter of faith. Homotopy type theory gives alternative foundations for mathematics. These are based on an extension of type theory (from logic and computer science) using an unexpectedly deep connection of Types with Spaces discovered by Voevodsky and AwodeyWarren. As a consequence of this relation we also obtain a synthetic view of homotopy theory. In this lecture, I will give a brief introduction to this young subject.
It is well known that finding an explicit solution for partial differential equations is almost impossible in most of the cases. In this talk we will give a brief introduction to the analysis of certain nonlinear PDEs using various tools from analysis. We will discuss some concrete examples and some open problems (depending on time). The talk should be accessible to senior undergraduate students.
The celebrated BSD conjecture predicts a deep and mysterious relationship between the algebraic rank of an elliptic curve defined over a number field and an arithmetic invariant arising front he Lfunction of the elliptic curve. More amazingly, it predicts an exact formula for the leading term of the Lfunction. Iwasawa theory has proven to be an effective tool in trying to explain the philosophy behind such a mysterious relationship and also in establishing the conjecture in certain cases. We shall outline this theory and discuss its applications.
Independent component analysis (ICA) is a basic problem that arises in several areas including signal processing, statistics, and machine learning. In this problem, we are given linear superpositions of signals. E.g., we could be receiving signals from several sensors but the receivers only get the weighted sums of these signals. The problem is to recover the original signals from the superposed data. In some situations this turns out to be possible: the main assumption being that the signals at different sensors are independent random variables. While independent component analysis is a wellstudied problem, one version of it was not wellunderstood, namely when the original signals are allowed to be heavytailed, such as those with a Pareto distribution. Such signals do arise in some applications. In this talk, I will first discuss the previously known algorithms for ICA and then a new algorithm that applies also to for the heavytailed case. The techniques used are basic linear algebra and probability.
We consider integral lattices $L$ in an Euclidean space $V = \mathbb{R}^m$, i.e. $\mathbb{Z}$submodules of full rank in $V$ such that all vectors in $L$ have integral length. It is impossible to classify such lattices up to isometry, there are just too many of them in general, even if we ﬁx additional invariants such as the discriminant. Therefore one looks for interesting subclasses of lattices, in particular “extremal lattices”, characterized by the property that the smallest length of a nonzero vector in $L$ is “as large as possible”. There are several ways to make this more precise, we will focus on analytic extremality, where modular forms come in. In particular, we will consider extremality for maximal lattices.
The celebrated BSD conjecture predicts a deep and mysterious relationship between the algebraic rank of an elliptic curve defined over a number field and an arithmetic invariant arising front he Lfunction of the elliptic curve. More amazingly, it predicts an exact formula for the leading term of the Lfunction. Iwasawa theory has proven to be an effective tool in trying to explain the philosophy behind such a mysterious relationship and also in establishing the conjecture in certain cases. We shall outline this theory and discuss its applications.
The celebrated BSD conjecture predicts a deep and mysterious relationship between the algebraic rank of an elliptic curve defined over a number field and an arithmetic invariant arising front he Lfunction of the elliptic curve. More amazingly, it predicts an exact formula for the leading term of the Lfunction. Iwasawa theory has proven to be an effective tool in trying to explain the philosophy behind such a mysterious relationship and also in establishing the conjecture in certain cases. We shall outline this theory and discuss its applications.
There is a dichotomy of contact structures– tight vs overtwisted. Classification of overtwisted contact structures up to isotopy, due to Eliashberg, is well understood. However, there have been few results towards classification of tight contact structures. In general, given a contact structure it is difficult to know whether it is tight or not.
The celebrated BSD conjecture predicts a deep and mysterious relationship between the algebraic rank of an elliptic curve defined over a number field and an arithmetic invariant arising front he Lfunction of the elliptic curve. More amazingly, it predicts an exact formula for the leading term of the Lfunction. Iwasawa theory has proven to be an effective tool in trying to explain the philosophy behind such a mysterious relationship and also in establishing the conjecture in certain cases. We shall outline this theory and discuss its applications.
Define $S_R^\alpha f := \int_{\mathbb{R}^d} (1\frac{\xi^2}{R^2})_+^\alpha$ $\hat{f} (\xi) e^{i2\pi (x.\xi)} d\xi$, the Bochner Riesz means of order $\alpha \geq 0$. Let $f\in L^2(\mathbb{R}^d)$ and $f \neq 0$ in an open, bounded set $B.$ It is known that $S_R^\alpha f$ goes to 0 a.e. in $B$ as $R\rightarrow\infty.$ We study the pointwise convergence of Bochner Riesz means $S_{R}^\alpha f, \alpha>0$ as $R \rightarrow \infty$ on sets of positive Hausdorff measure in $\mathbb{R}^d$ by making use of the decay of the spherical means of Fourier Transform of fractal measures. We get an improvement in the range of the Hausdorff dimension of the sets on which it converges. When $0<\alpha<\frac{d1}{4},$ we get the best possible result in $\mathbb{R}^2$ and in higher dimensions we improve the result by L.Colzani, G. Gigante and A. Vargas. Steins interpolation theorem also gives us the corresponding result for $f\in L^p(\mathbb{R}^d), 1<p<2.$
In this talk we prove a version of the Gohberg lemma on compact Lie groups giving an estimate from below for the distance from a given operator to the set of compact operators on compact Lie groups. As a consequence, we prove several results on bounds for the essential spectrum and a criterion for an operator to be compact. The conditions are given in terms of the matrixvalued symbols of operators. (This is a joint work with Professor Michael Ruzhansky.)
Koszul duality theory is a homological method aiming at constructing an explicit quasifree resolution for quadratic algebras. We introduce the concepts of bar (and cobar) construction for a quadratic algebra (and coalgebra) and provide a quasifree resolution for quadratic algebras, under certain assumptions.
A reductive dual pair in the group Sp(W) of isometries of a symplectic space W, over a local
In the first part of this paper we give a solution for the onedimensional reflected backward stochastic differential equation (BSDE for short) when the noise is driven by a Brownian motion and an independent Poisson random measure. The reflecting process is right continuous with left limits (RCLL for short) whose jumps are arbitrary. We first prove existence and uniqueness of the solution for a specific coefficient in using a method based on a combination of penalization and the Snell envelope theory. To show the general result we use a fixed point argument in an appropriate space. The second part of the paper is related to BSDEs with two reflecting barriers. Once more we prove existence and uniqueness of the solution of the BSDE.
An operad is an algebraic device which encodes a type of algebra. The classical types of algebras, ie. associative, commutative and Lie algebras give the first examples of algebraic operads. Operadic point of view has several advantages. Firstly, many results known for classical algebras, when written out in operadic language, can be applied to other types of algebras. Secondly, operadic language simplifies the statements and proofs. Thirdly, even for classical cases, operad theory has provided new results. We start with several equivalent definitions, together with examples, and few basic properties.
In the first part we study critical points of random polynomials. We choose two deterministic sequences of complex numbers, whose empirical measures converge to the same probability measure in complex plane. We make a sequence of polynomials whose zeros are chosen from either of sequences at random. We show that the limiting empirical measure of zeros and critical points agree for these polynomials. As a consequence we show that when we randomly perturb the zeros of a deterministic sequence of polynomials, the limiting empirical measures of zeros and critical points agree. This result can be interpreted as an extension of earlier results where randomness is reduced. Pemantle and Rivin initiated the study of critical points of random polynomials. Kabluchko proved the result considering the zeros to be i.i.d. random variables.
A problem of interest in geometric measure theory both in discrete and continuous settings is the identification of algebraic and geometric patterns in thin sets. The first two lectures will be a survey of the literature on pattern recognition in sparse sets, with a greater emphasis on continuum problems. The second two contain an exposition of recent work, joint in part with Vincent Chan, Kevin Henriot and Izabella Laba on the existence of linear and polynomial configurations in multidimensional Lebesguenull sets satisfying appropriate Hausdorff and Fourier dimensionality conditions.
This talk will focus on two aspects of vector bundles. One is the calculation and application of certain characteristic and secondary characteristic forms (i.e. Chern, ChernSimons, and BottChern forms). This part is joint work with Leon Takhtajan and Indranil Biswas. The second is to study certain fully nonlinear PDE akin to the MongeAmp\\‘ere equation arising from these differential geometric objects. An existence result or two will be presented along with the difficulties involved in the PDE. Moreover, other areas of geometry and physics from which the same PDE arise will be pointed out.
Largedense matrices arise in numerous applications: boundary integral formulation for elliptic partial differential equations, covariance matrices in statistics, inverse problems, radial basis function interpolation, multi frontal solvers for sparse linear systems, etc. As the problem size increases, large memory requirements, scaling as O(N^2), and extensive computational time to perform matrix algebra, scaling as O(N^2) or O(N^3), make computations impractical. I will discuss some novel methods for handling these computationally intense problems. In the first half of the talk, I will discuss my contributions to some of the new developments in handling large dense covariance matrices in the context of computational statistics and Bayesian data assimilation. More specifically, I will be discussing how fast dense linear algebra (O(N) algorithms for inversion, determinant computation, symmetric factorisation, etc.) enables us to handle large scale Gaussian processes, thereby providing an attractive approach for big data applications. In the second half of the talk, I will focus on a new algorithm termed Inverse Fast Multipole Method, which permits solving singular integral equations arising out of elliptic PDE’s at a computational cost of O(N).
Let P be the equilibrium potential of a compact set K in R^n. An electrostatic skeleton of K is a positive measure such that the closed support S of has connected complement and empty interior, and the Newtonian (or logarithmic, when n = 2) potential of is equal to P near infinity. We prove the existence and uniqueness of an electrostatic skeleton for any simplex. – This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.
Abstract : In this work, we study certain stability results for Ball Separationproperties in Banach Spaces leading to a discussion in the context of operator spaces. In this work, we study certain stability results for Small Combination of Slices Property (SCSP) leading to a discussion on SCSP in the context of operator spaces. SCSpoints were first introduced as a slice generalisation of the PC (i.e. point ofcontinuity points for which the identity mapping from weak topology to normtopology is continuous.) It is known that X is strongly regular respectively Xis wstrongly regular) if and only if every non empty bounded convex set K in X ( respectively K in X) is contained in the norm closure ( respectively w closure)of SCS(K)( respectively wSCS(K)) i.e. the SCS points ( w SCS points) of K. Later, it was proved that a Banach space has Radon Nikodym Property (RNP) if and only if it is strongly regular and it has the KreinMilamn Property(KMP). Subsequently, the concepts of SCS points was used to investigate the structure of nondentable closed bounded convex sets in Banach spaces. The point version of the result was also shown to be true .
This talk is about random matrix theory. Linear Algebra and maybe a little probability are the only prerequisites. Random matrix theory is now finding many applications. Many more applications remain to be found. It is truly matrix statistics, when traditional statistics has been primarily scalar and vector statistics. The math is so much richer, and the applications to computational finance, HIV research, the Riemann Zeta Function, and crystal growth, to name a few, show how important this area is. I will show some of these applications, and invite you to find some of your own.
In this very informal seminar, I will discuss various aspects of ongoing work to build an automated theorem proving system using, among other things, machine learning.
Let G be a 2group, and let Z(G) denote the equivariant cobordism algebra of Gmanifolds with finite stationary point sets.A cobordism class in Z(G) is said to be indecomposable if it cannot be expressed as the sum of products of lower dimensional cobordism classes.Indecomposable classes generate the cobordism algebra Z(G). We discuss a sufficient criteria for indecomposability of cobordism classes. Using the above mentioned criterion, we show that the classes of Milnor manifolds (i.e., degree 1 hypersurfaces of the product of two real projective spaces) give nontrivial, indecomposable elements in Z(G) in degrees up to 2^n  5. This talk is based on joint work with Samik Basu and Goutam Mukherjee.
One of the basic questions in harmonic analysis is to study the decay properties of the Fourier transform of measures or distributions supported on thin sets in $\\R^n$. When the support is a smooth enough manifold, an almost complete picture is available. One of the early results in this direction is the following: Let $f\\in C_c^{\\infty}(d\\sigma)$, where $d\\sigma$ is the surface measure on the sphere $S^{n1}\\subset\\R^n$. Then
Our vision is unsurpassed by machines because we use a sophisticated object representation. This representation is unlike the retinal image: on the one hand, two outofphase checkerboards, maximally different in image pixels, appear perceptually similar. On the other hand, two faces, similar in their image pixels, appear perceptually distinct. What is then the nature of perceptual space? Are there principles governing its organization? To address these questions, we have been using visual search to measure similarity relations between objects.
I will summarize a line of research from our laboratory indicative of a surprising linear rule governing distances in perceptual space. In the first study, we found that search time is inversely proportional to the feature difference between the target and distracters. The reciprocal of search time is therefore linear and interestingly, it behaved like a mathematical distance metric. It also has a straightforward interpretation as a saliency signal that drives visual search (Arun, 2012). In a second study, complex searches involving multiple distracters were explained by a linear sum of pairwise dissimilarities measured from simpler searches involving homogeneous distracters (Vighneshvel & Arun, 2013). In a third study, dissimilarities between objects differing in multiple features were found to combine linearly. This was also true for integral features such as the length and width of a rectangle upon including aspect ratio as an additional feature (Pramod & Arun, 2014). Finally, I will describe some recent results extending these findings to more naturalistic objects.
Arun and Olson (2010) conducted a visual search experiment where human subjects were asked to identify, as quickly as possible, an oddball image embedded among multiple distractor images. The reciprocal of the search times for identifying the oddball (in humans) and an ad hoc neuronal dissimilarity index, computed from measured neuronal responses to component images (in macaques), showed a remarkable correlation. In this talk, I will describe a model, an active sequential hypothesis testing model, for visual search. The analysis of this model will suggest a natural alternative neuronal dissimilarity index. The correlation between the reciprocal of the search times and the new dissimilarity index continues to be equally high, and has the advantage of being firmly grounded in decision theory. I will end the talk by discussing the many gaps and challenges in our modeling and statistical analysis of visual search. The talk will be based on ongoing work with Nidhin Koshy Vaidhiyan (ECE) and S. P. Arun (CNS).
In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for signaltointerferenceplusnoiseratio (SINR) model with node locations distributed according to a Poisson point process. Consequently, the information velocity, defined as the limit of the ratio of the distance to the destination and the time taken for a packet to successfully reach the destination over multiple hops, is zero, as the distance tends to infinity. A nearest neighbor distance based power control policy is proposed to show that the expected delay required for a packet to be successfully received at the nearest neighbor can be made finite. Moreover, the information velocity is also shown to be nonzero with the proposed power control policy. The condition under which these results hold does not depend on the intensity of the underlying Poisson point process.
Unlike integer factorization, a reducible holomorphic eta quotient may not factorize uniquely as a product of irreducible holomorphic eta quotients. But whenever such an eta quotient is reducible, the occurrence of a certain type of factor could be observed: We conjecture that if a holomorphic eta quotient f of level M is reducible, then f has a factor of level M. In particular, it implies that rescalings and AtkinLehner involutions of irreducible holomorphic eta quotients are irreducible. We prove a number of results towards this conjecture: For example, we show that a reducible holomorphic eta quotient of level M always factorizes nontrivially at some level N which is a multiple of M such that rad(N) = rad(M) and moreover, N is bounded from above by an explicit function of M. This implies a new and much faster algorithm to check the irreducibility of holomorphic eta quotients. In particular, we show that our conjecture holds if M is a prime power. We also show that the level of any factor of a holomorphic eta quotient f of level M and weight k is bounded w.r.t. M and k. Further, we show that there are only finitely many irreducible holomorphic eta quotients of a given level and provide a bound on the weights of such eta quotients. Finally, we give an example of an infinite family of irreducible holomorphic eta quotients of prime power levels.
FareyFord Packings are a special case of more general circle packings called Apollonian Circle Packings (ACP). These packings have some very interesting properties, for exmaple, if any four mutually tangent circles have integer curvatures, then so do all others in the packing. This has led to many important problems like prime number theorem in this setting. Kontorovich and Oh explore it from dynamics point of view whereas Bourgain, Fuchs and Sarnak look at them more number theoretically. In this talk, our focus will be on the specialized packings FareyFord Packings. We consider some basic statistics associated to these circles and answer some questions about their distributions and asymptotic behavior. One can ask similar questions in the general setting for ACP, and if time permits, we will discuss it in this talk. Some of this is joint work with Athreya, Chaubey and Zaharescu.
TBA
TBA
Weyl discovered a decomposition of the invariant probability measure on a connected compact Lie group, according to elements of a maximal torus and their conjugacy classes. In the case of the unitary group, it allowed Diaconis and Shahshahani to access the distribution of the eigenvalues of a random unitary matrix. We explore these ideas in the lecture.
Consider the problem of n cards labelled 1 through n, lying face up on a table. Suppose two integers a and b are chosen independently and uniformly between 1 and n. The cards labelled a and b are switched. If many such transpositions are made the row of cards will tend to appear in random arrangement. Then question is how many steps are required until the deck is well mixed up (i.e. the permutation is close to random)? Diaconis and Shahshahani used tools of representation theory of symmetric groups to prove that at least 1/2(n log n) steps are required before the deck will be well mixed up for large n. I will explain ideas of their proof and few related problems.
A Kronecker coefficient counts the number of times a representation of a symmetric group occurs in the tensor product of two others. Finding a fast algorithm to determine when a Kronecker coefficient is positive is an open problem. There has been an increased interest in this problem over the last few years as it comes up in the geometric approach to the complexity conjecture P = NP due to Mulmuley and Sohoni. I will explain how a higher dimensional analogue of the Robinson–Schensted–Knuth correspondence relates Kronecker coefficients to the problem of counting the number of integer arrays with specified slice sums.
In this twopart talk, we reconsider Burnside algebras, a classical tool in the theory of finite groups, from a computational perspective. Using modern computer algebra systems, many of the results about these rings that were proved in the second half of the last century can be transformed into effective algorithms.
In this twopart talk, we reconsider Burnside algebras, a classical tool in the theory of finite groups, from a computational perspective. Using modern computer algebra systems, many of the results about these rings that were proved in the second half of the last century can be transformed into effective algorithms.
In this talk, I will give a proof of Alexandrovs theorem on the Gauss curvature prescription of Euclidean convex body. The proof is mainly based on mass transport. In particular, it doesnt rely on pdes method nor convex polyhedra theory. To proceed, I will discuss generalizations of wellknown results for the quadratic cost to the case of a cost function which assumes infinite value.
Four axioms (A1)–(A4) link estimators and distance functions on a set of admissible refinements together and imply optimality of a standard finite element routine on an abstract level with a loop: solve, estimate, mark, and refine. The presentation provides proofs and examples of the recent review due to C. Carstensen, M. Feischl, M. Page, and D. Praetorius: The axioms of adaptivity, Comput. Math. Appl. 67 (2014) 1195 –1253 and so discusses the current literature on the mathematics of adaptive finite element methods. The presentation concludes with an overview over several applications of the set of axioms. If time permits, some recent developments are discussed on ongoing joint work with Hella Rabus on separate marking.
In the first half of the talk, I will define the dimer model on planar graphs and prove Kasteleyn’s groundbreaking result expressing the partition function (i.e. the generating function) of the model as a Pfaffian. I will then survey various results arising as a consequence, culminating in the beautiful limit shape theorems of Kenyon, Okounkov and coworkers.
In the second half, I will define a variant of the monomerdimer model on planar graphs and prove that the partition function of this model can be expressed as a determinant. I will use this result to calculate various quantities of interest to statistical physicists and end with some open questions.
TBA
In this talk we deal with two problems in harmonic analysis. In the first problem we discuss weighted norm inequalities for Weyl multipliers satisfying Mauceri’s condition. As an application, we prove certain multiplier theorems on the Heisenberg group and also show in the context of a theorem of Weis on operator valued Fourier multipliers that the Rboundedness of the derivative of the multiplier is not necessary for the boundedness of the multiplier transform. In the second problem we deal with a variation of a theorem of Mauceri concerning the L^p boundedness of operators M which are known to be bounded on L^2: We obtain sufficient conditions on the kernel of the operator M so that it satisfies weighted L^p estimates. As an application we prove L^p boundedness of Hermite pseudomultipliers.
I will report on work in progress with Radhika Ganapathy. One wishes to study irreducible smooth' complex representations of symplectic and (split) orthogonal groups over local function fields, i.e., fields of the form F_q((t)). The theory of
close local fields’ proposes to do this by studying the representation theory of these groups over (varying) finite extensions of Q_p. We will discuss an approach to using this philosophy to study the local Langlands correspondence for these groups.
TBA
TBA
TBA
The longest increasing subsequence (LIS) of a uniformly random permutation is a well studied problem. VershikKerov and LoganShepp first showed that asymptotically the typical length of the LIS is 2sqrt(n). This line of research culminated in the work of BaikDeiftJohansson who related this length to the TracyWidom distribution.
I will start with an overview of classical Iwasawa theory and give a formulation of main conjectures in noncommutative Iwasawa theory. If time permits I will say something about proof of main conjectures in noncommutative Iwasawa theory.
In 1998, Don Zagier studied the ‘modified Bernoulli numbers’ $B_n^{*}$ whose 6periodicity for odd $n$ naturally arose from his new proof of the EichlerSelberg trace formula. These numbers satisfy amusing variants of the properties of the ordinary Bernoulli numbers. Recently, Victor H. Moll, Christophe Vignat and I studied an obvious generalization of the modified Bernoulli numbers, which we call ‘Zagier polynomials’. These polynomials are also rich in structure, and we have shown that a theory parallel to that of the ordinary Bernoulli polynomials exists. Zagier showed that his asymptotic formula for $B_{2n}^{*}$ can be replaced by an exact formula.
A porous medium (concrete, soil, rocks, water reservoir, e.g.) is a multiscale medium where the heterogeneities present in the medium are characterized by the micro scale and the global behaviors of the medium are observed by the macro scale. The upscaling from the micro scale to the macro scale can be done via averaging methods.
We recall some facts about Rational Homotopy Theory, from both Sullivan and Quillen points of view. We show how to find a Sullivan model of a homogeneous space G/H . Let M be a closed oriented smooth manifold of dimension d and LM= map(S^1, M) denote the space of free loops on M . Using intersection products, Chass and Sullivan defined a product on \\mathbb{H}*(LM)=H{+d} (LM) that turns to be a graded commutative algebra and defined a bracket on \\mathbb{H}_(LM) making of it a Gerstenhaber algebra. From the work of Jones, Cohen, F\\‘elix, Thomas and others there is an isomorphism of Gerstenhaber algebras between the Hochschild cohomology HH^(C^(M), C^(M)) and \\mathbb{H}_(LM) . Using a Sullivan model (\\land V, d) of M , we show that that the Gerstenhaber bracket can be computed in terms of derivations on (\\land V, d) . Precisely, we show that HH^(\\land V, \\land V) is isomorphic to H_(\\land(V)\\otimes \\land Z , D) , where Z is the dual of V . We will illustrate with computations for homogeneous spaces.
Finite difference formulas approximate the derivatives of a function given its values at a discrete set of grid points. Much of the theory for choosing grid points is concerned with discretization errors and rounding errors are ignored completely. However, when the grids become fine the rounding errors dominate. Finding finite difference formulas which optimize the total error leads to a combinatorial optimization problem with a large search space. In this talk, we will describe a random walk based strategy for tackling the combinatorial optimization problem.
simpcomp is an official extension to the computer algebra system GAP, that is, simpcomp is part of every full GAP installation. The software allows the user to compute numerous properties of abstract simplicial complexes such as the f , g and hvectors, the fundamental group, the automorphism group, (co)homology, the intersection form, and many more. It provides functions to generate simplicial complexes from facet lists, orbit representatives, or permutation groups. In addition, functions related to slicings and polyhedral Morse theory as well as a combinatorial version of algebraic blowups and the possibility to resolve isolated singularities of 4manifolds are implemented.
In this talk, I will give an overview over the existing features of the software and also discuss some ongoing projects such as (i) support for Forman’s discrete Morse theory for homology and fundamental group computations, and (ii) an extension of the features to analyse tightness of triangulated manifolds.
In this talk we explore new approaches to the old and difficult computational problem of unknot recognition. Although the best known algorithms for this problem run in exponential time, there is increasing evidence that a polynomial time solution might be possible. We outline several promising approaches, in which computational geometry, linear programming and greedy algorithms all play starring roles.
We finish with a new algorithm that combines techniques from topology and combinatorial optimisation, which is the first to exhibit “real world” polynomial time behaviour: although it is still exponential time in theory, exhaustive experimentation shows that this algorithm can solve unknot recognition for “practical” inputs by running just a linear number of linear programs.
Abstract: See https://drive.google.com/file/d/0Bx6ccM3uL81GNHZqQUtic3g5TndEMmF3Y0JKSDl3LTBTeFU4/view?usp=sharing.
I shall begin with the mapping properties of classical Riesz potentials acting on $L^p$spaces. After reviewing the literature, I shall present our new ‘‘almost’’ Lipschitz continuity estimates for these and related potentials (including, for instance, the logarithmic potential) in the socalled supercritical exponent. Finally, I shall show how one could apply these estimates to deduce Sobolev embedding theorems. This is joint work with Daniel Spector and is available on arXiv:1404.1563.
I will prove the following interesting result about finite dimensional complex semisimple algebra. Let A be a finitedimensional complex semisimple algebra without an M_{2}(C) summand and let S be an involutive unital Calgebra antiautomorphism of A. Then there exists an element a in A such that a and S(a) generate A as an algebra. In the proof I will use some basic results in linear algebra
The notion of Ncomplexes goes back to a 1996 preprint of Kapranov, in which he considered chains of composable morphisms satisfying d^N = 0 (as opposed to the usual $d^2 = 0$ which gives the usual chain complexes). Later on, much of the usual homological algebra for chain complexes (homotopy of morphisms, spectral sequences, etc) was generalized to Ncomplexes, mostly by DuboisViolette. Recently in 2014 there has been a burst of interest in this topic with work of Iyama,Kato,Miyachi defining the corresponding Nderived category. We shall begin the talk with simple definitions of $N$ complexes and their homology groups. Then gradually we will move to the paper of Iyama explaining derived category of $N$complexes.
The goal of these talks is to discuss the history, the circumstances, and (the main aspects of) the proof of a recent result of ours, which says: a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism.
Results of this character are motivated by a remarkable theorem of H. Alexander about proper holomorphic selfmaps of the Euclidean ball. The first part of the talk will focus on the meanings of the terms in the above theorem. We will give an elementary proof that the automorphism group of a bounded symmetric domain acts transitively on it. But the existence of an involutive symmetry at each point is restrictive in many other ways. For instance, it yields a complete classification of the bounded symmetric domains. This follows from the work of Elie Cartan.
Earlier results in the literature that are special cases of our result focused on different classes of domains in the Cartan classification, and have mutually irreconcilable proofs. One aspect of our work is a unified proof: a set of techniques that works across the Cartan classification. One of those techniques is the use of an algebraic gadget: the machinery of Jordan triple systems.
We will present definitions and examples related to this machinery in the first part of the talk. In the second part of the talk, we shall state a result on finitedimensional Jordan triple systems that is essential to our work. After this, we shall discuss our proof in greater depth.
See http://www.math.iisc.ernet.in/~arvind/BakloutiAbst.Bangalore14.pdf
In this talk we discuss about the Fourier transforms of functions satisfying Lipschitz conditions of certain order. We cover Fourier transforms on Euclidean spaces, non compact symmetric spaces and also certain hyper groups.
In dynamics, one studies properties of a map from a space to itself, up to change of coordinates in the space. Hence it is important to understand invariants of the map under change of coordinates. An important such invariant is Poincare’s rotation number, associated to invertible maps from the circle to itself. Ghys and others have abstracted the rotation number to give many other important invariants of dynamical systems by viewing it in terms of so called quasihomomorphisms. Quasihomomorphisms are like homomorphisms, except that a bounded error is allowed in the definition. In this expository lecture I will introduce quasihomomorphisms and show some interesting properties, constructions and application, including an alternative construction of the real numbers (due to Ross Street). I shall then show how these can be used to construct dynamical invariants, in particular the rotation number. Only basic algebra and analysis are needed as background for this lecture.
Given n nonzero real numbers v_1,…,v_n, what is the maximum possible number of subsets {i_1,…,i_k} that can have the same subset sum v_{i_1}+…+v_{i_n}? Littlewood and Offord raised the question, showed that the answer is at most 2^nlog(n)/\sqrt{n} and conjectured that the log(n) can be removed. Erdos proved the conjecture and raised more questions that have continued to attract attention, primarily relating the arithmetic structure of v_1,…,v_n and the maximum number of subsets with a given subsetsum.
In the first lecture, we shall review and prove several of these results (due to Littlewood–Offord, Erdos, Moser, Stanley, Halasz, Tao–Vu, Rudelson–Vershynin…) and show an application to random matrices.
In the second part, we start with a question in random polynomials and see how it leads to a variant of the Littlewood–Offord problem that has not been considered before.
Most of the material presented should be accessible to undergraduate students. Much of the lecture is an outcome of my joint study in summer with Sourav Sarkar (ISI, Kolkata).
By using the language of diffusion semigroups, it is possible to define and study classical operators in harmonic analysis. We introduce and develop this idea, and show two applications. First, we investigate fractional integrals and Riesz transforms in compact Riemannian spaces of rank one. Secondly, we carry out the study of operators associated with a discrete Laplacian, namely the fractional Laplacian, maximal heat and Poisson semigroups, square functions, Riesz transforms and conjugate harmonic functions.
This talk will concern asymptotic estimates at infinity for positive harmonic functions in a large class of nonsmooth unbounded domains. These are domains whose sections, after rescaling, resemble a Lipschitz cylinder or a Lipschitz cone, e.g., various paraboloids and horns. We will also mention a few related results in probability, e.g harmonic measure (distribution of exit position of Brownian motion) estimates.
HarishChandra is a mathematician whose name in the history of mathematics is permanently etched in stone. I will begin by giving a brief account of his life, and in the second half of the lecture, explain some of the technical terms used in the first half. This lecture is aimed mainly at Ph.D. students.
In this talk we shall briefly discuss the theory of onesided maximal functions. Onesided maximal function is a variant of the classical HardyLittlewood maximal function. The theory of onesided maximal functions is an active research area. Specially, in the past two decades there has been a lot of research activities in this area.
In this talk we consider a linear parabolic problem with time dependent coefficients oscillating rapidly in the space variable. The existence and uniqueness results are proved by using Rothe’’s method combined with the technique of twoscale convergence. Moreover, we derive a concrete homogenization algorithm for giving a unique and computable approximation of the solution.
In noncommutative geometry (NCG) one typically treats unital Calgebras as noncommutative compact spaces via GelfandNaimark duality. In various applications of NCG to problems in geometry or topology it is customary to first reformulate these problems in terms of certain (co)homology theories for noncommutative spaces. The celebrated BaumConnes conjecture, that reduces the Novikov conjecture to an assertion in bivariant Ktheory, is a prime example of this principle. However, the category of Calgebras is wellknown to be de ficient from the viewpoint of homotopy theory or index theory. In this talk I am going to first survey certain (co)homology theories for noncommutative spaces, then present my proposed solution to the aforementioned problem, and finally (time permitting) discuss some applications. I will try to keep it nontechnical and accessible to a wide range of audience.
The nonbacktracking matrix of a graph is a nonsymmetric matrix on the oriented edge of a graph which has interesting algebraic properties and appears notably in connection with the Ihara zeta function and in some generalizations of Ramanujan graphs. It has also be proposed recently in the context of community detection. In this talk, we will study the largest eigenvalues of this matrix for the ErdosRenyi graph G(n,c/n) and other simple inhomogeneous random graphs. This is a joint work with Marc Lelarge and Laurent Maussouli.
Mechanisation of Mathematics refers to use of computers to generate or check proofs in Mathematics. It involves translation of relevant mathematical theories from one system of logic to another, to render these theories implementable in a computer. This process is termed formalisation of mathematics. Two among the many way of mechanising are: (1) generating results using Automated Theorem Provers, (2) Interactive theorem proving in a Proof Assistant which involves a combination of user intervention and automation.
As a sequel to the talk on July 16th, I shall talk about a recent result (joint work with Shinpei Baba) concerning fibers of the holonomy map from P(S) to the PSL(2,C) character variety. The proof involves some threedimensional hyperbolic geometry, and traintracks.
We discuss the question of rank of symmetric and nonsymmetric matrices when the entries are i.i.d. nondegenerate random variables. In particular we show that for an $n \times n$ symmetric matrix the probability that it is singular is of the order $O(n^{ (1/4) + \epsilon})$. This is joint work with Paulo Manrique and Victor PerezAbreu.
As in other ancient civilisations, mathematics in India began in counting and drawing: numbers and plane geometry. The earliest textually recorded geometry is that of the Sulbasutra (around 800 BC onwards) which are manuals for the construction of Vedic altars, its mathematical high point being the `theorem of the diagonal’, Pythagoras’ theorem to you and me. I will state its earliest formulation and touch briefly on some of the ideas around it as found in the texts.
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so called fat graph, which we call the systolic graph. The central question that we study in this thesis is: which fat graphs are systolic graphs for some surface  we call such graphs admissible. This is motivated in part by the observation that we can naturally decompose the moduli space of hyperbolic surfaces based on the associated systolic graphs. A systolic graph has a metric on it, so that all cycles on the graph that correspond to geodesics are of the same length and all other cycles have length greater than these. This can be formulated as a simple condition in terms of equations and inequations for sums of lengths of edges. We call this combinatorial admissibility. Our first main result is that admissibility is equivalent to combinatorial admissibility. This is proved using properties of negative curvature, specifically that polygonal curves with long enough sides, in terms of a lower bound on the angles, are close to geodesics. Using the above result, it is easy to see that a subgraph of an admissible graph is admissible. Hence it suffices to characterize minimal nonadmissible fat graphs. Another major result of this thesis is that there are infinitely many minimal nonadmissible fat graphs (in contrast, for instance, to the classical result that there are only two minimal nonplanar graphs).
Complex projective structures on a surface S arise in the complexanalytic description of Teichmller space. The operation of grafting parametrizes the space P(S) of such structures, and yields paths in Teichmller space called grafting rays. I shall introduce these, and describe a result concerning their asymptotic behavior. This talk shall be mostly expository.
Informally, a preferential attachment scheme is a dynamic (reinforcement) process where a network is grown by attaching new vertices to old ones selected with probability proportional to their weight, a function of their degrees. In these two talks, we give an introduction to these schemes and discuss a couple of approaches to the study of the large scale degree structure of these graphs. One fruitful approach is to view the scheme in terms of branching processes. Another is to understand it in terms of Markov decompositions and fluid limits.
We will use transcendental shiftlike automorphisms of C^k ,k>2 to construct two examples of nondegenerate entire mappings with prescribed ranges. The first example generalizes a result of DixonEsterle in C^2, i.e., we construct an entire mapping of C^k, k>2 whose range avoids a given polydisc but contains the complement of a slightly larger concentric polydisc. The second example shows the existence of a FatouBieberbach domain in C^k, k>2 that is constrained to lie in a prescribed region. This is motivated by similar results of Buzzard and RosayRudin.
Unlike the partial differential equations, the solutions of variational inequalities exhibit singularities even when the data is smooth due to the existence of free boundaries. Therefore the numerical procedure of these problems based on uniform refinement becomes inefficient due to the loss of the order of convergence. A popular remedy to enhance the efficiency of the numerical method is to use adaptive finite element methods based on computable a posteriori error bounds. Discontinuous Galerkin methods play a very important role in the local mesh adaptive refinement techniques.
1961 Frankel in a novel approach used the curvature of Complex Projective space to show complex submanifolds of complimentary dimension intersect. Based on this approach Scheon and Wolfson reproved the BarthLefshetz type theorems using the Morse Theory on the space of paths, in the case the ambient space is a Hermitian Symmetric Space. In this talk we describe how to extend their work to a much larger class of Homogenous spaces.
In this presentation we briefly recall some results on harmonic maps. Subsequently, we introduce the concept of minimal surfaces. After exploring a few examples, we mathematically formulate Plateau’s problem regarding the existence of a soap film spanning each closed, simple wire frame and discuss a solution. In conclusion, certain partial results regarding the uniqueness of such a soap film are discussed.
An automorphism T of a locally compact group is said to be distal if the closure of the Torbit of any nontrivial element stays away from the identity. We discuss some properties of distal actions on groups. We will also relate distal groups with behaviour of powers of probability measures on it.
An automorphism T of a locally compact group is said to be distal if the closure of the Torbit of any nontrivial element stays away from the identity. We discuss some properties of distal actions on groups. We will also relate distal groups with behaviour of powers of probability measures on it.
This thesis investigates two different types of problems in multi variable operator theory. The first one deals with the defect sequence for contractive tuples and maximal contractive tuples. The second one deals with the wandering subspaces of the Bergman space and the Dirichilet space over polydisc. These are described in (I) and (II) below.
The dominant problem in applied mathematics is the application of linear operators and solving linear equations. Dense linear systems arise in numerous applications: Boundary integral equations for elliptic partial differential equations, covariance matrices in statistics, Bayesian inversion, Kalman filtering, inverse problems, radial basis function interpolation, density functional theory, multifrontal solvers for sparse linear systems, etc. As the problem size increases, large memory requirements scaling as $O(N^2)$ and extensive computational time to perform matrix algebra scaling as $O(N^2)$ or $O(N^3)$ make computations impractical, where $N$ is the underlying number of degrees of freedom. This talk will discuss new fast algorithms that scale as $O(N)$ for a class of problems, given a prescribed tolerance. Applications in the context of Gaussian processes, Integral equations for electromagnetic scattering, Symmetric factorization for Brownian dynamics, Bayesian inversion, Kalman filtering, multifrontal solvers will also be presented.
In this expository talk, I will focus on CMC surfaces which are not minimal surfaces. I will talk about the link between CMC surfaces and integrable systems. I will then talk about how CMC surfaces fall out of a constrained optimization problem. I will give examples of rotational and helicoidal CMC surfaces and the isometry between them. If time permits I will talk about the classification of CMC surfaces, namely its Weirstrass representation.
We construct a model of capital inflow in a two and multicountry framework. A capitalscarce country, typically a developing country with a high return on capital borrows from a capitalrich country, typically a developed country to finance domestic investment. In the process both the countries gain, raising the world welfare. We formulate the problem in terms of utility maximization with respect to both develop and developing countries’ perspective over infinite time horizon and numerically solve for optimal interest rate, borrowing/lending amount, exchange rate using dynamic programming principle.
In this expository talk, I will first review prequantization of symplectic manifolds. I will then talk of polarizations and geometric quantization. I will then focus on geometric quantization of Kahler manifolds and the Rawnsley coherent states. If time permits I will talk of coadjoint orbits and coherent states.
Gromov’s compactness theorem for metric spaces, a compactness theorem for the space of compact metric spaces equipped with the GromovHausdorff distance, is a landmark theorem with many applications. We give a generalisation of this result  more precisely, we prove a compactness theorem for the space of distance measure spaces equipped with the generalised GromovHausdorffLeviProkhorov distance. A distance measure space is a triple (X, d, μ), where (X, d) forms a distance space (a generalisation of a metric space where, we allow the distance between two points to be infinity) and μ is a finite Borel measure.
One looks at a certain sum G involving the pth roots of unity (where p is a prime number), called the quadratic gaussian sum. It is easy to see that G^2=p, which means that G itself is either the positive or the negative square root of p. Which one ? It took Gauss many years to find the answer and to prove the result. Since then some other proofs of this result have been given, and it has become the central example of what is called the root number of an Lfunction. So the result is very important.
We study homomorphisms $\rho_{V}$ given by $\rho_{V}(f)= \begin{pmatrix} f(w)I_n & \sum_{i=1}^{m} \partial_i f(w) V_{i} \\ 0 & f(w) I_n \end{pmatrix}$, $f \in \mathcal{O} (\Omega_{\mathbf{A}})$ defined on $\mathcal{O} (\Omega_{\mathbf{A}})$, where $\Omega_{\mathbf{A}}$ is a bounded domain of the form $\Omega_\mathbf A := \{ (z_1 ,z_2, \ldots, z_m) :  z_1 A_1 + \cdots + z_m A_m _{\rm op} < 1 \}$ for some choice of a linearly independent set of $n\times n$ matrices $\{ A_1, \ldots, A_m \}.$
The famous RSA public key cryptosystem is possibly the most studied topic in cryptology research. For efficiency and security purposes, some variants of the basic RSA has been proposed. In this talk, we will first discuss two such RSA variants: Prime Power RSA and Common Prime RSA.
The dynamics of excursions of Brownian motion into a set with more than one boundary point , which no longer have the structure of a Poisson process, requires an extension of Ito’s excursion theory , due to B.Maisonneuve. In this talk we provide a `bare hands’ calculation of the relevant objects  local time, excursion measure  in the simple case of Brownian excursions into an interval (a,b), without using the Maisonneuve theory. We apply these computations to calculate the asymptotic distribution of excursions into an interval, straddling a fixed time t, as t goes to infinity.
In this presentation we briefly recall some results on harmonic maps. Subsequently, we introduce the concept of minimal surfaces. After exploring a few examples, we mathematically formulate Plateau’s problem regarding the existence of a soap film spanning each closed, simple wire frame and discuss a solution. In conclusion, certain partial results regarding the uniqueness of such a soap film are discussed.
In this report, after recalling the definition of the M\\obius group, we define homogeneous operators, that is, operators $T$ with the property $\\varphi(T)$ is unitarily equivalent to $T$ for all $\\varphi$ in the M\\obius group and prove some properties of homogeneous operators. Following this, (i) we describe isometric operators which are homogeneous. (ii) we describe the homogeneous operators in the CowenDouglas class of rank 1. Finally, Multiplier representations which occur in the study of homogeneous operators are discussed. Following the proof of Kobayashi, the multiplier representations are shown to be irreducible.
Motivated by applications, we introduce a class of optimization problems with constraints. Difficulties in solving these problems are highlighted. Mathematical developments to overcome these difficulties are discussed.
I will discuss the negative curvature properties of certain intrinsic metrics in complex analysis. The talk will be accessible to graduate students.
The aim of this thesis is to give explicit descriptions of the set of proper holomorphic mappings between two complex manifolds with reasonable restrictions on the domain and target spaces. Without any restrictions, this problem is intractable even when posed for domains in C^n. We present results for special classes of manifolds. We study, broadly, two types of structure results:
A recent theorem of S. Alesker, S. ArtsteinAvidan and V. Milman characterises the Fourier transform on R^n as essentially the only transform on the space of tempered distributions which interchanges convolutions and pointwise products. Analogously, we study the image of the Schwartz space on the Heisenberg group under the Fourier transform and obtain a similar characterisation for the Fourier transform on the Heisenberg group. This is a joint work with Prof. S. Thangavelu.
A recent theorem of S. Alesker, S. ArtsteinAvidan and V. Milman characterises the Fourier transform on R^n as essentially the only transform on the space of tempered distributions which interchanges convolutions and pointwise products. Analogously, we study the image of the Schwartz space on the Heisenberg group under the Fourier transform and obtain a similar characterisation for the Fourier transform on the Heisenberg group. This is a joint work with Prof. S. Thangavelu.
Generalised polygons are incidence structures that generalise projective planes (generalised triangles) and are closely related to finite groups. The FeitHigman theorem states that any generalised ngon is either an ordinary polygon or n = 2, 3, 4, 6, 8 or 12.
A great progress on the twin prime problem was made last year by Yitang Zhang and it made him famous in mathematical circles almost overnight. He proved the existence of a positive real number M such that there are infinitely many pairs of primes that differ by at most M. The twin prime conjecture predicts that M can be taken to be two. I shall give an overview of the works leading up to Zhang’s spectacular achievement.
Quadrature domains are those on which holomorphic functions satisfy a generalized mean value equality. The purpose of this talk will be to reflect on the Schwarz reflection principle and to understand how it leads to examples of quadrature domains.
Discontinuous Galerkin methods have received a lot of attention in the past two decades since these are high order accurate and stable methods which can easily handle complex geometries, irregular meshes with hanging nodes and different degree polynomial approximation in different elements. Adaptive algorithms refine the mesh locally in the region where the solution exhibits irregular behaviour and a posteriori error estimates are the main tools to steer the adaptive mesh refinement. In this talk, we present a posteriori error analysis of discontinuous Galerkin methods for variational inequalities of the first kind and the second kind. Particularly, we study the obstacle problem and the Signorini problem in the category of variational inequalities of the first kind and the plate frictional contact problem for the variational inequality of the second kind. Numerical examples will be presented to illustrate the theoretical results.
Non linear difference equations of order more than one is a relatively new and dynamic area of research in applied mathematics. In particular, the theory of Rational difference equations emerged in the last two decades and is an ongoing challenging field of study. In this talk we will present a brief introduction to nonlinear difference equations with some applications to various fields. Some techniques used in the qualitative analysis of the global character of solutions will be outlined. We will also discuss the results of a recent paper in which the speaker has addressed and generalized, an open problem posed by E. Camouzis and G. Ladas.
Elliptic problems with discontinuous nonlinearity has its own difficulties due to the nondifferentiability of the associated functional. Hence, a generalized gradient approach developed by Chang has been used to solve such problems if the associated functional is known to be Lipchitz continuous. In this talk, we will consider critical elliptic problem in a bounded domain in $\\mathbb{R}^2$ with the simultaneous presence of a Heaviside type discontinuity and a powerlaw type singularity and investigate the existence of multiple positive solutions. Here discontinuity coupled with singularity does not fit into any of the known framework and we will discuss our approach employed to obtain positive solutions.
While discontinuous Galerkin (DG) methods had been developed and analyzed in the 1970s and 80s with applications in radiative transfer and neutron transport in mind, it was pointed out later in the nuclear engineering community, that the upwind DG discretization by Reed and Hill may fail to produce physically relevant approximations, if the scattering mean free path length is smaller than the mesh size. Mathematical analysis reveals, that in this case, convergence is only achieved in a continuous subspace of the finite element space. Furthermore, if boundary conditions are not chosen isotropically, convergence can only be expected in relatively weak topology. While the latter result is a property of the transport model, asymptotic analysis reveals, that the forcing into a continuous subspace can be avoided. By choosing a weighted upwinding, the conditions on the diffusion limit can be weakened. It has been known for long time, that the so called diffusion limit of radiative transfer is the solution to a diffusion equation; it turns out, that by choosing the stabilization carefully, the DG method can yield either the LDG method or the method by Ern and Guermond in its diffusion limit. Finally, we will discuss an efficient and robust multigrid method for the resulting discrete problems.
Discontinuous Galerkin methods have received a lot of attention in the past two decades since these are high order accurate and stable methods which can easily handle complex geometries, irregular meshes with hanging nodes and different degree polynomial approximation in different elements. Adaptive algorithms refine the mesh locally in the region where the solution exhibits irregular behaviour and a posteriori error estimates are the main tools to steer the adaptive mesh refinement. In this talk, we present a posteriori error analysis of discontinuous Galerkin methods for variational inequalities of the first kind and the second kind. Particularly, we study the obstacle problem and the Signorini problem in the category of variational inequalities of the first kind and the plate frictional contact problem for the variational inequality of the second kind. Numerical examples will be presented to illustrate the theoretical results.
We discuss the Gromov hyperbolicity of the Kobayashi metric on smooth convex domains in Euclidean space. We prove that if the boundary contains a holomorphic disc then the domain is not hyperbolic. On the other hand we give examples of convex (but not strongly pseudoconvex) domains which are hyperbolic. This is a joint work with Harish Seshadri.
We will describe quite carefully two classes of open threemanifolds. For one of them almost nothing is known about its Riemannian geometry and we will state open questions. For the second class a theorem is available as well as a complete classification.
We discuss the Gromov hyperbolicity of the Kobayashi metric on smooth convex domains in Euclidean space. We prove that if the boundary contains a holomorphic disc then the domain is not hyperbolic. On the other hand we give examples of convex (but not strongly pseudoconvex) domains which are hyperbolic. This is a joint work with Harish Seshadri.
On page 336 in his lost notebook, S. Ramanujan proposes an identity that may have been devised to attack a divisor problem. Unfortunately, the identity is vitiated by a divergent series appearing in it. We prove here a corrected version of Ramanujan’s identity. While finding a plausible explanation for what may have led Ramanujan to consider a series that appears in this identity, we are led to a connection with a generalization of the famous summation formula of Vorono. One of the ramifications stemming from this work allows us to obtain a onevariable generalization of two double Bessel series identities of Ramanujan that were proved only recently. This is work in progress and is joint with Bruce C. Berndt, Arindam Roy and Alexandru Zaharescu.
Grothendieck and Verdier introduced the notion of triangulated category to extract homological informations. This structure appear in many branches of Mathematics. Balmer introduced the notion of spectrum of tensor triangulated category as classifying support data. This opens a way for geometric study of theses abstract categorical data. Balmer also defined the structure sheaf on this spectrum and as an application reconstructed large class of schemes from the category of perfect complexes associated with them. In this talk we’ll recall Balmer’s construction of spectrum and its application to reconstruction problem. We’ll also discuss computation of Balmer spectrum for some other tensor triangulated categories obtained in a joint work with Vivek Mallick.
In this talk we address the problem of integrating entire functions (of several complex variables) in ‘polar coordinates’!
Wolfgang Kuhnel introduced the notion of tightness and conjectured that all tight triangulations of closed manifolds are strongly minimal. In a recent paper with B. Datta (European J. Comb. 36 (2014), 294–313), the speaker obtained a very general combinatorial criterion for tightness and found results in partial confirmation of this conjecture. We shall discuss these results.
It is known that there are only finitely many perfect powers in non degenerate binary recurrence sequences. However explicitly finding them is an interesting and a difficult problem for binary recurrence sequences. A recent breakthrough result of Bugeaud, Mignotte and Siksek states that Fibonacci sequences (F_n) given by F_0 = 0; F_1 = 1 and F_{n+2} = F_{n+1} + F_n for n >= 0 are perfect powers only for F_0 = 0; F_1 = 1; F_2 = 1; F_6 = 8 and F_12 = 144.
The talk is based on a joint paper with T.Alberts and J.Quastel. We consider directed polymers in a random environment. However the inverse temperature is scaled with the length of a polymer. It turn out that with a proper critical scaling one can get a nontrivial universal behaviour for the partition function and the end point distribution. Moreover the limiting partition function distribution asymptotically converges to the TracyWidom law as the rescaled inverse temperature tends to infinity.
Random matrices whose entries come from a stationary Gaussian process are studied. The limiting behavior of the eigenvalues as the size of the matrix goes to infinity is the main subject of interest in this talk. It is shown that the limiting spectral distribution is determined by the absolutely continuous component of the spectral measure of the stationary process, a phenomenon resembling that in the situation where the entries of the matrix are i.i.d. On the other hand, the discrete component contributes to the limiting behavior of the eigenvalues in a completely different way. Therefore, this helps to define a boundary between short and long range dependence of a stationary Gaussian process in the context of random matrices.
Most algebraist believe they know Linear Algebra. The purpose of this talk is to indicate that this is not necessarily true. We show a substantial amount of little known basic Linear Algebra and its connection to Algebraic Geometry, in particular to the theory of zerodimensional subschemes of affine spaces, and to Computer Algebra, in particular to the task of solving zerodimensional polynomial systems. Here are some questions which we will answer in this talk: What are the big kernel and the small image of an endomorphism? What are its eigenspaces and generalized eigenspaces if it has no eigenvalues? What is the kernel of an ideal? What is a commendable endomorphism? And what is a commendable family of endomorphisms? How is this connected to curvilinear and Gorenstein schemes? And how can you use this to solve polynomial systems?
In cooperative game theory , Shapley value and the nucleolus are two fundamental solution concepts. They associate a unique imputation for the players whose coalitional worths are given a priori.
If the data defining a problem and at least one solution to the problem lie in the same Archimedean ordered field induced by the data, we say that the problem has order field property. When this property holds one may hope to do only finitely many arithmetic operations on the data to arrive at one such a solution. For example if we start with rational data, the value and a pair of optimal strategies for the players in a zero sum two person game have rational entries. This was first noticed by Herman Weyl , and it was a precursor to solving them via the simplex method. For bimatrix games while Nash exhibited an equilibrium in mixed strategies, it was Vorobev and Kuhn who checked that the order field property holds for bimatrix games. Later Lemke and Howson gave the so called linear complementarity algorithm to locate an equilibrium pair in the same data field. For three person games, Nash with Shapley constructed simple counter examples for lack of order field property. In general stochastic games fail to have order field property.
A Boolean function is a mapping from the set of all binary ntuples to the set {0, 1}. Boolean functions are important building blocks in designing secure cryptosystems known as stream ciphers. Boolean functions also form an important class of linear codes, known as the ReedMuller codes. Over the last few decades, a lot of research has been done on Boolean function for its applications in cryptography and coding theory.
Given a L1 function f over an infinite measure space S how does one estimate the integral of f using statistical tools? In this talk we propose using regenerative sequences with heavy tails to do this. We obtain a consistent estimator and show the rate of convergence is slower than $1/\sqrt{n}$. When S is countable the SSRW works.
I will talk about techniques to approximate real functions such as $x^s,$ $x^{1}$ and $e^{x}$ by simpler functions and how these results can be used in the design of fast algorithms. The key lies in the fact that such approximations imply faster ways to approximate primitives such as $A^sv,$ $A^{1}v$ and $\exp({A})v$, and in the computation of matrix eigenvalues and eigenvectors. Indeed, many fast algorithms reduce to the computation of such primitives, which have proved useful for speeding up several fundamental computations, such as random walk simulation, graph partitioning, solving linear systems of equations, and combinatorial approaches for solving semidefinite programs.
This thesis investigates two different types of problems in multivariable operator theory. The first one deals with the defect sequence for a contractive tuple and the second one deals with wandering subspaces of the Bergman space and the Dirichlet space over the polydisc. These are described in (I) and (II) below.
Modular forms, particularly cusp forms, are ubiquitous objects in mathematics. A natural way to understand a cusp form is to study its Lp norms, for in principle the distribution of a function can be recovered from the knowledge of its moments. In this talk I will describe a new bound for the L4 norm of a cusp form of prime level q, as q tends to infinity. This work is joint with Jack Buttcane.
We consider the reconstruction problem for limited angle tomography using filtered backprojection (FBP). We introduce microlocal analysis and use it to explain why the wellknown streak artifacts are present at the end of the limited angular range. We explain how to mitigate the streaks and prove that our modified FBP operator is a standard pseudodifferential operator, and so it does not add artifacts. We provide reconstructions to illustrate our mathematical results. This is joint work with Juergen Frikel, Helmholtz Zentrum, Muenchen.
A family of sets is said to be unionclosed if the union of any two sets from the family remains in the family. Frankl’s conjecture, aka the unionclosed sets conjecture, is the remarkable statement that for any finite unionclosed family of finite sets, there exists an element that belongs to at least half of the sets in the family. Originally stated in 1979, it is still wide open. This will be an informal discussion on progress towards the conjecture.
The aim of this thesis is to give explicit descriptions of the set of proper holomorphic mappings between two complex manifolds with reasonable restrictions on the domain and target spaces. Without any restrictions, this problem is intractable even when posed for domains in C^n. We present results for special classes of manifolds. We study, broadly, two types of structure results:
Fundamental groups of smooth projective varieties are called projective groups. We shall discuss (cohomological) conditions on dimension that force such a group to be the fundamental group of a Riemann surface.
The Lectures will focus on topics that go beyond the classical framework of Hilbert spaces of holomorphic functions (Bergman spaces, Hardy spaces) on the unit ball or more general bounded symmetric domains. The main point is to include vectorvalued functions and even cohomology classes for nonconvex domains. The plan of the lectures is as follows:
We study the problem of characterizing functions, which when applied entrywise, preserve Loewner positivity on distinguished submanifolds of the cone of positive semidefinite matrices. Following the work of Schoenberg and Rudin (and several others), it is wellknown that entrywise functions preserving positivity in all dimensions are necessarily absolutely monotonic. However, there are strong theoretical and practical motivations to study functions preserving positivity in a fixed dimension $n$. Such characterizations are known only in the $n=2$ case.
Tits theory of spherical buildings gives a uniform geometric context to study all finite simple groups (except the alternating groups and the sporadic simple groups) and simple algebraic groups. More generally, the theory of buildings is central to the Lie theory associated with infinite root systems. These structures are `built of’ two basic objects: Coxeter complexes and Moufang generalized polygons. The generalized polygons (which includes projective planes) are rank 2 geometries (incidence geometries with 2 kind of objects  points and lines  and an incidence relation among them) whose classification is fundament, difficult and perhaps impossible.
Tits theory of spherical buildings gives a uniform geometric context to study all finite simple groups (except the alternating groups and the sporadic simple groups) and simple algebraic groups. More generally, the theory of buildings is central to the Lie theory associated with infinite root systems. These structures are `built of’ two basic objects: Coxeter complexes and Moufang generalized polygons. The generalized polygons (which includes projective planes) are rank 2 geometries (incidence geometries with 2 kind of objects  points and lines  and an incidence relation among them) whose classification is fundament, difficult and perhaps impossible.
A multiqueue system serves a multiclass population. Classes differ in their valuation of time. Oblivious routing in which routing is not informed by current queue status or past decisions is assumed. First, we explore the structure of the routing fractions that maximise social welfare. We then analyse the case customer are strategic and the queues have an admission price. We then argue that admission prices can be set to achieve optimal routing.
The conjecture is about various subgroup that can occur as the inertia subgroup of an etale Galois cover of an affine line at a point above infinity over an algebraically closed field of positive characteristic. I will explain this conjecture and mention some positive results supporting this conjecture.
This talk will be an elementary introduction to (Hilbert) module approach to operator theory. We explore the relationship of the classical von NeumannWold decomposition theorem and the BeurlingLaxHalmos theorem for isometries. We will also discuss a unified approach to the invariant subspace problem for bounded linear operators on Hilbert spaces. The talk will be accessible to general audience including graduate students.
This talk will be an elementary introduction to (Hilbert) module approach to operator theory. We explore the relationship of the classical von NeumannWold decomposition theorem and the BeurlingLaxHalmos theorem for isometries. We will also discuss a unified approach to the invariant subspace problem for bounded linear operators on Hilbert spaces. The talk will be accessible to a general audience including graduate students.
A conjecture of Gelander states that there is an effective triangulation in a compact deformation retract of a given locally symmetric space, giving linear bounds on the full homotopy type. This talk will explain some of this construction.
A conjecture of Gelander states that there is an effective triangulation in a compact deformation retract of a given locally symmetric space, giving linear bounds on the full homotopy type. This talk will explain some of this construction.
The mean curvature flow is a process under which a submanifold is deformed in its mean curvature vector’s direction. This process received more attention since it is an efficient way to construct submanifold which minimizes the volume : it is the negative gradient flow of volume functional. In this firs talk. I will discuss about basic tools in the study of mean curvature and describe some examples .
We consider nonlocal currents in the context of quantized affine algebras. In two special cases, these currents can be identified with configurations in the sixvertex and Izergin–Korepin nineteenvertex models. Mapping these to their corresponding Temperley–Lieb loop models, we directly identify nonlocal currents with discretely holomorphic loop observables. In particular, we show that the bulk discrete holomorphicity relation and its recently derived boundary analogue are equivalent to conservation laws for nonlocal currents. Joint with Y. Ikhlef, R. Weston and M. Wheeler.
Around 1960, Grothendieck developed the theory of descent. The aim of this theory is to construct geometric objects on a base space – in particular bundles, sheaves and their sections – in terms a generalized covering space which is visualized to lie upstairs' over the base space. The objects over the base space are obtained by
descending’ similar objects from the covering space. In late 1960searly 1970s, Deligne addressed the problem of how to understand cohomology of the base space via cohomology of a covering, by this time descending cohomology classes (instead of just descending global sections of sheaves, which is the case of 0th cohomology). The theory developed by Deligne, known as `Cohomological Descent’ has found important applications to Hodge theory and to cohomology of algebraic stacks. In these two expository lectures, I will begin with a quick look at Grothendieck’s theory of descent, and then go on to give a brief introduction to Deligne’s theory of Cohomological Descent.
Around 1960, Grothendieck developed the theory of descent. The aim of this theory is to construct geometric objects on a base space – in particular bundles, sheaves and their sections – in terms a generalized covering space which is visualized to lie upstairs' over the base space. The objects over the base space are obtained by
descending’ similar objects from the covering space. In late 1960searly 1970s, Deligne addressed the problem of how to understand cohomology of the base space via cohomology of a covering, by this time descending cohomology classes (instead of just descending global sections of sheaves, which is the case of 0th cohomology). The theory developed by Deligne, known as `Cohomological Descent’ has found important applications to Hodge theory and to cohomology of algebraic stacks. In these two expository lectures, I will begin with a quick look at Grothendieck’s theory of descent, and then go on to give a brief introduction to Deligne’s theory of Cohomological Descent.
The KadisonSinger problem is a question in operator theory which arose in 1959 while trying to make Dirac’s axioms for quantum mechanics mathematically rigorous. Over the course of several decades, this question was reduced to several equivalent conjectures about finite matrices, and shown to have significant implications in applied mathematics, computer science, and various branches of pure mathematics.
We prove that for any finite dimensional vector space $V$ over an algebraically closed field $K$, and for any finite subgroup $G$ of $GL(V)$ which is either solvable or is generated by pseudo reflections such that the order $G$ is a unit in $K$, the projective variety $\mathbb P(V)/G$ is projectively normal with respect to the descent of $\mathcal{O}(1)^{\otimes G}$, where $\mathcal{O}(1)$ denotes the ample generator of the Picard group of $\mathbb P(V)$. We also prove that for the standard representation $V$ of the Weyl group $W$ of a semisimple algebraic group of type $A_n , B_n , C_n , D_n , F_4$ and $G_2$ over $\mathbb{C}$, the projective variety $\mathbb P(V^m)/W$ is projectively normal with respect to the descent of $\mathcal{O}(1)^{\otimes W}$, where $V^m$ denote the direct sum of $m$ copies of $V.$
In this lecture we will study the well posedness problem for the nonlinear Schr\\{o}dinger equation for the magnetic Laplacian on $\\R^{2n}$, corresponding to constant magnetic field, namely the twisted Laplacian on $\\C^n$. We establish the well posednes in certain first order Sobolev spaces associated to the twisted Laplacian, and also in $L^2(\\C^n)$.
Points, lines and circles are among the most primitive and fundamental of mathematical concepts, yet few geometric objects have generated more beautiful and nontrivial mathematics. Deceptively simple in their formulation, many classical problems involving sets of lines or circles remain open to this day. I will begin with a sample that has spearheaded much of modern research, and explore connections with analysis, geometry, combinatorics  maybe also parallel parking.
In recent times, exponential type cost structure has become popular in control theory. In this talk we formulate and discuss a risk sensitive type control problem for a multiclass queuing system under the moderate deviation scaling. It is known that the rate function corresponding to the moderate deviation scaling is of Gaussian type. This property of the rate function is often useful for mathematical analysis. We show that the limiting game corresponding to our control problem is solvable. Also the limiting game has a similarity to the wellstudied Brownian control problems. This problem is also related to a conjecture of Damon Wischik (2001). The main difficulty in working with G/G/1 queuing network is that the underlying state dynamics is not Markov. Markov property has proven useful for these type of problems (see e.g., AtarGoswamiShwartz(2012)). The standard way to solve these problems is to look at the pde associated with the state dynamics and sandwich the limiting value between the upper and lower value of the game. This technique does not work when the state dynamics is not Markov. We will see that the special structure of the rate function and moderate deviation settings will be helpful to overcome such difficulties. Extension to manyserver models will also be discussed.
In this talk I will mainly focus on the existence and uniqueness of weak solutions to the nonlinear continuous coagulation and multiple fragmentation equations. In addition, the convergence analysis of two numerical methods (the fixed pivot technique and the cell average technique) for solving nonlinear coagulation or Smoluchowski equation is introduced. At the end, the convergence rates obtained from both the techniques are compared and mathematical results of the convergence analysis are also demonstrated numerically.
We discuss the notion of gap distributions of various lists of numbers in [0, 1], in particular focusing on those which are associated to certain lowdimensional dynamical systems. We show how to explicitly compute some examples using techniques of homogeneous dynamics. This works gives some possible notions of `randomness’ of special trajectories of billiards in polygons, and is based partly on joint works with J. Chaika, J. Chaika and S. Leliever, and with Y.Cheung.
Basic Algebraic Topology is built on considering objects (such as differential forms) up to boundary (e.g., exterior derivative). However, there is more structure in chains and boundaries that can be extracted by not immediately passing to quotients. We will discuss elementary examples of this, such as the Hopf invariant and Milnor’s higher linking.
The classical (as well as axiomatic) potential theory has been developed in the context of the study of analytic functions on Riemann surfaces, Newton potentials and Markov processes. This talk aims to develop a discrete version of potential theory on infinite graphs, based on the examples of electrical networks and infinite graphs.
We will continue our discussion of the Homotopy Transfer Theorem for Ainfinity algebras. We will introduce the notion of a minimal model for a dg algebra. This will allow us to relate quasiisomorphisms between strict dg algebras and quasiisomorphisms between Ainfinity algebras.
Homotopy Type Theory (HoTT), developed recently in a large collaboration centered at IAS, Princeton, combines elements from type theory, logic and topology to give alternative foundations of mathematics which are much closer to mathematical practice (useful for Automated Reasoning). HoTT also gives new insights into topology.
Homotopy Type Theory (HoTT), developed recently in a large collaboration centered at IAS, Princeton, combines elements from type theory, logic and topology to give alternative foundations of mathematics which are much closer to mathematical practice (useful for Automated Reasoning). HoTT also gives new insights into topology.
We will introduce the notion of a differential graded algebra that is not strictly associative, but associative up to chain homotopy. Such objects are called Ainfinity algebras or strong homotopy associative algebras. The goal is to state and prove the Homotopy Transfer Theorem, which states that any chain complex that is chain homotopic to an Ainfinity algebra has an Ainfinity structure and the maps in the chain homotopy can be lifted to a map of Ainfinity algebras.
Starting with the Euler characteristic in graph theory/combinatorics, we trace a brief history, first viewing it as an Euler class in topology, then as an obstruction to splitting of vector bundles and finally get to the more recent notion of the Euler class in algebra/geometry and its use as an obstruction to the splitting of projective modules. This recent notion has two approaches, Euler class groups and ChowWitt groups, the second of which uses the GerstenWitt complex as mentioned in the title. Time permitting, we hope to state results about both approaches.
HOTT (homotopy type theory) is logic built on type theory (mostly from Computer Science) and ideas from topology to give foundations of mathematics that are very elegant and much closer to mathematical practice. This makes HOTT very useful for computer proof systems, and also gives a very nice new synthetic treatment of homotopy theory.
HOTT (homotopy type theory) is logic built on type theory (mostly from Computer Science) and ideas from topology to give foundations of mathematics that are very elegant and much closer to mathematical practice. This makes HOTT very useful for computer proof systems, and also gives a very nice new synthetic treatment of homotopy theory.
Integral geometry is a field of mathematics that studies inversions and various properties of transforms, which integrate functions along curves, surfaces and hypersurfaces. Such transforms arise naturally in numerous problems of medical imaging, remote sensing, and nondestructive testing. The most typical examples include the Radon transform and its generalizations. The talk will discuss some problems and recent results related to generalized Radon transforms, and their applications to various problems of tomography.
The informal seminar on mathematical reasoning continues. This meetingwill be selfcontained (i.e., not dependent on previous sessions).
Many commonly used mixed finite elements for the Stokes problem only conserve mass approximately. We show that if we supplement polynomial basis functions with divergence free rational functions in the finite element method we can conserve mass exactly. Similarly, we show how to supplement polynomial basis in the finite element space with rational functions in when approximating linear elasticity problems in order to preserve angular momentum exactly. This is joint work with Michael Neilan (University of Pittsburgh).
Let u be a weak solution to a pharmonic system with vanishing Neumann data on a portion of the boundary of a domain which is convex. We show that subsolution type arguments for some uniformly elliptic PDE’s can be used to deduce that the modulus of the gradient is bounded depending on the Lipschitz character of the domain. In this context, I would like to mention that classical results on the boundedness of the gradient require the domain to be C^{1, Dini}. However, in our case, since the domain is convex, one can make use of the fundamental inequality of Grisvard which can be thought of as an analogue of the use of the barriers for Dirichlet problems in convex domains. Our arguments replaces an argument based on level sets in recent important works of Mazya, CianchiMazya and GengShen involving similar problems. I also intend to indicate some open problems in the regularity theory of degenerate elliptic and parabolic systems. This is a joint work with Prof. John L. Lewis.
We discuss the renormalization and reverse renormalization constructions used in studying the dynamics of germs of holomorphic diffeomorphisms fixing the origin in C with linear part a rotation. Such a germ is said to be linearizable if it is analytically conjugate to its linear part.
Motivated by rigidity problems for negatively curved manifolds, we study Moebius and conformal maps $f : \\partial X \\to \\partial Y$ between boundaries of CAT(1) spaces $X, Y$ equipped with visual metrics.

The systole of a compact Riemannian manifold (M,g) is the length of the shortest non contractible loop of M, it is attained by a periodic geodesic. A systolic inequality is a lower on the volume of any Riemannian metric depending only on the systole. If one consider the systole as a kind of ‘belt size’ of (M,g), a systolic inequality just says ‘the bigger the belt, the bigger the guy’. In this talk, we will discuss systolic inequalities for surfaces. We will prove optimal results for the torus and the projective plane (which go back to Loewner and Pu in the 50’s) and non optimal results for higher genus surfaces (due to Hebda and Gromov in the 80’s). This topic involve a nice mixture of metric geometry and elementary topology. If time permits, we will say a few words about higher dimensions.
In the seqries of 4 lectures, we will cover some aspects of the LittlewoodOfford problem. This problem concerns the anticoncentration phenomenon of sums of independent random variables and has applications to invertibility of random matrices and statistics of real zeros of random polynomials. The subject overlaps probability, combinatorics, additive combinatorics and some algebra.
The geometry of Metric spaces equipped with a probability measure is a very dynamic field. One motivation for the study of such spaces is that they are the natural limits of Riemannian manifolds in many contexts. In this talk, I will introduce basic properties of metric measure spaces and the GromovProhorov distance on them. I will also discuss joint work with Manjunath Krishnapur in which we show that independently sampling points according to the given measure gives an asymptotically biLipschitz correspondence between Metric measure spaces and Random matrices. Finally, I will briefly discuss work with Divakaran in which we study the compactification of the Moduli space of Riemann surfaces in terms of metric measure spaces.
In this thesis we investigate single and multiplayer stochastic dynamic optimization problems in both discrete and continuous time. In the multiplayer setup we investigate zerosum games with both complete and partial information. We study partially observable stochastic games with average cost criterion and the state process being discrete time controlled Markov chain. We establish the existence of the value of the game and also obtain optimal strategies for both players. We also study a continuous time zerosum stochastic game with complete observation. In this case the state is a pure jump Markov process. We investigate the finite horizon total cost criterion. We characterise the value function via appropriate Isaacs equations. This also yields optimal Markov strategies for both players.
We discuss two topics in this talk. First we study compact Ricciflat 4 manifolds without boundary and obtain pointwise restrictions on curvature (not involving global quantities such as volume and diameter) which force the metric to be flat. We obtain the same conclusion for compact Ricciflat Khler surfaces with similar but weaker restrictions on holomorphic sectional curvature. Next we study the reaction ODE associated to the evolution of the Riemann curvature operator along the Ricci flow. We analyze the behavior of this ODE near algebraic curvature operators of certain special type that includes the Riemann curvature operators of various symmetric spaces. We explicitly show the existence of some solution curves to the ODE connecting the curvature operators of certain symmetric spaces. Although the results of these two themes are different, the underlying common feature is the reaction ODE which plays an important role in both.
Tools from additive combinatorics are finding their way into numerous areas of mathematics and applied mathematics, and in particular have been central to recent developments in both random matrix theory and harmonic analysis. The goal of this short course is to understand some of these tools. (If time permits and the audience is willing to pitch in with some talks, we may also cover selected applications.)
Any real physical problem arising in fluid mechanics, when it is translated to mathematical approach generally govern a differential equation with some assumptions. The solution for such a study of the system is solved using analytical or numerical techniques. An attempt has been made to understand the characteristics or behavior or analysis of the physical system using different methods like Lighthills method, perturbation methods, rational approximation or Pad approximation, shooting technique and also highlights on the advantages and limitations of each method are discussed.
Let ${H}$ be a separable Hilbert space over the complex field. The class $S := \lbrace N_{M} : N$ is normal on ${H}$ and ${M}$ is an invariant subspace for $N \rbrace$ of operators was introduced by Halmos and consists of subnormal operators. Each subnormal operator possesses a unique minimal normal extension $\hat{N}$ as shown by Halmos. Halmos proved that $\sigma(\hat{N}) \subseteq \sigma(S)$ and then Bram proved that $\sigma(S)$ is obtained by filling certain number of holes in the spectrum $\sigma(\hat{N})$ of the minimal normal extension $\hat{N}$ of a subnormal operator in ${S}$.
I will describe work of Jonathan Williams giving a description of smooth 4manifolds in terms of certain collections of closed curves on surfaces and certain moves on them. This builds on constructions using Lefschetz pencils and their variants, but is a completely elementary description.
(Bio)chemical reaction networks are used in systems biology to model gene regulatory, protein, metabolic, and other cellular networks. Since existence of multiple steady states (MSS) provides the underpinnings for switching in chemical reaction networks, it is a fundamental problem to determine which network structures permit MSS. There exist several criteria which, when satisfied, establish that a network does not permit MSS regardless of the parameter values. On the other hand, results that establish that a network does permit MSS are rare. I will describe our recent work which provides a novel approach towards solving this problem. In the second part of the talk, I will describe stochastic switching which occurs in a network of neurons which is responsible for the distinct brain states of sleep and wake and for the transitions between the two states.
(Bio)chemical reaction networks are used in systems biology to model gene regulatory, protein, metabolic, and other cellular networks. Since existence of multiple steady states (MSS) provides the underpinnings for switching in chemical reaction networks, it is a fundamental problem to determine which network structures permit MSS. There exist several criteria which, when satisfied, establish that a network does not permit MSS regardless of the parameter values. On the other hand, results that establish that a network does permit MSS are rare. I will describe our recent work which provides a novel approach towards solving this problem. In the second part of the talk, I will describe stochastic switching which occurs in a network of neurons which is responsible for the distinct brain states of sleep and wake and for the transitions between the two states.
We consider a real analytic map f from R^4 to R^2 with a singularity at 0. One method to investigate the singularity is to work on its link L. If 0 is an isolated singularity then it is well known that L is a fibered link in the 3sphere S^3. This describes immediately a contact structure on S^3. In this talk we suggest that even if 0 is not an isolated singularity, we can associate to the singularity a welldefined stable Hamiltonian structure on S^3, provided that f describes a Seifert fibration on S^3, L being a multilink in this fibration. This condition is satisfied, for example, when f is complex analytic or f is given as g\\bar{h} with g and h being complex analytic. If the link is already fibered, the stable Hamiltonian structure is nothing but the contact structure mentioned above. Our construction is in fact far more general: given a Seifert multilink (not necessarily associated to a map from R^4 to R^2) in a Seifert fibered 3manifold, we build a welldefined stable Hamiltonian structure on the 3manifold.
In this talk, we shall discuss the complex of HNN  extensions associated to the free group F_n of finite rank n. We shall sketch a proof the following result The group of simplicial automorphisms of this complex is isomorphic to the group Out(F_n) of outer automorphisms of the free group F_n of rank n.
This talk will be on two themes that illustrate the rigidity and regularity of holomorphic mappings. The first part will deal with results concerning the smoothness of continuous CR (Cauchy – Riemann) mappings; in particular, that of Lipschitz continuous CR mappings from hextendible/semiregular hypersurfaces into certain Levi corank one hypersurfaces, in C^n. The second part will deal with the classification of Kobayashi hyperbolic, finite type rigid polynomial domains with abelian automorphism group in C^3.
One of the main goals of classical metric Diophantine approximation is to quantify the denseness of the rational numbers in the real numbers, or more generally, of Q^d in R^d. An equally natural problem is to quantify the denseness of the rational points on the sphere, and more generally, rational points in other compact and noncompact algebraic subvarieties in R^d. We will describe a solution to this problem for a large class of homogeneous varieties.
We will trace the evolution of the mean ergodic theorem, from its original formulation by vonNeumann to some very recent formulations valid in the context of algebraic groups and their lattice subgroups. We will then present a variety of recent applications of mean ergodic theorems, particularly to counting lattice points.
The affine stratification number of a variety is a measure of how far a variety is from being affine and how close it is to being projective. I shall talk about a certain filtration on the moduli space of curves and the affine stratification number of the open sets occurring in the filtration. This will lead to some cohomology computations where we shall make use of the natural operad structure on the homology of the moduli spaces as well as the some mixed hodge theory.
Jones Polynomial is an invariant of an oriented knot or link which assigns to each oriented knot or link a Laurent polynomial in the variable t^{1/2} with integer coefficients. We shall discuss the relationship between Jones Polynomial and representation of Knots through Tangles.
Jones Polynomial is an invariant of an oriented knot or link which assigns to each oriented knot or link a Laurent polynomial in the variable t^{1/2} with integer coefficients. We shall discuss the relationship between Jones Polynomial and representation of Knots through Tangles.
The curvature of a contraction T in the CowenDouglas class is bounded above by the curvature of the backward shift operator. However, in general, an operator satisfying the curvature inequality need not be contractive. In this talk we characterize a slightly smaller class of contractions using a stronger form of the curvature inequality. Along the way, we find conditions on the metric of the holomorphic Hermitian vector bundle E corresponding to the operator T in the CowenDouglas class which ensures negative definiteness of the curvature function. We obtain a generalization for commuting tuples of operators in the CowenDouglas class.
The talk will consist of two distinct parts. We will firt study the hyperbolicity of some domains in an almost complex manifold (M,J). In the second part we will study the question of the embeddability of compact almost complex manifolds in complex projective spaces.
Jones Polynomial is an invariant of an oriented knot or link which assigns to each oriented knot or link a Laurent polynomial in the variable t^{1/2} with integer coefficients. Though can be computed easily in terms of what are called skein relations, it originally arose from a studying a particular kind of a ‘trace’ of braid representations into an algebra derived as the quotient of a group ring of braid group. We shall discuss this construction of Jones Polynomial in the first talk. In the second part, we shall discuss the construction of Jones Polynomial from the tangle representation of Knots.
Grothendieck published an extraordinary paper entitled Resume de la theorie metrique des produits tensoriels topologiques in 1953. The main result of this paper is the inequality which is commonly known as Grothendieck Inequality. Following Kirivine, in this article, we give the proof of Grothendieck Inequality. We reformulate it in different forms. We also investigate the famous Grothendieck constant KG. The Grothendieck constant was achieved by taking supremum over a special class of matrices. But our attempt will be to investigate it, considering a smaller class of matrices, namely only the positive definite matrices in this class.
Ricci flow is a PDE that deform the metric of a Riemannian manifold in the direction of its Ricci curvature. For compact smooth manifolds, there is a well established existence and uniqueness theory. However for some applications it can be useful to consider Ricci flows of nonsmooth spaces, or metric spaces whose distance doesn’t come from a Riemannian metric. We will show that existence and uniqueness holds for the Ricci flow of compact singular surfaces whose curvature is bounded from below in the sense of Alexandrov.
The WhitneyGrauert theorem states that regular curves in R^2 (i.e. immersions of S^1) are classified up to regular homotopy by the winding number of the derivative. I will present Eliashberg and Geiges’s simple proof of this theorem, in which regular plane curves are realized as projections of curves in R^3 satisfying a certain geometric condition (they’ll be Legendrian curves in the standard contact structure). This is one of the simplest examples of the general pattern of lifting a purely topological problem to an equivalent but simpler problem in contact/symplectic geometry. No knowledge of contact geometry is assumed; the only prerequisite is differential forms on R^3.
I will discuss some constructions, results, questions and applications relating to the space of hyperbolic structures on a surface and its natural compactifications. I will assume that the audience understands what `hyperbolic structures on surfaces’ means.
We characterize the higher order Riesz transforms on the Heisenberg group and also show that they satisfy dimensionfree bounds under some assumptions on the multipliers. We also prove the boundedness of the higher order Riesz transforms associated to the Hermite operator. Using transference theorems, we deduce boundedness theorems for Riesz transforms on the reduced Heisenberg group and hence also for the Riesz transforms associated to special Hermite and Laguerre expansions.
We characterize the higher order Riesz transforms on the Heisenberg group and also show that they satisfy dimensionfree bounds under some assumptions on the multipliers. We also prove the boundedness of the higher order Riesz transforms associated to the Hermite operator. Using transference theorems, we deduce boundedness theorems for Riesz transforms on the reduced Heisenberg group and hence also for the Riesz transforms associated to special Hermite and Laguerre expansions.
We study risksensitive control of continuous time Markov chains taking values in discrete state space. We study both finite and infinite horizon problems. In the finite horizon problem we characterise the value function via HJB equation and obtain an optimal Markov control. We do the same for infinite horizon discounted cost case. In the infinite horizon average cost case we establish the existence of an optimal stationary control under certain Lyapunov condition. We also develop a policy iteration algorithm for finding an optimal control.
This is an informal lecture to celebrate the unprecedented event that I understand some piece of the work of some economists.
This is an informal lecture to celebrate the unprecedented event that I understand some piece of the work of some economists.
String topology is the study of the free loop space of a manifold LM. The loop product, defined on the homology of LM, is described intuitively as a combination of the intersection product on M and loop concatenation in the based loop space of M. However, since the intersection product is welldefined only on transversally intersecting chains, this description is incomplete. Brown’s theory of twisting cochains provides a chain model of a bundle in terms of the chains on the base and chains on the fiber. We extend this theory so that it can be applied to provide a model of the free loop space. We give a precise definition of the loop product defined at the chain level.
Google has recently released open source software called `coursebuilder’ (at https://code.google.com/p/coursebuilder/) to make interactive online courses consisting of videos interleaved with quizzes. In this brief presentation, I will show as an example a coursebuilder course I made and describe the process of making such courses. My goal is to convince that making online courses is both easy and worthwhile.
Necessity to understand the role of additional food as a tool in biological control programs is being increasingly felt, particularly due to its Ecofriendly nature. In this present talk, we develop/analyse a variation of standard predatorprey model with Holling type II function response which presents predatorprey dynamics in presence of some additional food to predators. The aim is to study the consequences of providing additional food on the system dynamics. A thorough mathematical analysis reveals that handling times for the available foods play a vital role in determining the eventual state of the system. It is interesting to observe that by varying the quality (characterised by the handling times) and quantity of additional food we can not only control and limit the prey, but also limit and eradicate the predators. In the context of biological pest control, the results caution the manager on the choice of quality and quantity of the additional food used for this purpose. We further study the controllability aspects of the predatorprey system by considering quality of the additional food as the control variable. Control strategies are offered to steer the system from a given initial state to a required terminal state in a minimum time by formulating Mayer problem of optimal control. It is observed that an optimal strategy is a combination of bangbang controls and could involve multiple switches. Properties of optimal paths are derived using necessary conditions for Mayer problem. In the light of the results evolved in this work it is possible to eradicate the prey from the system in the minimum time by providing the predator with high quality additional food, which is relevant in the pest management. In the perspective of biological conservation this study highlights the possibilities to drive the state to an admissible interior equilibrium (irrespective of its stability nature) of the system in a minimum time.
Credit risk refers to the potential losses that can arise due to the changes in the credit quality of financial instruments. There are two approaches to pricing credit derivatives, namely the structural and the reduced form or intensity based models. In the structural approach explicit assumptions are made about the dynamics of a firm’s assets, its capital structure, debt and share holders. A firm defaults when its asset value reaches a certain lower threshold, defined endogenously within the model. In the intensity based approach the firm’s asset values and its capital structure are not modelled at all. Instead the dynamics of default are exogenously given through a default rate or intensity.
We study several kinds of matching problems between two point processes. First we consider the set of integers $\\mathbb{Z}$. We assign a color red or blue with probability 1/2 to each integer. We match each red integer to a blue integer using some algorithm and analyze the matched edge length of the integer zero. Next we go to $\\mathbb{R}^{d}$. We consider matching between two different point processes and analyze a typical matched edge length $X$. There we see that the results vary significantly in different dimensions. In dimensions one and two (d=1,2), even $E[X^{d/2}]$ does not exist. On the other hand in dimensions more than two (d>2), $E[\\exp(cX^{d})]$ exist, where $c$ is a constant depends on $d$ only.
Rational points on elliptic curves have found applications in cryptography and in the solution to some problems dating back to antiquity. However, we still do not know how to find an elliptic curve with as many points as possible. In this talk, we will see how the theory of modular forms (of Ramanujan) along with a recently developed theory enables one to understand this problem. Along the way, we will see how congruences between coefficients of modular forms shed light on this problem.
We will discuss some questions concerning the existence of families of Siegel modular forms with some prescribed nonzero Fourier coefficients. If time permits, we also plan to discuss the question of characterizing cusp forms by the growth of their Fourier coefficients. Both are recent joint works with Siegfried Boecherer.
We will discuss some questions concerning the existence of families of Siegel modular forms with some prescribed nonzero Fourier coefficients. If time permits, we also plan to discuss the question of characterizing cusp forms by the growth of their Fourier coefficients. Both are recent joint works with Siegfried Boecherer.
Firstly, regarding Carry Value Transformation (CVT) some mathematical observations will be discussed. In using mathematical tools in Genomics we adopted twoway path. One is model based, another is issue based. Both these approaches will be discussed on using Human Olfactory receptors.
In this talk we will discuss some of the impact of Subramanian Chandrasekhar’s work on modern applied mathematics. One of the highlight of the talk will be a discussion of Chandrasekhar’s radiative transfer theory where he developed a number of breathtaking mathematical structures such as nonlinear integral equations for the Chandrasekhar H functions and X, Y functions as well as infinite dimensional Riccati (integropartial differential differential ) equations for the scattering matrix long before the infinite dimensional systems theory.
Some basic algebraic structures on the set of 1dimensional IVTs are introduced. Then discrete dynamical systems are defined through IVT maps and a report on convergence of the dynamical systems has been made. Finally, some problems which are unsolved yet in the domain are discussed.
Polynomial knots were introduced to represent knots in 3 space by simple polynomial equations. In this talk we will discuss how the degrees of these equations can be used in deriving information of some important knot invariants.
We wish to study those domains in $\mathbb{C}^n$, for $n\geq 2$, the socalled domains of holomorphy, which are in some sense the maximal domains of existence of the holomorphic functions defined on them. We shall demonstrate that this study is radically different from that of domains in $\mathbb{C}$ by discussing some examples of special types of domains in $\mathbb{C}^n$, $n\geq 2$, such that every function holomorphic on them extends to a strictly larger domain. This leads to Thullen’s construction of a domain (not necessarily in $\mathbb{C}^n$) spread over $\mathbb{C}^n$, the socalled envelope of holomorphy, which fulfills our criteria. With the help of this abstract approach we shall give a characterization of the domains of holomorphy in $\mathbb{C}^n$.The aforementioned characterization (holomorphic convexity) is very difficult to check. This calls for other (equivalent) criteria for a domain in $\mathbb{C}^n$, $n\geq 2$, to be a domain of holomorphy. We shall survey these criteria. We shall sketch those proofs of equivalence that rely on the first part of our survey: namely, on analytic continuation theorems. If a domain $\Omega\subset \mathbb{C}^n$, is not a domain of holomorphy, we would still like to explicitly describe a domain strictly larger than $\Omega$ to which all functions holomorphic on $\Omega$ continue analytically. One tool that is used most often in such constructions is called “Kontinuitaetssatz”. It has been invoked, without any clear statement, in many works on analytic continuation. The basic (unstated) principle that seems to be in use in these works appears to be a folk theorem. We shall provide a precise statement of this folk Kontinuitaetssatz and give a proof of it.
I will discuss some instances of the interplay between dynamics on homogeneous spaces of algebraic groups and Diophantine approximation, with an emphasis on recent developments. The latter includes joint work with Gorodnik and Nevo, and with Einsiedler and Lytle.
The curvature of a contraction T in the CowenDouglas class is bounded above by the curvature of the backward shift operator. However, in general, an operator satisfying the curvature inequality need not be contractive. In this talk we characterize a slightly smaller class of contractions using a stronger form of the curvature inequality. Along the way, we find conditions on the metric of the holomorphic Hermitian vector bundle E corresponding to the operator T in the CowenDouglas class which ensures negative definiteness of the curvature function. We obtain a generalization for commuting tuples of operators in the CowenDouglas class.
The $4$genus of a knot is an important measure of complexity, related to the unknotting number. A fundamental result used to study the $4$genus and related invariants of homology classes is the \emph{Thom Conjecture}, proved by KronheimerMrowka, and its symplectic extension due to OzsvathSzabo, which say that \textit{closed} symplectic surfaces minimize genus.
We shall discuss a new result that relates grafting, which are certain deformations of complex projective structures on a surface, to the Teichmuller geodesic flow in the moduli space of Riemann surfaces. A consequence is that for any fixed Fuchsian holonomy, such geometric structures are dense in moduli space.
We shall discuss a new result that relates grafting, which are certain deformations of complex projective structures on a surface, to the Teichmuller geodesic flow in the moduli space of Riemann surfaces. A consequence is that for any fixed Fuchsian holonomy, such geometric structures are dense in moduli space.
Let Y be a complex, projective manifold and X a smooth hyperplane section in Y. Given a submanifold Z in X, under what conditions is it cut out by a submanifold Z’ in Y. An analogous quesion can be asked for vector bundles on X: namely when is a bundle on X, the restriction of a bundle on Y.
In this thesis we study some Questions on vector bundles over hypersurfaces. More precisely, for hypersurfaces of dimension $\\geq 2$, we study the extension problem of Vector bundles. We try to find some conditions under which a vector bundle over an ample divisor of nonsingular projective variety, extends as a vector bundle to an open set containing that ample divisor.
We derive a form of the KPZ equation, which governs the fluctuations of a class of interface heights, in terms of a martingale problem, as the scaling limit of fluctuation fields with respect to some particle systems such as zero range processes. This is joint work in progress with P. Goncalves and M. Jara.
Tempered stable distributions were introduced in Rosinski 2007 as models that look like infinite variance stable distributions in some central region, but they have lighter (i.e. tempered) tails. We introduce a larger class of models that allow for more variety in the tails. While some cases no longer correspond to stable distributions they serve to make the class more flexible, and in certain subclasses they have been shown to provide a good fit to data. To characterize the possible tails we give detailed results about finiteness of various moments. We also give necessary and sufficient conditions for the tails to be regularly varying. This last part allows us to characterize the domain of attraction to which a particular tempered stable distribution belongs. We will also characterize the weak limits of sequences of tempered stable distributions. If time permits, we will motivate why distributions that are stablelike in some central region but with lighter tails may show up in applications.
von Neumann algebras are non commutative analogue of measure spaces. The study of maximal abelian subalgebras (masas) in finite von Neumann algebras is classical to the subject from its birth and is closely tied up with Ergodic theory. Dixmier introduced two types of masas, namely, regular (Cartan) and singular. The philosophies of these two kinds of masas until recently were regarded as being different from each other. After an introduction on the subject, we justify that the existing theories can be unified. Using techniques from Free Probability and playing with suitable amenable groups we exhibit: For each subset S of $\\mathbb{N}$ (could be empty), there exist uncountably many pairwise non conjugate (by automorphism) singular masas in the free group factors for each of which $S\\cup {\\infty\\}$ arises as its Pukanzsky invariant (multiplicity function). If time permits, some other issues related to mixing, coarse bimodules, and Banach’s problem on simple Lebesgue spectrum will be addressed.
von Neumann algebras are non commutative analogue of measure spaces. The study of maximal abelian subalgebras (masas) in finite von Neumann algebras is classical to the subject from its birth and is closely tied up with Ergodic theory. Dixmier introduced two types of masas, namely, regular (Cartan) and singular. The philosophies of these two kinds of masas until recently were regarded as being different from each other. After an introduction on the subject, we justify that the existing theories can be unified. Using techniques from Free Probability and playing with suitable amenable groups we exhibit: For each subset S of $\\mathbb{N}$ (could be empty), there exist uncountably many pairwise non conjugate (by automorphism) singular masas in the free group factors for each of which $S\\cup {\\infty\\}$ arises as its Pukanzsky invariant (multiplicity function). If time permits, some other issues related to mixing, coarse bimodules, and Banach’s problem on simple Lebesgue spectrum will be addressed.
This talk will be on two themes that illustrate the rigidity and regularity of holomorphic mappings. The first part will deal with results concerning the smoothness of continuous CR (Cauchy – Riemann) mappings; in particular, that of Lipschitz continuous CR mappings from hextendible/semiregular hypersurfaces into certain Levi corank one hypersurfaces, in C^n. The second part will deal with the classification of Kobayashi hyperbolic, finite type rigid polynomial domains in C^3.
A simplicial cell complex is roughly speaking a CW complex whose cells are all simplices. This notion is equivalent to that of simplicial poset in combinatorics. A simplicial complex is a simplicial cell complex, but two simplices in a simplicial cell complex may be glued together along more than one simplex on their boundaries. In this talk, I will discuss the characterization of face numbers of simplicial cell decompositions of some manifolds.
The notion of a GKM graph was introduced by GuilleminZara [1], motivated by a result of GoreskyKottwitzMacPherson [2]. A GKM graph is a regular graph with directions assigned to edges satisfying certain compatibility condition. The 1skeleton of a simple polytope provides an example of a GKM graph. One can associate a GKM graph $\\mathcal{G}_M$ to a closed manifold $M$ with an action of a compact torus satisfying certain conditions (those manifolds are often called GKM manifolds). Many important manifolds such as toric manifolds and flag manifolds are GKM manifolds. The GKM graph $\\mathcal{G}_M$ contains a lot of geometrical information on $M$, e.g. the (equivariant) cohomology of $M$ can be recovered by $\\mathcal{G}_M$. I will present an overview of some facts on GKM graphs.
The Grushin operator is defined as $G:=\Deltax^2\partial_t^2$ on $\mathbb{R}^{n+1}$. We study the boundedness of the multipliers $m(G)$ of $G$ on $L^p(\mathbb{R}^{n+1})$. We prove the analogue of the HormanderMihlin theorem for $m(G)$. We also study the boundedness of the solution of the wave equation corresponding to $G$ on $L^p(\mathbb{R}^{n+1})$. The main tool in studying the above is the operatorvalued Fourier multiplier theorem by Lutz Weis.
We study several kinds of matching problems between two point processes. First we consider the set of integers $\\mathbb{Z}$. We assign a color red or blue with probability 1/2 to each integer. We match each red integer to a blue integer using some algorithm and analyze the matched edge length of the integer zero. Next we go to $\\mathbb{R}^{d}$. We consider matching between two different point processes and analyze a typical matched edge length $X$. There we see that the results vary significantly in different dimensions. In dimensions one and two (d=1,2), even $E[X^{d/2}]$ does not exist. On the other hand in dimensions more than two (d>2), $E[\\exp(cX^{d})]$ exist, where $c$ is a constant depends on $d$ only.
We prove the Structure Theorem of the entropy solution. Furthermore we obtain the shock regions each of which represents a single shock at infinity. Using the structure Theorem we construct initial data $u_0\\in C_c^\\f$ for which the solution exhibits infinitely many shocks as $t \\rightarrow \\f$. Also we have generalized the asymptotic behavior (the work of Dafermos, Liu, Kim) of the solution and obtain the rate of decay of the solution with respect to the $N$wave.
Given a domain D in the complex plane and a compact subset K, Runge’s theorem provides conditions on K which guarantee that a given function that is holomorphic in some neighbourhood of K can be approximated on K by a holomorphic function on D. We look at an analogous theorem on noncompact Riemann surfaces, i.e., Runge’s approximation theorem, stated and proved by Malgrange. We revisit Malgrange’s proof of the theorem, invoking a very basic result in distribution theory: Weyl’s lemma. We look at two main applications of Runge’s theorem. Firstly, every open Riemann surface is Stein and secondly the triviality of holomorphic vector bundles on noncompact Riemann surfaces. Next, we look at the GunningNarasimhan theorem which states that every open (connected) Riemann surface can be immersed into $\\mathbb{C}$. We discuss the proof of this theorem as well, which depends on Runge’s theorem too. Finally we contrast the compact case to the noncompact case, by showing that every compact Riemann surface can be embedded into a large enough complex projective space.
Potential theory is the name given to the broad field of analysis encompassing such topics as harmonic and subharmonic functions, the Dirichlet problem, Green’s functions, potentials and capacity. We wish to gain a deeper understanding of complex dynamics using the tools and techniques of potential theory, and we will restrict ourselves to the iteration of holomorphic polynomials.
Let $M$ be a closed smooth manifold. Consider the space of Riemannian metrics $\\mathcal{M}$ on $M$. A real valued function on $\\mathcal{M}$ is called a Riemannian functional if it remains invariant under the action of the group of diffeomorphisms of $M$ on $\\mathcal{M}$. We will discuss some geometric properties of the critical points of certain natural Riemannian functionals in this lecture.
We consider functions $f$ on $\mathbb{R}^n$ for which both $f$ and their Fourier transforms $\hat{f}$ are bounded by the Gaussian $e^{\frac{a}{2}x^2}$ for some $0<a<1$. Using the Bargmann transform, we show that their FourierHermite coefficients have exponential decay. This is an extension of the one dimensional result of M. K. Vemuri, in which sharp estimates were proved. In higher dimensions, we obtain the analogous result for functions $f$ which are $O(n)$finite. Here by an $O(n)$finite function we mean a function whose restriction to the unit sphere $S^{n1}$ has only finitely many terms in its spherical harmonic expansion. Some partial results are proved for general functions. As a corollary to these results, we obtain Hardy’s uncertainty principle. An analogous problem is studied in the case of Beurling’s uncertainty principle.
I will discuss some of the results on projective modules and complete intersections spanning a few decades. So, necessarily, the details have to be sketchy. But, I hope to give the flavour and some of the still persistent questions in the field.
Let R be an integral domain such that every nonzero quotient R/mR is finite. Consider the unitaries and isometries on \\ell^{2}(R) induced by the addition and the multiplication operation of the ring R. The Calgebra generated by these unitaries and isometries is called the ring Calgebra and was studied by Cuntz and Li.
This work is concerned with two different problems in harmonic analysis, one on the Heisenberg group and other on $\\mathbb{R}^n$, as described in the following two paragraphs respectively.
This talk is on a topic in number theory, but should be accessible to a general mathematical audience.
In a foundational paper Operators Possessing an Open Set of Eigenvalues written several decades ago, Cowen and Douglas showed that an operator T on a Hilbert space H possessing an open set W (in complex plane) of eigenvalues determines a holomorphic Hermitian vector bundle ET . One of the basic theorems they prove states that the unitary equivalence class of the operator T and the equivalence class of the holomorphic Hermitian vector bundle ET are in one to one correspondence. This correspondence appears somewhat mysterious until one detects the invariants for the vector bundle ET in the operator T and viceversa. Fortunately, this is possible in some cases. Thus they point out that if the operator T possesses the additional property that dimension of the eigenspace at each point w in W is 1, then the map f on W, sending w to ker(Tw), admits a nonzero holomorphic section, say S, and therefore defines a line bundle LT on W.It is well known that the curvature KL of a line bundle LT is a complete invariant for the line bundle LT . On the other hand, define
We wish to study those domains in $\\mathbb{C}^n$, for $n\\geq 2$, the socalled domains of holomorphy, which are in some sense the maximal domains of existence of the holomorphic functions defined on them. We shall demonstrate that this study is radically different from that of domains in $\\mathbb{C}$ by discussing some examples of special types of domains in $\\mathbb{C}^n$, $n\\geq 2$, such that every function holomorphic on them extends to a strictly larger domain. This leads to Thullen’s construction of a domain (not necessarily in $\\mathbb{C}^n$) spread over $\\mathbb{C}^n$, the socalled envelope of holomorphy, which fulfills our criteria. With the help of this abstract approach we shall give a characterization of the domains of holomorphy in $\\mathbb{C}^n$.
Recently, the financial world witnessed a series of major defaults by several institutions and banks. Therefore, it is not at all surprising that credit risk analysis has turned out to be one of the most important aspects of study in the finance community. As credit derivatives are long term instruments, they are affected by the changes in the market conditions. Thus, it is appropriate to take into consideration the cyclical effects of the market. This thesis addresses some of the important issues in credit risk analysis for a regimeswitching market.
Two key steps devised by Harish Chandra for his construction of the global characters of discrete series for a noncompact real semisimple Lie group involve
Two key steps devised by Harish Chandra for his construction of the global characters of discrete series for a noncompact real semisimple Lie group involve
Please see the attachment to this email.
Please see the attachment to this email.
Title: Topological Rigidity
The operators $f(t) \\rightarrow f(ta)$ and $f(t) \\rightarrow e^{2\\pi bt} f(t)$ on $L^2(\\mathbb R)$ generate unitary representations of the discrete Heisenberg group $H$ with central character $e^{2\\pi abz}$. What are the irreducible representations of $H$ with this central character, and how can one synthesize the representation just described from them ? When $ab$ is rational, the answers are quite straightforward, but when $ab$ is irrational things are much more complicated. We shall describe results in both cases.
The operators $f(t) \\rightarrow f(ta)$ and $f(t) \\rightarrow e^{2\\pi bt} f(t)$ on $L^2(\\mathbb R)$ generate unitary representations of the discrete Heisenberg group $H$ with central character $e^{2\\pi abz}$. What are the irreducible representations of $H$ with this central character, and how can one synthesize the representation just described from them ? When $ab$ is rational, the answers are quite straightforward, but when $ab$ is irrational things are much more complicated. We shall describe results in both cases.
A fibred category consists of a functor $p:\mathbf N\longrightarrow \mathbf M$ between categories $\mathbf N$ and $\mathbf M$ such that objects of $\mathbf N$ may be pulled back along any arrow of $\mathbf M$. Given a fibred category $p:\mathbf N\longrightarrow \mathbf M$ and a model structure on the base category $\mathbf M$, we show that there exists a lifting of the model structure on $\mathbf M$ to a model structure on $\mathbf N$. We will refer to such a system as a fibred model category and give several examples of such structures. We show that, under certain conditions, right homotopies of maps in the base category $\mathbf M$ may be lifted to right homotopic maps in the fibred category. Further, we show that these lifted model structures are well behaved with respect to Quillen adjunctions and Quillen equivalences. Finally, we show that if $\mathbf N$ and $\mathbf M$ carry compatible closed monoidal structures and the functor $p$ commutes with colimits, then a Quillen pair on $\mathbf M$ lifts to a Quillen pair on $\mathbf N$.
Hurwitz equivalence is a simple algebraic relation on the set of ntuples in a group G. This and its generalizations are related to important problems in topology. I discuss some approaches to understanding Hurwitz equivalence.
Let D_1,…D_n be a system of commuting, formally selfadjoint, left invariant operators on a Lie group G. Under suitable hypotheses, we show that D_1,…D_n are essentially selfadjoint on L^2(G) and admit a joint spectral resolution, and we characterize their joint L^2 spectrum as the set of eigenvalues corresponding to a class of generalized joint eigenfunctions. Moreover, in the case G is a homogeneous group and D_1,…D_n are homogeneous, we obtain L^pboundedness results for operators of the form m(D_1,…D_n), analogous to the MihlinHormander and Marcinkiewicz multiplier theorems.
Conformal field theories (CFTs) are related (in Mathematics) to algebraic geometry, infinitedimensional Lie algebras and probability, and (in Physics) to critical phenomena and string theory. From a mathematical point of view, much of the formalisation has been from the point of view of algebra – in fact using formal power series. I will give a denition of the simplest chiral or holomorphic CFT using elementary function theory. If time permits, I will also explain operator product expansions.
The $Cos^\\lambda$ transform on real Grassmann manifolds was first studied in convex geometry. The definition of this integral transform has been later extended to Grassmann manifolds over $\\mathbb K$, where $\\mathbb K$ denotes the reals, the complex numbers or the quaternions.
We introduce the concept of optimal test functions that guarantee stability of resulting numerical schemes. PetrovGalerkin methods seek approximate solutions of boundary value problems in a trial space by weakly imposing all equations via a (possibly different) test space. A basic design principle is that while trial spaces must have good approximation properties, the test space must be chosen for stability. The optimal test functions are those that realize discrete stability constants equal to those in the wellposedness estimates for the undiscretized boundary value problem. When such functions are used within an ultraweak variational formulation, we obtain Discontinuous PetrovGalerkin (DPG) methods that exhibit remarkable stability properties. We present the first complete theory for the DPG for Laplace’s equation as well as numerical results for other more complex applications.
In this talk, we will begin with the definition of a unimodular row and its relation to Serre’s problem on projective modules. We will then see under what conditions group structures exist on orbit spaces of unimodular rows under elementary action.
Let $F$ be a closed orientable surface of genus $g \\geq 2$ and $C$ be a simple closed curve in $F$. Let $t_C$ denote a lefthanded Dehn twist about $C$. When $C$ is a nonseparating curve, D. Margalit and S. Schleimer showed the existence of such roots by finding elegant examples of roots of $t_C$ whose degree is $2g + 1$ on a surface of genus $g + 1$. This motivated an earlier collaborative work with D. McCullough in which we derived conditions for the existence of a root of degree $n$. We also showed that MargalitSchleimer roots achieve the maximum value of $n$ among all the roots for a given genus. Suppose that $C$ is a separating curve in $F$. First, we derive algebraic conditions for the existence of roots in Mod$(F)$ of the Dehn twist $t_C$ about $C$. Finally, we show that if $n$ is the degree of a root, then $n \\leq 4g^2 + 2g$, and for $g \\geq 10$, $n \\leq \\frac{16}{5}g^2+ 12g + \\frac{45}{4}$.
In this talk, we shall define $\\Gamma$contractions, which were introduced by Jim Agler and Nicholas Young. We shall construct an explicit $\\Gamma$isometric dilation of a $\\Gamma$contraction and produce a genuine functional model. A crucial operator equation has to be solved for constructing such a dilation. We shall show how the existence of such a solution characterizes a $\\Gamma$contraction. This solution, which is unique, also provides a complete unitary invariant.
Large dimensional data presents many challenges for statistical modeling via Bayesian nonparametrics, both with respect to theroetical issues and computational aspects. We discuss some models that can accomodate large dimensional data and have attractive theoretical properties, specially focussing on kernel partition processes, which are a generalization of the well known Dirichlet Processes. We discuss issues of consistency. We then move onto some typical computational problems in Bayesian nonparametrics, focussing initially on Gaussian processes (GPs). GPs are widely used in nonparametric regression, classification and spatiotemporal modeling, motivated in part by a rich literature on theoretical properties. However, a well known drawback of GPs that limits their use is the expensive computation, typically O($n^3$) in performing the necessary matrix inversions with $n$ denoting the number of data points. In large data sets, data storage and processing also lead to computational bottlenecks and numerical stability of the estimates and predicted values degrades with $n$. To address these problems, a rich variety of methods have been proposed, with recent options including predictive processes in spatial data analysis and subset of regressors in machine learning. The underlying idea in these approaches is to use a subset of the data, leading to questions of sensitivity to the subset and limitations in estimating fine scale structure in regions that are not well covered by the subset. Partially motivated by the literature on compressive sensing, we propose an alternative random projection of all the data points onto a lowerdimensional subspace, which also allows for easy parallelizability for further speeding computation. We connect this with a wide class of matrix approximation techniques. We demonstrate the superiority of this approach from a theoretical perspective and through the use of simulated and real data examples. We finally consider extensions of these approaches for dimension reduction in other non parametric models.
In this talk, we discuss two problems: the sampling problem for a given class of functions on $\mathbb{R}$ (direct problem) and the reconstruction of a function from finite samples (inverse problem). In the sampling problem, we are given a class of functions $V\subset L^2(\mathbb{R})$ and one seeks to find sets of discrete samples such that any $f$ in $V$ can be completely recovered from its values at the sample points. Here we address the sampling problem for the class of functions $V = V(\varphi)$, the (integer) shift invariant space defined by a generator $\varphi$ with some general assumption. In the second problem, we discuss the problem of reconstruction of a realvalued function $f$ on $X\subset \mathbb{R}^d$ from the given data $\{(x_i,y_i)\}_{i=1}^n\subset X\times\mathbb{R}$, where it is assumed that $y_i=f(x_i)+\xi_i$ and $(\xi_1,…,\xi_n)$ is a noise vector. In particular, we are interested in reconstructing the function at points outside the closed convex hull of $\{x_1,…,x_n\}$, which is the socalled extrapolation problem. We consider this problem in the framework of statistical learning theory and regularization networks. In this framework, we address the major issues: how to choose an appropriate hypothesis space and regularized predictor for given data through a metalearning approach. We employ the proposed method for blood glucose prediction in diabetes patients. Further, using real clinical data, we demonstrate that the proposed method outperforms the stateofart (time series and neuralnetworkbased models).
The empirical spectral distribution (ESD) of the sample variance covariance matrix of i.i.d. observations under suitable moment conditions converges almost surely as the dimension tends to infinity. The limiting spectral distribution (LSD) is universal and is known in closed form with support [0,4].
I will explain how the purely combinatorial RobinsonSchenstedKnuth correspondence can be used to give a simple proof of the classification of irreducible representations of symmetric groups in the semisimple case. It turns out that all the standard results in the representation theory of symmetric groups can be recovered using this approach.
We investigate the regularizing effect of adding small fractional Laplacian, with critical fractional exponent 1/2 , to a general first order HJB equation. Our results include some regularity estimates for the viscosity solutions of such perturbations, making the solutions classically welldefined. Most importantly, we use these regularity estimates to study the vanishing viscosity approximation to first order HJB equations by 1/2Laplacian and derive an explicit rate of convergence for the vanishing viscosity limit.
I shall give more details of the relation of intersections to hyperbolic geometry and give a sketch of the proof of the main theorem. I shall also outline to the relation of intersection numbers to the socalled Hurwitz equivalence, and hence to smooth 4manifolds.
The Goldman bracket associates a Lie Algebra to closed curves on a surface. I shall describe the bracket and its basic properties. I shall also sketch some joint work with Moira Chas, where we show that the Goldman bracket together with the operation of taking powers determines geometric intersection and selfintersection numbers.
Let f be a smooth function on the real line. The divided difference matrices of order n, whose, (i,j)th entries are the divided differences of f at (\\lambda_i,\\lambda_j) – where \\lambda_1,…,\\lambda_n are prescribed real numbers – are called Loewner matrices. In a seminal paper published in 1934 Loewner used properties of these matrices to characterise operator monotone functions. In the same paper he established connections between this matrix problem, complex analytic functions, and harmonic analysis. These elegant connections sent Loewner matrices into the background. Some recent work has brought them back into focus. In particular, characterisation of operator convex functions in terms of Loewner matrices has been obtained. In this talk we describe some of this work.
Heuristics indicate that point processes exhibiting clustering of points have larger critical radii for the percolation of their continuum percolation models than spatially homogeneous point processes. I will explain why the dcx ordering of point processes is suitable to compare their clustering tendencies. Hence, it is tempting to conjecture that the critical radius is increasing in dcx order. We will prove the conjecture for some nonstandard critical radii; however it is false for the standard critical radii. I will discuss the implications of these results. A powerful implication is that point processes dcxsmaller than a homogeneous Poisson point process admit uniformly nondegenerate lower and upper bounds on their critical radii. In fact, all the above results hold under weaker assumptions of ordering of moment measures and void probabilities of the point processes. Examples of point processes comparable to Poisson point processes in this weaker sense include determinantal and permanental point processes with traceclass integral kernels. Perturbed lattices are the most general examples of dcx sub and superPoisson point processes. More generally, we show that point processes dcxsmaller than a homogeneous Poisson point process exhibit phase transitions in certain percolation models based on the levelsets of additive shotnoise fields of these point process. Examples of such models are kpercolation and SINRpercolation. This is a joint work with Bartek Blaszczyszyn.
Model Theory, as a subject, has grown tremendously over the last few decades. Starting out as a branch of mathematical logic, it has now wide applications in most branches of mathematics, with algebra, algebraic geometry, number theory, combinatorics and even analysis, to name a few. In this talk, I will give a brief introduction to model theory, talk about the compactness theorem (one of the main tools in model theory) and how it is used, and give one famous application of model theory to algebra, namely, the AxKochen Theorem, the answer to Artin’s Conjecture. Time permitting, I will talk about a few more recent results in this direction.
Heuristics indicate that point processes exhibiting clustering of points have larger critical radii for the percolation of their continuum percolation models than spatially homogeneous point processes. I will explain why the dcx ordering of point processes is suitable to compare their clustering tendencies. Hence, it is tempting to conjecture that the critical radius is increasing in dcx order. We will prove the conjecture for some nonstandard critical radii; however it is false for the standard critical radii. I will discuss the implications of these results. A powerful implication is that point processes dcxsmaller than a homogeneous Poisson point process admit uniformly nondegenerate lower and upper bounds on their critical radii. In fact, all the above results hold under weaker assumptions of ordering of moment measures and void probabilities of the point processes. Examples of point processes comparable to Poisson point processes in this weaker sense include determinantal and permanental point processes with traceclass integral kernels. Perturbed lattices are the most general examples of dcx sub and superPoisson point processes. More generally, we show that point processes dcxsmaller than a homogeneous Poisson point process exhibit phase transitions in certain percolation models based on the levelsets of additive shotnoise fields of these point process. Examples of such models are kpercolation and SINRpercolation. This is a joint work with Bartek Blaszczyszyn.
Let G be the absolute Galois group of a field that contains a primitive pth root of unity. This is a profinite group which is a central object of study in arithmetic algebraic geometry. In joint work with Ido Efrat and Jan Minac, we have shown that a remarkably small quotient of this big group determines the entire Galois cohomology of G. As application of this result, we give new examples of profinite groups that are not realisable as absolute Galois groups of fields. I will present an overview of this work. ALL ARE CORDIALLY INVITED
The classical Fej\\‘erRiesz Theorem states that a nonnegative trigonometric polynomial can be factored as the absolute square of an analytic polynomial. Indeed, the factorization can be done with an outer polynomial. Various generalizations of this result have been considered. For example, Rosenblum showed that the result remained true for operator valued trigonometric polynomials. If one instead considers operator valued polynomials in several variables, one obtains factorization results for strictly positive polynomials, though outer factorizations become much more problematic. In another direction, Scott McCullough proved a factorization result for socalled hereditary trigonometric polynomials in freely noncommuting variables (strict positivity not needed). In this talk we consider an analogue of (hereditary) trigonometric polynomials over discrete groups, and give a result which includes a strict form of McCullough’s theorem as well as the multivariable version of Rosenblum’s theorem.
The classical Fej\\‘erRiesz Theorem states that a nonnegative trigonometric polynomial can be factored as the absolute square of an analytic polynomial. Indeed, the factorization can be done with an outer polynomial. Various generalizations of this result have been considered. For example, Rosenblum showed that the result remained true for operator valued trigonometric polynomials. If one instead considers operator valued polynomials in several variables, one obtains factorization results for strictly positive polynomials, though outer factorizations become much more problematic. In another direction, Scott McCullough proved a factorization result for socalled hereditary trigonometric polynomials in freely noncommuting variables (strict positivity not needed). In this talk we consider an analogue of (hereditary) trigonometric polynomials over discrete groups, and give a result which includes a strict form of McCullough’s theorem as well as the multivariable version of Rosenblum’s theorem.
Beginning with the attempts of Heisenberg and Pauli in the 1920’s, the subject grewat an astonishing speed, culminating in the remarkable predictive successof Quantum Electrodynamics.Different attemptsto bring the subjectto a sound mathematical footing (comparable to that of Quantum Mechanics)– whetheranalytic, operatoralgebraic or geometric – have tastedonly partial success. These talks will try to give a bird’seye view of the mathematical areas (ideas)spawned by these attempts, keeping in view the recent book of Folland on this subject.
ALL ARE INVITED
In this talk, we shall study about the leaking rate of the SinaiRuelleBowen (SRB) measure through holes of positive measure constructed in the Julia set of hyperbolic rational maps (open dynamics). The dependence of this rate on the size and position of the hole shall be explained. For an easier and better understanding, the simple quadratic map restricted on the unit circle will be analysed thoroughly. Time permitting, we will also compute the Hausdorff dimension of the survivor set.
Let A be a selfadjoint operator. We are interested in the discrete spectrum of B = A+M where B is nonselfadjoint. If the resolvent difference is in the Schatten class S_p, then we have an estimate on the distribution of the eigenvalues of B. By means of this estimate we can give qualitative estimates for the number of eigenvalues of B or their moments. That can be applied to Schodinger operators with complex potentials.
In finitedimensional control theory, feedback control using controllability Gramian goes back to results by Kleinman and Lukes in 1968 and 1970. Some years before, R. Bass characterized controls of minimal norms also using controllability Gramians. The extension of these results to infinitedimensional systems has a long history. Surprisingly, only reversible infinitedimensional systems have been considered in those results. We shall present existing results in the literature and we shall characterize stabilizing controls of minimal norms for parabolic systems. This is a joint work with S. Kesavan. Application to the stabilization of the NavierStokes equations will be given.
Certain classes of nonlocal pseudodifferential operators can be associated with Markov processes and this result has an infinite dimensional counterpart too. The best known example is the Levy process with its generator an integrodifferential operator. In this talk we will give an introduction to stochastic NavierStokes equation with jump (Levy) noise and point out opportunities for harmonic as well as stochastic analysis to gain understanding in solvability theory and applications such as control and filtering theory.
Stochastic partial differential equations (SPDE) are partial differential equations (PDE) with a `noise term’. One can think of these as a semimartingale in a function space or a space of distributions with a drift (a bounded variation process involving a second order elliptic partial differential operator ) and a noise term which is a martingale. When the martingale term is suitably structured, the solutions of these SPDE’s are closely related to certain finite dimensional diffusion processes and may be viewed as generalized solutions of the classical stochastic differential equations of Ito, StroockVaradhan and others. In this talk [based on Rajeev and Thangavelu (2008) and Rajeev (2010)], we describe how the expected values of the solutions give rise to solutions of PDE’s associated with the diffusion.
I will describe some joint work with Todorcevic on the Tukey theory of ultrafilters on the natural numbers. The notion of Tukey equivalence tries to capture the idea that two directed posets look cofinally the same, or have the same cofinal type. As such, it provides a device for a rough classification of directed sets based upon their cofinal type, as opposed to an exact classification based on their isomorphism type. This notion has recently received a lot of attention in various contexts in set theory. As background, I will illustrate the idea of rough classification with several examples, and explain how rough classification based on Tukey equivalence fits in with other work in set theory. The talk will be based on the paper Cofinal types of ultrafilters. A preprint of the paper is available on my website: http://www.math.toronto.edu/raghavan .
Serre’s mass formula counts the number of totally ramified degree$n$ extensions $E$ of a local field $F$, each extension being assigned some weight depending upon how ramified it is. We will present an elementary proof of this formula when the degree $n$ is prime.The background material will be covered, so that the talk should be accessible to a broad mathematical audience.
Serre’s mass formula counts the number of totally ramified degree$n$ extensions $E$ of a local field $F$, each extension being assigned some weight depending upon how ramified it is. We will present an elementary proof of this formula when the degree $n$ is prime.The background material will be covered, so that the talk should be accessible to a broad mathematical audience.
An analogue of Brylinski’s knot beta function is defined for a submanifold of ddimensional Euclidean space. This is a meromorphic function on the complex plane. The first few residues are computed for a surface in three dimensional space.
An analogue of Brylinski’s knot beta function is defined for a submanifold of ddimensional Euclidean space. This is a meromorphic function on the complex plane. The first few residues are computed for a surface in three dimensional space.
It is shown that the solutions of inviscid hydrodynamical equations with suppression of all spatial Fourier modes having wavenumbers in excess of a threshold $\kg$ exhibit unexpected features. The study is carried out for both the onedimensional Burgers equation and the twodimensional incompressible Euler equation. At large $\kg$, for smooth initial conditions, the first symptom of truncation, a localized shortwavelength oscillation which we call a “tyger”, is caused by a resonant interaction between fluid particle motion and truncation waves generated by smallscale features (shocks, layers with strong vorticity gradients, etc). These tygers appear when complexspace singularities come within one Galerkin wavelength $\lambdag = 2\pi/\kg$ from the real domain and typically arise far away from preexisting smallscale structures at locations whose velocities match that of such structures. Tygers are weak and strongly localized at first  in the Burgers case at the time of appearance of the first shock their amplitudes and widths are proportional to $\kg ^{2/3}$ and $\kg ^{1/3}$ respectively  but grow and eventually invade the whole flow. They are thus the first manifestations of the thermalization predicted by T.D. Lee in 1952. The sudden dissipative anomalythe presence of a finite dissipation in the limit of vanishing viscosity after a finite time $\ts$, which is well known for the Burgers equation and sometimes conjectured for the 3D Euler equation, has as counterpart in the truncated case the ability of tygers to store a finite amount of energy in the limit $\kg\to\infty$. This leads to Reynolds stresses acting on scales larger than the Galerkin wavelength and thus prevents the flow from converging to the inviscidlimit solution. There are indications that it may be possible to purge the tygers and thereby to recover the correct inviscidlimit behaviour.
One of the fundamental problems in Extremal Combinatorics concerns maximal set systems with forbidden subconfigurations. One such open problem concerns the conjecture due to Anstee and Sali on the order of maximal configurations with certain forbidden subconfigurations. I shall talk about some well known results, talk about the AnsteeSali conjecture, and finally talk about some of my recent work concerning Steiner designs occuring as maximal forbidden configurations for certain natural choices of subconfigrations. This generalizes a result of Anstee and Barekat.
I will report on the existence and properties of Hilbert spaces based on different families of complex, holomorphic or not, functions, like Hermite polynomials. The resulting coherent state quantizations of the complex plane will be presented. Some interesting issues will be examined, like the existence of the usual harmonic oscillator spectrum despite the absence of canonical commutation rules.
Higher cognitive functions require the coordination of large assemblies of
spatially distributed neurons in ever changing constellations. It is
proposed that this coordination is achieved through temporal coordination
of oscillatory activity in specific frequency bands. Since there is no
supraordinate command centre in the brain, the respective patterns of
synchronous activity selforganize, which has important implications on
concepts of intentionality and top down causation. Evidence will be
provided that synchronisation supports response selection by attention,
feature binding, subsystem integration, shortterm memory, flexible
routing of signals across cortical networks and access to the workspace
of consciousness. The precision of synchronisation is in the millisecond
range, suggesting the possibility that information is encoded not only in
the covariation of discharge rates but also in the precise timing of
individual action potentials. This could account for the high speed with
which cortical circuits can encode and process information. Recent studies
in schizophrenic patients indicate that this disorder is associated with
abnormal synchronisation of oscillatory activity in the high frequency
range (beta and gamma). This suggests that some of the cognitive deficits
characteristic for this disease result from deficient binding and
subsystem integration.
An important question in complex analysis is to solve the inhomogenous CauchyRiemann equations (also called the dbar equation) in a domain in C^n. The question of boundary smoothness in the dbar problem is classically dealt with by solving the associated dbar Neumann problem and showing that the solution operator, the $\\overline{\\partial}$Neumann operator is compact. For many domains of interest, in particular the product domains, this approach fails. We discuss in this talk some new results on the regularity of the dbar problem in product domains. This work is joint with MeiChi Shaw.
A geometry is a collection of lines and points satisfying the usual incidence axioms. By a theorem of Gromov, given an almost complex structure (which is `tame’) on the complex projective plane CP^2, we obtain a geometry by declaring appropriate holomorphic curves to be the lines. Ghys asked whether Desargues’s theorem (a Euclidean geometry result related to symmetry) characterises the standard complex structure. We show that this is indeed the case.
The abstract of this talk has been posted at:
The space of all complex structures on a surface, and the DeligneMumford compactification of this space, play an important role in many areas of mathematics. We give a combinatorial description of a space that is homotopy equivalent to the DeligneMumford compactification, in the case of surfaces with at least one puncture.
Why are soap bubbles spherical? Why do double soap bubbles have the shape that they do (three spherical caps meeting along a circle at 120 degree angles)? The single bubble problem was solved in the 19th century, and the double bubble problem was solved a few years ago. The analogous problem for triple soap bubbles remains a mystery. We will give an introduction to these problems and their solutions (when known).
It is very difficult in general to determine when a given compact in C^n, n>1, is polynomially convex. In this talk, we shall discuss polynomial convexity of some classes of sets. First, we shall consider two totallyreal surfaces in C^2 that contain the origin and have distinct tangent planes there. We shall discuss how the local polynomial convexity of the union of the tangent planes at (0,0) influences local polynomial convexity of the union of the surfaces at (0,0). Secondly, we will present a condition for local polynomial convexity of unions of more than two totallyreal planes in C^2 containing the origin. Next, we shall talk about pluri subharmonicity. Using this notion we shall give a new proof of an approximation theorem of Axler and Shields and also generalize it. Polynomial convexity plays a very central role in our proof. Finally we shall discuss a characterization for (large) compact patches of smooth totallyreal graphs in C^{2n} to be polynomially convex.
Let D be a smoothly bounded pseudoconvex domain in C^n, n > 1. Using G(z, p), the Green function for D with pole at p in D, associated with the standard sumofsquares Laplacian, N. Levenberg and H. Yamaguchi had constructed a Kahler metric (the socalled Lambda–metric) using the Robin function arising from G(z, p). The purpose of this thesis is to study this metric by deriving its boundary asymptotics and using them to calculate the holomorphic sectional curvature along normal directions. It is also shown that the Lambda–metric is comparable to the Kobayashi (and hence to the Bergman and Caratheodory metrics) when D is strongly pseudoconvex. The unit ball in C^n is also characterized among all smoothly bounded strongly convex domains on which the Lambda–metric has constant negative holomorphic sectional curvature. This may be regarded as a version of LuQi Keng’s theorem for the Bergman metric.
Kunze Stein inequality can be thought of as a semisimple version of Young’s inequality. A remarkable observation of M.G.Cowling and S.Meda shows that these inequalities can be naturally extended to Lorentz spaces. The final result in this direction was proved by A. Ionescu. In this talk we will try to explain the central ideas behind Kunze Stein type convolution inequalities for Lorentz spaces.
It is well known that there exist domains in C^n, n > 1, such that all functions holomorphic therein extend holomorphically past the boundary. In this talk, we shall examine this surprising phenomenon by discussing refinements of the fundamental example of Hartogs. We shall look at a generalization of Hartogs’ construction discovered by Chirka. Finally, we shall provide a partial answer to a related question raised by Chirka.
We derive the conservation form of equations of evolution of a front propagating in three dimensions. We obtain a system of six conservation laws, known as 3D kinematical conservation laws (KCL) in a ray coordinate system. The conservative variables of 3D KCL are also constrained by a stationary vector constraint, known as geometric solenoidal constraint, which consists of three divergencefree type conditions. The 3D KCL is an underdetermined system, and therefore, additional closure relations are required to get a complete set of equations. We consider two closure relations for 3D KCL: (1) energy transport equation of a weakly nonlinear ray theory (WNLRT) to study the propagation of a nonlinear wavefront, (2) transport equations of a shock ray theory (SRT) to study the propagation of a curved weak shock front. In both the cases we obtain a weakly hyperbolic system of balance laws. For the numerical simulation we use a highresolution semidiscrete central scheme. The second order accuracy of the scheme is based on MUSCL type reconstructions and TVD RungeKutta time stepping procedures. A constrained transport technique is used to enforce the geometric solenoidal constraint and in all the test problems considered, the constraint is satisfied up to very high accuracy. We present the results of extensive numerical experiments, which confirm the efficiency and robustness of the method and also its ability to capture many physically realistic features of the fronts.
This thesis considers two themes, both of which emanate from and involve the Kobayashi and the Carath\\‘{e}odory metric. First we study the biholomorphic invariant introduced by B. Fridman on strongly pseudoconvex domains, on weakly pseudoconvex domains of finite type in $\\mathbf C^2$ and on convex finite type domains in $\\mathbf C^n$ using the scaling method. Applications include an alternate proof of the WongRosay theorem, a characterization of analytic polyhedra with noncompact automorphism group when the orbit accumulates at a singular boundary point and a description of the Kobayashi balls on weakly pseudoconvex domains of finite type in $ \\mathbf C^2$ and convex finite type domains in $ \\mathbf C^n$ in terms of Euclidean parameters. Second a version of Vitushkin’s theorem about the uniform extendability of a compact subgroup of automorphisms of a real analytic strongly pseudoconvex domain is proved for $C^1$isometries of the Kobayashi and Carath\\‘{e}odory metrics on a smoothly bounded strongly pseudoconvex domain.
The most immediate way to use classical homotopy theory to study topological spaces endowed with extra structures, such as complex spaces, is to forget these structures and study the underlying topological space. Usually this procedure is inadequate since what we are forgetting is not homotopy invariant nor topological invariant. There are more sophisticated approaches to use homotopy theory to try to detect different complex structures on the same topological space which prove to be effective, for instance if the topological space is a complex variety and the complex structures endow the tangent bundle of different Chern classes/numbers. A much more thorough approach can be achieved by using model category theory to provide the category of complex spaces with holomorphic maps of an homotopy theory which realizes to the ordinary topological one, it is biholomorphic but not topological invariant. These techniques have been previously implemented by Morel and Voevodsky to create the so called A^1 homotopy theory of algebraic varieties few years ago.
Free groups and the group of their outer automorphisms have been extensively studied in analogy with (fundamental groups of) surfaces and the mapping class groups of surfaces. We study the analogue of intersection numbers of simple curves, namely the ScottSwarup algebraic intersection number of splittings of a free group and we also study embedded spheres in $3$ manifold of the form $ M =\\sharp_n S^2 \\times S^1 $. The fundamental group of $M$ is a free group of rank $n$. This $3$manifold will be our model for free groups. We construct geosphere laminations in free group which are analogues of geodesic laminations on a surface.
One of the most important subclasses of the class of normalized analytic univalent functions on the open unit disc D is the class of convex functions. In this talk we will focus on meromorphic analogues of the results known for this class. I.e. we consider functions that map D conformally onto a set whose complement is a bounded convex set. We shall begin with a brief history of Livingston’s conjecture which concerns the exact set of variability of the Taylor coefficients for concave functions. Thereafter, we shall discuss some new results concerning the closed convex hull of concave functions and extreme points of it.
We discuss applications of computers to prove mathematical theorems. In particular we discuss possible future applications in Topology/Geometry. This will also be the introductory lecture to the new course `Computer Assisted Topology/Geometry’
We discuss applications of computers to prove mathematical theorems. In particular we discuss possible future applications in Topology/Geometry. This will also be the introductory lecture to the new course `Computer Assisted Topology/Geometry’
Given a surface, one can consider the set of free homotopy classes of oriented closed curves (this is the set of equivalence classes of maps from the circle into the surface, where two such maps are equivalent if the corresponding curves can be deformed one into the other.) Given a free homotopy class one can ask what is the minimum number of times (counted with multiplicity) in which a curve in that class intersects itself. This is the minimal selfintersection number of the free homotopy class. Analogously, given two classes, one can ask what is the minimum number of times representatives of these classes intersect. This is the minimal intersection number of these two classes.
The appropriate context for algebraicgeometric realizations of holomorphic representations of a complex semisimple group is that of a compact homogeneous projective flag manifold Z = G/Q. One topic of more current interest is the study of the possibility of realizing (infinitedimensional) unitary representations of a real form G0 of G on function and/or cohomologyspaces of open G_0orbits D in Z (flag domains) and their cycle spaces. After an introduction for nonspecialists, we will indicate a proof by Schubert incidence geometry of the Kobayashi hyperbolicity of the relevant cycle spaces. This will then be applied to give an exact description of the group Aut_O(D) of holomorphic automorphisms.
The classical realization theorem gives various characterizations of functions in the unit ball of $H^\\infty(\\mathbb D)$, the bounded analytic functions on the unit disk $\\mathbb D$, which happens to also correspond to the multipliers of Hardy space $H^2(\\mathbb D)$. This realization theorem yields an elegant way of solving the NevanlinnaPick interpolation problem. In the mid 80s, Jim Agler discovered an analogue of the realization theorem over the polydisk. While for $d=2$, it once again gives a characterization of the elements of the unit ball of $H^\\infty(\\mathbb D^d)$ (and so allows one to solve interpolation problems in $H^\\infty(\\mathbb D^2)$), for $d>2$, the class of functions which are realized is a proper subset of the unit ball of $H^\\infty(\\mathbb D^d)$ — the socalled SchurAgler class.
Clifford analysis is a higher dimensional analogue of single variable complex analysis. Although functions take values in a finite dimensional Clifford algebra, the representation formula for Clifford regular functions is simpler and more powerful than for holomorphic functions of several complex variables. The talk shows how Clifford analysis techniques can be employed in operator theory for a functional calculus of $n$tuples of operators.
Methods to establish the limiting spectral distribution (LSD) of large dimensional random matrices include the moment method which invokes the trace formula. Its success has been demonstrated in several types of matrices such as the Wigner matrix and the sample variance covariance matrix. In a recent article Bryc, Dembo and Jiang (2006) establish the LSD for random Toeplitz and Hankel matrices using the moment method. They perform the necessary counting of terms in the trace by splitting the relevant sets into equivalence classes and relating the limits of the counts to certain volume calculations. We develop this method further and provide a general framework to deal with symmetric patterned matrices with entries coming from an independent sequence. This approach can be extended to cover matrices of the form Ap =XX’/n where X is a pxn matrix with p going infinity and n = n(p) going to infinity and p/n going to y between 0 and infinity. The method can also be used to cover some situations where the input sequence is a suitable linear process. Several new classes of limit distributions arise and many interesting questions remain to be answered.
For a noncompact complete and simply connected harmonic manifold M, we prove the analyticity of Busemann functions on M. This is the main result of this paper. An application of it shows that the harmonic spaces having minimal horospheres have the biasymptotic property. Finally we prove that the total Busemann function is continuous in C^\\infty topology. As a consequence of it we show that the uniform divergence of geodesics holds in these spaces.
Consider a system of N interacting particles evolving over time with Markovian dynamics. The interaction occurs only due to a shared resource. I shall briefly sketch the classical tightnessexistenceuniqueness approach used to prove weak convergence of the system to a limiting system as N tends to infinity. I shall illustrate another approach in more detail with the example of a nonlinear Markov chain. In the case of exchangeable particles, weak convergence of the system implies propogation of chaos i.e, in the limiting system particles evolve independently due to a deterministically shared resource.
After a brief introduction to some classical group invariants, we proceed to consider their generalizations with weights. We discuss some recent results on these weighted generalizations.
Heuristics indicate that more the clustering in a point process, worse the percolation will be. We shall in this talk see a first step towards a formal proof of this heuristic. Here is a more precise abstract of the results we shall see in the talk.
The polarization conjecture for R^d is that
Let R be the reflection group of the complex leech lattice plus a hyperbolic cell. Let D be the incidence graph of the projective plane over the finite field with 3 elements. Let A(D) be the Artin group of D: generators of A(D) correspond to vertices of D. Two generators braid if there is an edge between them, otherwise they commute.
Let H :R –> R. with multiple minima on R.For T> 0 consider the probability measure on R with pdf proportional to exp(–H/T). In this talk we discuss the problem of weak limits of this measure as T goes to infinity. It depends on the behaviour of H near its minima locations. Both Gaussian and stable limit laws arise as weak limits.
Consider a multidimensional diffusion model where the drift and the diffusion coefficients for individual coordinates are functions of the relative sizes of their current value compared to the others. Two such models were introduced by Fernholz and Karatzas as models for equity markets to reflect some wellknown empirically observed facts. In the first model, called ‘Rankbased’, the timedynamics is determined by the ordering in which the coordinate values can be arranged at any point of time. In the other, named the ‘Volatilitystabilized’, the parameters are functions of the ratio of the current value to the total sum over all coordinates. We show some remarkable properties of these models, in particular, phase transitions and infinite divisibility. Relationships with existing models of queueing, dynamic spin glasses, and statistical genetics will be discussed. Part of the material is based on separate joint work with Sourav Chatterjee and Jim Pitman.
Gaussian Minkowski functionals (GMFs) for reasonably smooth subsets of Euclidean spaces, are defined as coefficients appearing in the the Gaussiantubeformula in finite dimensional Euclidean spaces. The fact that the measure in consideration here is Gaussian, itself makes the whole analysis an infinite dimensional one. Therefore, one might want to generalize the definition of Gaussian Minkowski functionals to the subsets of Wiener space which arise from reasonably smooth (in Malliavin sense) Wiener functionals. As in the finite dimensional case, we shall identify the GMFs in the infinite dimensional case, as the coefficients appearing in the tube formula in Wiener space. Finally, we shall try to apply this infinite dimensional generalization to get results about the geometry of excursion sets of a reasonably large class of random fields defined on a “smooth” manifold.
ALL ARE INVITED
Coffee/Tea: 3:45 pm
We describe a relationship between cusp excursions of horocycles on the modular surfaces SL(2, R)/SL(2, Z) and diophantine approximation. Some of the work we discuss will be joint with G. Margulis, and some joint with Y. Cheung
Let $V$ be finite dimensional vector space over the field of complex numbers. Let $G$ be a finite subgroup of $GL(V)$, group of all $\mathbb{C}$ linear automorphisms of $V$. Then, the apmple generator of the Picard group of the projective space $\mathbb P(V)$ descends to the quotient variety $\mathbb{P}(V)/G$. Let $L$ denote the descent. We prove that the polarised variety $\mathbb P(V)/G, L$ is projectively normal when $G$ is solvable or $G$ is generated by pseudo reflections.
About thirtyfive years ago, several problems in operator theory concerning almost normal operators led L. G. Brown, P. A. fillmore and me to introduce methods and point of view from algebraic topology to solve them. By the time we were done concrete realization of Khomology was introduced as well as new insight obtained for the index theorem of AtiyahSinger.
We will discuss the notion of spectrum and arithmetic of spaces, and expound on the expectation that they should mutually determine each other for the class of locally symmetric spaces associated to congruent arithmetic lattices.
If X is a positive random variable with a finite mean then the probability distribution with density proprtional to X is called its size biased version. For Markov chains admitting a positive eigen function one can construct a size biased version of this chain which is also Markov.. In this talk we derive conditions for the two chains to be dominated by each other over the full trajectory space.. We then apply this to derive a LLOGL result for supercritical branching processes with arbitrary type space.
We are interested in deriving schemes having some ‘wellbalanced’ and ‘asymptotic preserving’ properties for the approximation of a nonlinear hyperbolic system with source term. In the case of Euler system with friction, the scheme is derived from simple Riemann solvers or equivalently using a relaxation scheme for the enlarged Euler system with ‘potential’. All interested are Welcome
Tits and Weiss in their book Moufang Polygons have conjectured that the groups of rational points of certain forms of E_6 are generated by some inner transformations. These groups occur as groups of similitudes of certain cubic forms in 27 variables. We will explain this conjecture and report on some results and reductions towards a positive answer.
We will discuss the notion of spectrum and arithmetic of spaces, and expound on the expectation that they should mutually determine each other for the class of locally symmetric spaces associated to congruent arithmetic lattices.
If X is a positive random variable with a finite mean then the probability distribution with density proprtional to X is called its size biased version. For Markov chains admitting a positive eigen function one can construct a size biased version of this chain which is also Markov.. In this talk we derive conditions for the two chains to be dominated by each other over the full trajectory space.. We then apply this to derive a LLOGL result for supercritical branching processes with arbitrary type space.
We will discuss the notions of polynomial and rational convexity. In particular, the question of existence of analytic structure on the additional part of the hull will be considered. Applications of polynomial and rational convexity to other problems of complex analysis will also be given.
We will investigate the large deviation rates for sums of the form $\sum_i f(x_i) g(x_{2i})$ where $\{x_i\}$ is a nice Markov process. In other words calculate
$\lim_{n\to\infty}{1\over n}\log E[\exp \sum_{i=1}^n f(x_i) g(x_{2i})]$
where $\{x_i\}$ is Markov Chain with transition probability $\pi(x, y)$.
http://www.univie.ac.at/nuhagphp/scheduler/index.php
Very large datasets occur in the area of machine learning (ML). The tasks are having a computer “learn” to read handwriting, to understand speech, to recognize faces, to filter spam email etc. Mathematically, these problems lead to huge optimization problems, of an, however not unfavorable type, namely convex quadratic programs (QP).
Information about available software to solve a large variety of optimization problems is provided at plato.asu.edu/guide.html while some of this software is evaluated at plato.asu.edu/bench.html. Starting with these sources an overview will be given on codes that are particularly useful for applications in mathematical finance.
I will introduce an exact stochastic representation for certain nonlinear transport equations (e.g. 3DNavierStokes, Burgers) based on noisy Lagrangian paths, and use this to construct a (stochastic) particle system for the NavierStokes equations. On any fixed time interval, this particle system converges to the NavierStokes equations as the number of particles goes to infinity.
The talk will be a report on an ongoing research project (joint with Preena Samuel and K.V.Subrahmanyam). Representation theoretic consequences will be worked out of the combinatorial characterizations of left, right, and twosided KazhdanLusztig cells of the symmetric group. Applications to invariant theory and both ordinary and modular representation theory of the symmetric group will be given.
http://math.iisc.ernet.in/~imi/downloads/gpisier.pdf
We study families of infinitedimensional algebras that are similar to semisimple Lie algebras as well as symplectic reflection algebras. Infinitesimal Hecke algebras are deformations of semidirect product Lie algebras, and we study two families over $\mathfrak{sl}(2)$ and $\mathfrak{gl}(2)$. Both of them have a triangular decomposition and a nontrivial center, which allows us to define and study the BGG Category $\mathcal{O}$ over them  including a (central character) block decomposition, and an analog of Duflo’s Theorem about primitive ideals. We then discuss certain related setups.
Reflected diffusions arise in many contexts. We identify a rather general condition under which these diffusions belong to the class of socalled Dirichlet processes, which are a generalization of continuous semimartingales that admit many nice properties, including an Ito formula. We also provide an example arising from applications, in which the reflected diffusion fails to be a semimartingale, but belongs to the class of Dirichlet processes. This is partly based on joint work with Weining Kang.
Embedded contact homology (ECH) is an invariant of threemanifolds due to Hutchings, Sullivan, and Taubes. It uses a contact structure on a threemanifold to produce an invariant of the underlying topological manifold. The invariant is the homology of a chain complex generated by certain closed orbits of the Reeb vector field (of interest in classical dynamics), whose differential counts certain holomorphic curves in the symplectization of the contact threemanifold. Few nontrivial examples of ECH have been computed. In this talk, I will give some background and context on ECH and then describe the computation of the ECH of circle bundles over Riemann surfaces, in which the relevant holomorphic curves are actually meromorphic sections of complex line bundles.
The central question will be focused around the design and implementation of neuronal circuitry involved in the task of decoding sensory information. Sensory information is encoded in the form of sequence of action potential spikes by the peripheral nervous system. This information is then passed onto the central nervous system (CNS) to generate an appropriate response. The action potential spikes are identical in shape and therefore it is assumed that all the information about the environment is embedded in the timing of occurrences of these spikes. The question then is, what neural architecture exists in the CNS to decode this information?
I will outline an approach to noncommutative geometry, due largely to M. Kontsevich, where certain Ainfinity categories play the role of spaces. This noncommutative geometry program draws much of its inspiration from homological mirror symmetry. The talk will be purely expository: it will not contain any new results.
The aim of this series of lectures is to seek analogies of some known uncertainty principles, proved in the case of the real line to certain solvable Lie groups. We will speak about uncertainty principles of Hardy, Cowling Price, Morgan and Beurling and present some recent results on their non commutative analogues. Furthermore, we will also talk about sharpness of the decay condition in Hardys principle and give some new result in that context.
We investigate the (in)consistency of different bootstrap methods for constructing confidence intervals in the class of estimators that converge at rate $n^{1\\over 3}$. The Grenander estimator, the nonparametric maximum likelihood estimator of an unknown nonincreasing density function $f$ on $[0,\\infty)$, is a prototypical example. We focus on this example and explore different approaches to constructing bootstrap confidence intervals for $f(t_0)$, where $t_0 \\in (0,\\infty)$ is an interior point. We find that the bootstrap estimate, when generating bootstrap samples from the empirical distribution function or its least concave majorant, does not have any weak limit in probability. Bootstrapping from a smoothed version of the least concave majorant, however, leads to strongly consistent estimators and the $m$ out of $n$ bootstrap method is also consistent. Our results cast serious doubt on some previous claims about bootstrap consistency (in the class of cube root problems) in the published literature.
In this talk, I will discuss threshold estimation for a regression function in some different settings. The threshold can either be a change–point, i.e. a point of jump discontinuity in an otherwise smooth curve, or the first time that a regression function crosses a certain level. Both problems have numerous applications in a variety of spheres, like biology (pharmacology, doseresponse experiments) and engineering. Our goal is to estimate thresholds of this type given a fixed budget of points to sample from, but with the flexibility that batch sampling can be done in several stages, so that adaptive strategies are possible. Our strategy is to use multistage zoomin procedures to estimate the threshold: an initial fraction of the sample is invested top come up with a first guess, an adequate neighborhood of the first guess is chosen, more points are sampled from this neighborhood and the initial estimate id updated. The procedure continues thus, ending in a finite number of stages. Such zoomin procedures result in accelerated convergence rates over any one–stage method. Approximations to relative efficiencies are computed and optimal allocation strategies, as well as recipes for construction of confidence sets discussed.
Consider a network of sites growing over time such that at step n a newcomer chooses a vertex from the existing vertices with probability proportional to a function of the degree of that vertex, i.e., the number of other vertices that this vertex is connected to. This is called a preferential attachment random graph. The objects of interest are the growth rates for the growth of the degree for each vertex with n and the behavior of the empirical distribution of the degrees. In this talk we will consider three cases: the weight function w(.) is superlinear, linear, and sublinear. Using recently obtained limit theorems for the growth rates of a pure birth continuous time Markov chains and an embedding of the discrete time graph sequence in a sequence of continuous time pure birth Markov chains, we establish a number of results for all the three cases. We show that the much discussed power law growth of the degrees and the power law decay of the limiting degree distribution hold only in the linear case, i.e., when w(.) is linear.We also discuss the case of arbitrary input sequence.
This is an expository talk whose aim will be to give an introduction to SLE (SchrammLoewner evolution), discovered by Oded Schramm in 2000 to describe many critical statistical mechanical systems.
I will give a brief overview of Wiles’ proof of Fermat’s Last Theorem, and explain the connection between modular forms and elliptic curves via Galois representations e.g. the TaniyamaShimura conjecture. In the second half, I’ll explain some recent results on padic modular forms and deformations of Galois representations. If time permits, I’ll outline a future project on ranks of elliptic curves.
We apply some of the ideas of the Ph.D. Thesis of G. A. Margulis to Teichmuller space. Let x be a point in Teichmuller space, and let B_R(x) be the ball of radius R centered at x (with distances measured in the Teichmuller metric). We obtain asymptotic formulas as R tends to infinity for the volume of B_R(x), and also for for the cardinality of the intersection of B_R(x) with an orbit of the mapping class group.
We apply some of the ideas of the Ph.D. Thesis of G. A. Margulis to Teichmuller space. Let x be a point in Teichmuller space, and let B_R(x) be the ball of radius R centered at x (with distances measured in the Teichmuller metric). We obtain asymptotic formulas as R tends to infinity for the volume of B_R(x), and also for for the cardinality of the intersection of B_R(x) with an orbit of the mapping class group.
The question we are interested in is the following: Given an Artinian local ring, how ‘close’ can we get to it by an Artinian Gorenstein local ring. In this talk I will make the notion of being ‘close’ precise numerically. We will exhibit some natural bounds on this number and discuss some (old and new) results. In particular, if R is a quotient of a power series ring over a field of characteristic zero by a power of the maximal ideal, we will see how one can compute this number.
Many applied problems give rise to generalised eigenvalue problems of the form Ay = s By, where A and B are operators of various possible types, and s is an eigenparameter. Two parameter embeddings Ay = s By  t Cy generate useful methods of attack, and can be traced back about a century, but new applications are still appearing. They provide ways to visualise simply some quite complicated phenomena, and in this talk I will discuss some older and newer ones that I have found interesting.
The ElGamal cryptosystem is in the heart of public key cryptography. It is known that the MOR cryptosysetm generalizes it from the cyclic group to the automorphism group of a (nonabelian) group. I will start by describing the MOR cryptosystem and then we will use the special linear group over a finite field as the platform group. It seems likely that this project is competitive with the elliptic curves over finite fields in terms of security. I’ll explain why I think so. Then we can talk about challenges in implementation of this cryptosystem. All interested are Welcome
We consider a system coupling the Stokes system with an elastic structure modelled by a finite dimensional system. We prove that this system can be driven to zero by a control action only in the fluid equation. The proof is based on a global Carleman inequality. Because of the coupling between the fluid equation and the structure new boundary terms appear in the Carleman inequality, and estimating these terms requires new techniques.
2D Mathematical model an numerical simulations of nonNewtonian shear depen= dent=20 flow with fluidstructure interaction
We study the secondary structure of RNA determined by WatsonCrick pairing without pseudoknots using Milnor invariants of links. We focus on the first nontrivial invariant, which can be interpreted in terms of the Heisenberg group as well as lattice paths, which we call the Heisenberg invariant.
We study the secondary structure of RNA determined by WatsonCrick pairing without pseudoknots using Milnor invariants of links. We focus on the first nontrivial invariant, which can be interpreted in terms of the Heisenberg group as well as lattice paths, which we call the Heisenberg invariant.
YangMills gauge theory, classical as well as quantum, in two dimensions is both mathematically tractable and poses interesting questions. The quantum theory for the field has a mathematically precise formulation in terms of a Gaussian measure. Classical holonomies become groupvalued random variables in this setting. This talk will present an overview of some mathematical problems, solutions, and ideas arising from twodimensional YangMills theory
The existing graph invariants can retrieve certain structural informations, but they are not sufficient to capture all qualitative aspects of a graph. One of the aim of graph theory to identify on one hand the unique and special feature for the network from a particular class and on the other hand the universal qualities that are shared by other network structures. It is a challenge to specify the domain of a given a network structure, on the basis of certain unique qualitative features. We develop theoretical scheme and apply the general method, based on the spectral plot of the normalized graph Laplacian, that is easily visually analyzed and can be considered as excellent diagnostic to categorize the networks from different sources. Construction with different graph operation related to evolution of a network produce specific eigenvalue, describe certain processes of graph formation that leave characteristic traces in the spectrum. We show how useful plausible hypothesis about evolutionary process can be made by investigating the spectra of a graph constructed from actual data. Based on this idea we have reconstructed proteinprotein interaction network which is structurally more close to real proteinprotein interaction networks than the networks constructed by other models. We also introduced a tentative classification scheme for empirical networks based on global qualitative properties detected through the spectrum of the Laplacian of the graph underlying the network.This method identifies several distinct types of networks across different domains of applications, which is rather difficult by other existing tool and parameters. Thus we infer that spectral distribution is complete qualitative characterization of a graph.
Let X be a compact complex manifold and let E be a holomorphic vector bundle on X. Any global holomorphic differential operator D on E induces an endomorphism of $\\text{H}^{\\bullet}(X,E)$. The supertrace of this endomorphism is the supertrace of D. This is a linear functional on the 0th Hochschild homology of Diff(E), the algebra of global holomorphic differential operators on E. While the Hochschild homology in the usual sense of Diff(E) is too big for explicit computation, there is a notion of completed Hochschild homology of Diff(E) with a very nice property: If HH_i(Diff(E)) denotes the ith completed Hochschild homology, then HH_i(Diff(E)) is isomorphic to \\text{H}^{2ni}(X), the 2ni th cohomology of X with complex coefficients. We shall attempt to outline how the supertrace mentioned above extends to a linear functional on the 0th completed Hochschild homology of Diff(E), and thus, on H^{2n}(X). A priori, this linear functional depends on E. It however, can be shown that it is precisely the integral over X. This fact also helps one connect the local RiemannRoch theorems of NestTsygan to the Hirzebruch RiemannRoch theorem. Analogous results about similar constructions using cyclic homology instead of Hochschild homology are also available.
In the standard stochastic geometric setting, wireless networks can be modeled as point processes and their performances as certain mean functionals of the point process. Obtaining closed form expressions of such functionals is not easy for a general class of point processes. This motivates a comparative study. We study comparison of one such class of mean functionals  the additive and extremal shotnoise fields  which arise naturally in modeling of wireless networks, as ingredients of the so called SignaltoInterferenceNoiseRatio.
We show that Trepreau’s theorem (minimality of a hypersurface at a point implies one sided extension of all CR functions) does not hold if the hypersurface is allowed to have singularities. We formulate a geometric condition called two sided support which is the obstruction to such extension.
We consider a point process sequence induced by a stationary symmetric stable (0 < < 2) discrete parameter random eld. It is easy to prove, following the arguments in the onedimensional case in Resnick and Samorodnitsky (2004), that if the random eld is generated by a dissipative group action then the point process sequence converges weakly to a cluster Poisson process. For the conservative case, no general result is known even in the onedimensional case. We look at a specic class of stable random elds generated by conservative actions whose eective dimensions can be computed using the structure theorem of nitely generated abelian groups. The corresponding point processes sequence is not tight and hence needs to be properly normalized in order to ensure weak convergence. This weak limit is computed using extreme value theory and some counting techniques. (This talk is based on a joint work with Gennady Samorodnitsky) All interested are Welcome
The purpose of the talk will be to discuss the problem about classifying domains in C^n that have a noncompact group of holomorphic automorphisms. Examples and a flavour of some of the techniques that have been successful so far will be provided.
In this lecture I will survey  aimed at a broad mathematical audience  the development of linear and integer programming. The history of these subjects began about one and a half centuries ago but their “boom” started in the 1950s only. Theory, algorithm design and analysis dominated the first years of development. Computational progress was particularly significant in the last twenty years. In fact, the advances in linear and integer programming software are on at least the same level as those in computing machinery.
These achievements combined with successful efforts to model applications make it possible to solve today real world problems of breath taking size and diversity. I will report about some of these success stories in my talk.
To an elliptic curve E, one can associate various twists L(E,\\chi,s) of Lfunctions. The values of these Lfunctions at integers are expected to behave well under the action of a Galois group. In this talk, we will explain how a Galois group acts on some special Lvalues and indicate some approaches in studying the behaviour under such actions.
The spectral Pickinterpolation problem, i.e. to determine when there exists a holomorphic map from the unit disc to the class of complex matrices of spectral radius less than one that interpolates prescribed data, has a complicated solution using operatortheory and controltheory methods. The difficulty in implementing this solution motivated a new approach pioneered by Agler and Young. Their methods led to a checkable necessary condition for Pick interpolation. But, from a complexgeometric viewpoint, it was unclear why the latter condition should be sufficient. In this talk, we will demonstrate that this condition is not sufficient. We will also present an inequality – largely linearalgebraic in flavour – that provides a necessary condition for matricial data for which the AglerYoungtype test provides no conclusions.
We discuss some questions on the triviality of rational Chow groups and give some examples in this direction.
We consider a point process sequence induced by a stationary symmetric stable (0 < < 2) discrete parameter random eld. It is easy to prove, following the arguments in the onedimensional case in Resnick and Samorodnitsky (2004), that if the random eld is generated by a dissipative group action then the point process sequence converges weakly to a cluster Poisson process. For the conservative case, no general result is known even in the onedimensional case. We look at a specic class of stable random elds generated by conservative actions whose eective dimensions can be computed using the structure theorem of nitely generated abelian groups. The corresponding point processes sequence is not tight and hence needs to be properly normalized in order to ensure weak convergence. This weak limit is computed using extreme value theory and some counting techniques. (This talk is based on a joint work with Gennady Samorodnitsky) All interested are Welcome
Lecture Series on “ Negatively curved Kahler manifolds” (4 Lectures)
Speaker: Dr. Martin Deraux, Institut Fourier, Grenoble
Time and place: LH 2, IISc Math Dept
Abstract:
Starting with a brief description of classical cryptography and the need for quantum cryptography, I will elaborate on some of the mathematical questions within quantum cryptography, ending with the details on a a particular problem  the construction of mutually unbiased basis.
String theorists believe that elementary particles can be described by one dimensional stringlike objects that propagate in certain geometries. An appropriate mathematical treatment combines the study of quantum field theory and geometry. Whether or not one believes in the physical (or even mathematical) reality of string theory as a whole, the idea to use onedimensional test particles to investigate the properties of interesting geometries allows far reaching insights both in quantum field theory and in geometry.
Typical adaptive meshrefining algorithms for firstoder (conforming) finite element methods consist of a sequence of the following steps:
For A=(1)^{l_1}(2)^{l_2}…(n)^{l_n} a conjugacy class in S_n, let
Supp(A)=\\Sum_{i=1}^n i\\cdot l_i=nl_1
Evaluation of the coefficient of the calsssum C in the product of the class sums A and B is reduced to a combinatorial problem in S_k, where k=min{Supp(A),Supp(B),Supp(C)}
Some notions of multivariate distribution transform and related quantile transform will be introduced and discussed. Some application of these statistical concepts and tools in social and natural sciences will be described.
The notion of modular symbols was first introduced by Manin. We state some basic results which relate modular symbols to special values of Lfunctions and padic Lfunctions. We give Greenberg and Stevens construction of an overconvergent modular symbols which is a measure valued cohomology class attached to a Hida family of modular forms with certain interpolation properties. We will construct the MazurKitagawa two variable padic Lfunction from the overconvergent modular symbol.
Hyperbolic balance laws with source terms allow nonunique entropy solutions. By taking the source term as a variable and stating its time derivative to be zero, a balance law can be rewritten in a quasilinear form. This then reveals the loss of strict hyperbolicity at critical states, the so called resonance phenomenon. Numerical schemes are sensitive to this phenomenon and it is uncertain, which entropy solution (if it is nonunique) will be created by an appropriate numerical scheme.
A family of elliptic curves (or an elliptic surface) is given by a Weierstrass equation
A family of elliptic curves (or an elliptic surface) is given by a Weierstrass equation
Informally, the zerorange'' particle system follows a collection of dependent random walks on a lattice, each of which interacts infinitesimally only with those particles already present at its location. In this talk, we consider the asymptotics of a distinguished, or tagged particle in this interacting particle system. In particular, we discuss a
nonequilibrium’’ invariance principle, in one dimension when the transition rates are meanzero, with respect to a diffusion whose coefficients depend on the ``hydrodynamic’’ density.
We discuss a conjecture for the HilbertSamuel multiplicity (degree) of a homogeneous ideal in a polynomial ring over a field. HerzogHunekeSrinivasan conjectured that the multiplicity can be bounded by a function of the maximum twists occuring at different homological degrees in a minimal graded free resolution of the ideal. We will discuss some examples and some cases where the conjecture is known to hold.
We consider the simplest models of Hermitian and non Hermitian random matrices with independent and identically distributed entries. We present basic results on limiting spectral distributions (Wigner’s semicircle law in the Hermitian case and Girko’s circular law in the non Hermitian case).
A central result used in studying higher linking of knots is a theorem of Stalling on lower central series. Stallings’s proof was based on spectral sequences, but he indicated that the result can be proved directly using Hopf’s description of homology of groups. In this talk Stallings theorem will be explained and a direct proof will be presented.
Calcium waves are an important means of intrcellular signaling. Intracellular calcium release at the endoplasmatic reticulum is a prime example of the role of stochastic effects in cellular systems. Realistic models consist of deterministic systems of reactiondiffusion equations in three dimensional space coupled to stochastic transitions of calcium channels at the domain boundary. The resulting dynamics has multiple time and space scales, which complicates computer simulations. In this talk we focus on the PDE aspect of the numerical computations. We use adaptive linear finite elements to efficiently resolve the extreme spatial gradients of concentration variables close to a channel. Further, parallel computing is needed for realistic simulations. We describe the algorithmic approach and we demonstrate its efficiency by computational examples. Our single channel model matches experimental data by Mak et al. (PNAS 95, 1998) and results in intriguing dynamics if calcium is used as a carrier. Random openings of the channel accumulate in bursts of calcium blips that may prove central for the understanding of cellular calcium dynamics. We plan to extend our computations to more realistic domain geometries and to use local time stepping methods.
Population balance equations are widely used in many chemical and particle process engineering problems involving crystallization, fluidized bed granulation, aerosols etc. Analytical solutions are available only for a limited number of simplified problems and therefore numerical solutions are frequently needed to solve a population balance problem. A general population balance equation for simultaneous aggregation, breakage, growth and nucleation in a well mixed system is given as an integropartial differential equation for a particle property distribution function. Sectional methods are well known for their simplicity and conservation properties. Therefore numerical techniques belonging to this category are the most commonly used. In these methods, all particles within a computational cell, which in some papers is called a class, section or interval, are supposed to be of the same size. These methods divide the size range into small cells and then apply a balance equation for each cell. The continuous population balance equation is then reduced to a set of ordinary differential equations. However, it is well known that the numerical results by previous sectional methods were rather inaccurate. Furthermore, there is a lack of numerical schemes in the literature which can be used to solve growth, nucleation, aggregation, and breakage processes, i.e. differential and integral terms, simultaneously. We present a new numerical scheme for solving a general population balance equation which assigns particles within the cells more precisely. The technique follows a two step strategy. The first is to calculate the average size of newborn particles in a cell and the other to assign them to neighboring nodes such that important properties of interest are exactly preserved. The new technique preserves all the advantages of conventional discretized methods and provides a significant improvement in predicting the particle size distributions. The technique allows the convenience of using geometric or equalsize cells. The numerical results show the ability of the new technique to predict very well the time evolution of the second moment as well as the complete particle size distribution. Moreover, a special way of coupling the different processes has been described. It has been demonstrated that the new coupling makes the technique more useful by being not only more accurate but also computationally less expensive. Furthermore, a new idea that considers the growth process as aggregation of existing particle with new small nuclei has been presented. In that way the resulting discretization of the growth process becomes very simple and consistent with first two moments. Additionally, it becomes easy to combine the growth discretization with other processes. Moreover all discretizations including the growth have been made consistent with first two moments. The new discretization of growth is a little diffusive but it predicts the first two moments exactly without any computational difficulties like appearance of negative values or instability etc. The accuracy of the scheme has been assessed partially by numerical analysis and by comparing analytical and numerical solutions of test problems. The numerical results are in excellent agreement with the analytical results and show the ability to predict higher moments very precisely. Additionally, an extension of the proposed technique to higher dimensional problems is discussed
This will be an informal expository talk on higher linking of knots in threedimensional space.
More than 30 years after the HarveyWells paper on complex approximation theory, we still do not know the answers to most of the relevant approximationtheoretic questions on, say, a smooth, compact 2manifold (call it M) in C^2. Answering many of these questions boils down to examining the local polynomial convexity of M near those points where the (extrinsic) tangent space of M is a complex subspace of the ambient C^2. We shall quickly survey what is currently known, and then look at some recent progress based on examining the Maslov index.
Orbifolds are generally regarded as generalizations of manifolds. On the other hand, finite groups are also orbifolds. In this survey talk, I will focus on how orbifolds appear naturally in some important areas of Mathematics and Physics. I will also describe some features of the geometry of orbifolds.
In this lecture I will give a brief survey on the wellknown ZariskiLipman Conjecture which is still open in general. However, there are some partial results have been proved. I will state these results by giving necessary definitions and concepts required.
Let $k$ be a field of characteristic not 2 and $G$ be an algebraic group defined over $k$. An element $t$ in $G(k)$ is called real if there exists $g \in G(k)$ such that $gtg^{1}=t^{1}$. An element $t\in G(k)$ is called strongly real if $t=\tau_1\tau_2$ where $\tau_i\in G(k)$ and $\tau_i^2=1$. We discuss when a semisimple real element is strongly real in $G(k)$. We investigate this question for classical groups and the groups of type $G_2$ in detail.