Department of Mathematics, IIScWrite an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.
http://math.iisc.ac.in/
Fri, 12 Oct 2018 14:05:11 +0530Fri, 12 Oct 2018 14:05:11 +0530Jekyll v3.7.3Simon Marais List<p>Here is the list of students selected for participating in the
Simon Marais competition 2018.</p>
<p><strong>Singles category</strong></p>
<ol>
<li>Simran Jaykumar Gade</li>
<li>Anish Bhattacharya</li>
<li>Sarbartha Bhattacharya</li>
<li>Kartik Singh</li>
<li>Pranav Kasetty</li>
<li>Susheel Shankar</li>
<li>Archisman Panigrahi</li>
<li>Piyush Bhuwan Sati</li>
<li>Ayanesh Maiti</li>
<li>Samarth Hawaldar</li>
<li>Shafil Maheen N.</li>
<li>Chandrakant Harjpal</li>
<li>Chinmay S I</li>
<li>Rimika Jaiswal</li>
<li>Divij Mishra</li>
<li>Abhilash Mukherjee</li>
<li>Sagnik Barman</li>
<li>S. Yukthesh Venkat</li>
<li>M Prashant Krishnan</li>
<li>Nandagopal M.</li>
<li>Mihir Jain</li>
<li>M. Nikhesh Kumar</li>
<li>Kaushik Yashwant Bhagat</li>
<li>Achal Kumar</li>
<li>Praveen Jayakumar</li>
<li>Umang Bhat</li>
<li>Sagnik Barman</li>
<li>S. Shri Hari</li>
<li>Adit Vishnu P. M.</li>
<li>Bharat Vivan Thapa</li>
<li>S. R. Apuroopa</li>
</ol>
<p><strong>Pairs Category</strong></p>
<ol>
<li>Sutanay Bhattacharya, Pulkit Sinha</li>
<li>Ninad Hemant Huilgol, Chinmaya Kaushik</li>
<li>Yash Mehta, Vrunda Rathi</li>
<li>Nabarun Deka, Aaradhya Pandey</li>
<li>Ashim Kumar Dubey, S Sriram</li>
<li>R. Sainiranjan, Omkar Baraskar</li>
<li>Julian D’Costa, Gaurang S</li>
<li>Sidharth Soundararajan, Adithya Upadhya</li>
<li>Prakhar Gupta, Pranjal Pandurang Warade</li>
<li>Agneedh Basu, Arko Ghosh</li>
<li>Manan Bhatia, Pidaparthy Vasanth</li>
<li>Ishan Bhat, Kartikey Pratap Chauhan</li>
<li>Shreyas Raman, Sharan Srinivasan</li>
<li>Prathyush Prasanth Poduval, Aman Agarwal</li>
<li>Nishit Pandya, Shabarish Chenakkod</li>
<li>Anil Kumar, Shubham Kumar Pandey</li>
<li>Prathamesh Patil, Shibashish Mahapatra</li>
<li>Satabdee Sahoo, Sanjeet Panda</li>
<li>Adarsh Abraham Basumata, Abhinav Biswas</li>
<li>Aditi Ajith Pujar, Sukanya Majumder</li>
<li>Aarsh Chotalia, Mrugsen Gopnarayan</li>
<li>Pranshu Gaba, Aniruddh Balasubramaniam</li>
<li>Ankur Singh, Hitesh Kishore Das</li>
<li>Piush Ranjan Jena, Aman Anand</li>
</ol>
Wed, 03 Oct 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/10/03/simon-marais-list.html
http://math.iisc.ac.in/2018/10/03/simon-marais-list.htmlIISc-NTU Mathematics Workshop<p>An IISc NTU workshop will be held on the occasion of the visit of the NTU, Singapore, delegation to IISc on September 19, 2018. The schedule of the lectures is as below.</p>
<ol>
<li>
<p><strong>Speaker:</strong> Arvind Ayyer, Department of Mathematics, IISc</p>
<p><strong>Time:</strong> 10.00 to 10.20 am</p>
<p><strong>Title:</strong> The combinatorics of odd and chiral partitions</p>
<p><strong>Abstract:</strong>
We say that a partition is odd if its dimension (computed by the hook-length formula) is odd. It turns out that the number a(n) of odd partitions of a positive integer is always a power of 2. This was proven independently by Macdonald and McKay. We will show that the subposet of the Young lattice consisting of odd partitions is a binary tree, and give an explicit recursive characterisation of this tree. </p>
<p>We say that a partition is chiral if the associated irreducible representation composed with the determinant map gives the sign character. Denote the number of chiral partitions of n by b(n). L. Solomon first considered the problem of enumeration of b(n) and Stanley posed it as an open problem in his book. We solve this problem by giving an explicit formula for b(n). We also show that the enumerations of a(n) and b(n) are closely related. The primary tool in our solution is J. Olsson’s theory of core towers.</p>
<p>This is joint work with A. Prasad and S. Spallone.</p>
</li>
<li>
<p><strong>Speaker:</strong> Frederique Oggier</p>
<p><strong>Time:</strong> 10.20 to 10.40 am</p>
<p><strong>Title:</strong> Facets of Algebraic Coding Theory</p>
<p><strong>Abstract:</strong> I will briefly explain what algebraic coding theory is about, and exhibit connections to different areas of algebra/number theory such as finite fields (as is classically the case), group theory (finite groups), lattice theory (and modular forms), and central simple algebras (over number fields).</p>
</li>
<li>
<p><strong>Speaker:</strong> Navin Kashyap, IISc</p>
<p><strong>Time:</strong> 10.40 to 11.00 am</p>
<p><strong>Title:</strong> Overview of research activities in coding theory at IISc</p>
<p><strong>Abstract:</strong>
We will give a brief and not-so-comprehensive overview of the research activities that are taking place at IISc, chiefly within the ECE Dept., in the broad area of coding theory.</p>
</li>
<li>
<p><strong>Speaker:</strong> Nicolas Privault</p>
<p><strong>Time:</strong> 11.00 to 11.20 am</p>
<p><strong>Title:</strong> Normal approximation for sums of discrete U-statistics, with application to Kolmogorov bounds in random subgraph counting.</p>
<p><strong>Abstract:</strong> We derive normal approximation bounds in the Kolmogorov distance for sums of discrete multiple integrals and U-statistics made of independent Bernoulli random variables. Such bounds are applied to normal approximation for renormalized subgraphs counts in the Erdős-Rényi random graph. This approach recovers recent results obtained for triangles and extends them to the general setting of arbitrary graphs, while improving other bounds derived in the Wasserstein distance.</p>
</li>
<li>
<p><strong>Speaker:</strong> Vijay Natarajan, Computer Science and Automation, IISc</p>
<p><strong>Time:</strong> 11.20 to 11.40 am</p>
<p><strong>Title:</strong> Topological Feature-Directed Visualization </p>
<p><strong>Abstract:</strong>
Scientific phenomena are often studied through collections of related scalar fields generated from different observations of the same phenomenon. Exploration of such data requires a robust distance measure to compare scalar fields for tasks such as identifying key events and establishing correspondence between features within a data set and across data sets. In this talk, I will first introduce the problem of symmetry detection in scientific data and its role in the design of feature-directed visualization methods. The goal is to identify regions of interest within the domain of a scalar field that remain invariant under transformations of both domain geometry and the scalar values. The problem generalises to similarity identification when applied to time-varying and multi-field data. I will present algorithms to detect symmetry and similarity and discuss applications to visualization, interactive exploration, and visual analysis of large and feature-rich scientific data. [http://vgl.csa.iisc.ac.in]</p>
</li>
<li>
<p><strong>Speaker:</strong> Xia Kelin</p>
<p><strong>Time:</strong> 11.40 am to 12.00 pm</p>
<p><strong>Title:</strong> Topological modeling and analysis of big data in biomolecules</p>
<p><strong>Abstract:</strong> The availability of gigantic structure and gene data in various databanks has brought a great opportunity for researchers to quantitatively understand the biomolecular structure, dynamics and functions. In this presentation, we discuss the application of topological data analysis (TDA) in biomolecular data analysis. We introduce molecular topological fingerprints (MTFs) for biomolecular structure characterization. MTFs are derived from the persistent homology analysis and provide a unique representation that balances the topological simplification and geometric details. Multidimensional persistent homology is proposed and further used to quantitatively predict the stability of protein folding configurations generated by steered molecular dynamics. An excellent consistence between my persistent homology prediction and molecular dynamics simulation is found. Further, multiresolution persistent homology is proposed to handle extremely large biomolecular data. The essential idea is to match the resolution with the scale of interest so as to represent large scale datasets with appropriate resolution. By appropriately tuning the resolution of a density function, we are able to focus the topological lens on the scale of interest. The proposed multiresolution topological method has potential applications in arbitrary data sets, such as social networks, biological networks and graphs. Moreover, we offer persistent homology based new strategies for topological denoising and for resolving ill-posed inverse problems in Cryo-EM data. Finally, the recent progress in the topology based drug design has been briefly discussed.</p>
</li>
</ol>
Wed, 19 Sep 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/09/19/iisc-ntu-workshop.html
http://math.iisc.ac.in/2018/09/19/iisc-ntu-workshop.htmlNCM IST - PDE - Theory and Computation (2018).<p><a href="https://www.atmschools.org/2018/ist/pdetc/application-form">https://www.atmschools.org/2018/ist/pdetc/application-form</a></p>
Mon, 23 Jul 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/07/23/IST-PDE.html
http://math.iisc.ac.in/2018/07/23/IST-PDE.htmlAdvanced Instructional School (AIS) on several complex variables for the period June 11 to June 23, 2018<p><a href="https://www.atmschools.org/2018/ais/scv/speakers-and-syllabus">Visit this page <br />
https://www.atmschools.org/2018/ais/scv/speakers-and-syllabus</a></p>
Mon, 11 Jun 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/06/11/AIS.html
http://math.iisc.ac.in/2018/06/11/AIS.htmlIntegrated Ph.D Program 2018.<p><a href="http://math.iisc.ac.in/intphd2018result.html">CLICK HERE for list of candidates recommended for the Integrated PhD programme 2018.</a></p>
Fri, 01 Jun 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/06/01/intphdresult.html
http://math.iisc.ac.in/2018/06/01/intphdresult.htmlPh.D Research Program 2018.<p><a href="http://math.iisc.ac.in/phd2018result.html">CLICK HERE for list of candidates recommended for the PhD programme 2018.</a></p>
Thu, 31 May 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/05/31/phdresult.html
http://math.iisc.ac.in/2018/05/31/phdresult.htmlThe third Indo-Russian meeting in probability and statistics<p><a href="http://math.iisc.ernet.in/~manju/IndoRussian/indorussian.html">http://math.iisc.ernet.in/~manju/IndoRussian/indorussian.html</a></p>
Mon, 08 Jan 2018 00:00:00 +0530
http://math.iisc.ac.in/2018/01/08/probability-and-statistics.html
http://math.iisc.ac.in/2018/01/08/probability-and-statistics.htmlDiscussion meeting in Harmonic Analysis (in honour of Professor S Thangavelu)<p>A <a href="https://www.atmschools.org/2017/atmw/ha">wokshop in harmonic analysis</a> will be held at the department of mathematics from 11th of Dec to 16th of Dec. The workshop will be followed by a <a href="http://math.iisc.ac.in/~naru/dmha/">conference</a> (15th discussion meeting in harmonic analysis) which is in honour of S. Thangavelu who has turned sixty this year.</p>
Sun, 10 Dec 2017 00:00:00 +0530
http://math.iisc.ac.in/2017/12/10/harmonic-analysis.html
http://math.iisc.ac.in/2017/12/10/harmonic-analysis.htmlAlumni reunion<p>The annual alumni reunion of IISc is going to be held on December 16 and 17, 2017. We
request all the alumni of our department to register <a href="https://www.alumni.iisc.ac.in/event/iisc-alumni-reunion-2017">here</a>. We hope to see you in large numbers at this event.</p>
Wed, 29 Nov 2017 00:00:00 +0530
http://math.iisc.ac.in/2017/11/29/alumnireunion.html
http://math.iisc.ac.in/2017/11/29/alumnireunion.htmlNew Website<p>The Department is migrating to a new website, built in-house, on September 11, 2017. This is based on the <a href="https://jekyllrb.com/">Jekyll</a> static site generator, with styles and responsiveness using <a href="https://getbootstrap.com/">Bootstrap</a>. Comments, suggestions and corrections are most welcome.</p>
Sat, 02 Sep 2017 00:00:00 +0530
http://math.iisc.ac.in/2017/09/02/new-website.html
http://math.iisc.ac.in/2017/09/02/new-website.html