Invited Speakers

Professor Ruchi Das , Department of Mathematics, University of Delhi.

Title of the talk: Sightseeing Chaos in Nonautonomous Systems

Abstract: We shall navigate beginning from the iconic work of Kolyada and Snoha and on way shall discuss some interesting results by researchers in the related direction and shall conclude giving glimpses of some of our findings.

Professor C. S. Lalitha, Department of Mathematics, University of Delhi.

Title of the Talk: CONVEX OPTIMIZATION AND APPLICATIONS

Abstract: Some motivating problems in convex set theory such as the packing problem, Kepler's conjecture, and the existence of Gömböc along with certain important properties and concepts related to convex sets will be presented in the talk. The notion of convex functions and properties of convex functions and the optimality conditions of a convex optimization problem will be further discussed. Further, in this talk, a basic algorithm to solve a convex optimization problem followed by applications of convex optimization in medical imaging and facility location problems will be presented.

Professor Anuradha Sharma, Department of Mathematics, IIIT Delhi.

Title of the Talk: Enumeration Formulae for Self-dual, Self-orthogonal and LCD Codes over Finite Commutative Chain Rings

Abstract: In this talk, we will present explicit enumeration formulae for all self-orthogonal, self-dual and linear with complementary dual (LCD) codes of an arbitrary length over finite commutative chain rings. These enumeration formulae are useful in classifying these three classes of linear codes over finite commutative chain rings up to equivalence, which we will illustrate in certain special cases. We will also show that the class of LCD codes over finite commutative chain rings is asymptotically good and that every free linear code over a finite commutative chain ring with at least five elements is equivalent to an LCD code over the same chain ring. Besides this, we will explicitly determine all inequivalent LCD $[n,1,d]$-codes and $[n,n-1,d]$-codes over finite commutative chain rings for $1 \leq d \leq n.$ This is joint work with Monika Yadav.

Professor Kapil Sharma, Department of Mathematics, South Asian University, Delhi.

Title of the Talk: The Solution Methodologies for Singular Perturbation Models: Issues and Challenges

Abstract: The mathematical models having small parameters are characterized as perturbed models. To simplify the models, one needs to neglect the small parameters but some time these small parameters affect the output drastically. The perturbed models where the small change in the parameter affects the solution drastically are characterized as singular perturbation model. Here, we will restrict ourselves to singular perturbed model based on differential equations. The singularly perturbed differential equation is characterized by a parameter, which is multiplied in a highest order derivative term. In this talk, there is an attempt to introduce the audience with singularly perturbed problems and challenges in the development of the methods to solve this class of problems.

Dr Anima Nagar, Department of Mathematics, Indian Institute of Technology Delhi.

Title of the Talk: Quasifactors

Abstract: Minimal systems hold a special place in the theory of dynamical systems. We look into the special case of induced dynamics, and identify the minimal systems there. These minimal systems are called 'quasifactors', and are closely related to factors. We briefly look into whatever is known about them till date.

Dr Satyanarayana Reddy, Department of Mathematics, Shiv Nadar University.

Title of the Talk: Polynomials with integer coefficients divisible by cyclotomic polynomials

Abstract: We study polynomials with integer coefficients divisible by a cyclotomic polynomial whenever they are reducible. In the process, we also found a few irreducibility conditions of polynomials with integer coefficients.