Академический Документы
Профессиональный Документы
Культура Документы
CONTENTS
Bakers Question on Dynamics of Permutable Entire Functions . . . Kuldeep Singh Charak 125
The Man Who Knew Infinity: Why Ramanujan Matters . . . Ken Ono and Robert Schneider 131
For Immediate Release IFC Films & Pressman Films THE MAN WHO KNEW INFINITY Partners With Expii,
Ken Ono, and the Templeton World Charity Foundation On The Spirit of Ramanujan Math Talent Initiative
A Global Search for Undiscovered Mathematical Talent 133
Visit: www.ramanujanmathsociety.org
Typeset in LATEX at Krishtel eMaging Solutions Pvt. Ltd., Chennai - 600 087 Phone: 2486 13 16 and printed at
United Bind Graphics, Chennai - 600 010. Phone: 2640 1531, 42769087.
An Introduction to the Kakeya Problem
Edward Kroc
In this essays first installment, we examined some funda- 4.1 Resolution of the Kakeya conjecture in R2
mental properties of the Kakeya maximal operator problem,
notably its connection with the set conjecture version of Although Cordoba was concerned with matters other than
the problem and how partial progress on the full conjecture the Kakeya problem, his result not only gives a quantitative
can be made by proving certain intermediate Lp estimates. upper bound for the norm of the maximal operator, it in fact
In this second installment, our main concerns will be the gives the optimal one. This settles the Kakeya conjecture in
L2 -theory and Bourgains seminal bush argument [7]. two dimensions. Unfortunately, the proof offers little insight
We will spend a considerable amount of time on the latter, as into the higher dimensional cases as it relies heavily upon
the ideas we develop will prove essential in the final install- the L2 structure. The crucial geometrical lemma below will
ment of this essay when we provide a treatment of Wolffs be our most valuable item in this main section and will be
Kakeya estimate [42]. utilized repeatedly to improve our understanding of the more
complicated higher dimensional cases. Although Cordobas
4. L2 -estimates estimate is on L2 , we state and prove the lemma in Rn , as
these critical geometric facts will be needed later in this greater
The Kakeya operator in two dimensions is well understood. generality.
This is largely due to the fact that the ambient geome-
Lemma 4.2 (Cordoba). For any pair of directions ek , el
try in the plane is often transparent and always pictorially
Sn1 and any pair of points a, b Rn , we have the
tractable. The Kakeya conjecture in R2 also enjoys a uniquely
estimates
affable position in no small part because of the powerful
duality properties of the L2 Hilbert space. These niceties
diam(Tek (a) Tel (b)) ! , (4.1)
quickly break down when we elevate the dimension, but |ek el |
the methods and estimates in this main section are highly and
classical and motivate the underlying techniques and fur- n
|Tek (a) Tel (b)| ! . (4.2)
ther results in the remainder of this exposition. Much of the |ek el |
now standard analysis has its roots in the original paper of
This lemma is the first critical geometric fact we need about
Cordoba [14].
intersections of tubes in Rn and we will use it repeatedly
In his 1977 paper, Cordoba was concerned primarily with
throughout the exposition. In line with our intuition, note that
studying the Bochner-Riesz spherical summation operators1
if the tubes lie very close together in space and in orienta-
and their boundedness on Lp (Rn ) for a certain range of p.
tion (i.e. if |ek el | ), then their intersection is nearly
Building largely off Feffermans work [19], Cordoba analyzed
2
full, |Tek (a) Tel (b)| ! n1 . If on the other hand the tubes
the boundedness of the Nikodym maximal function on R
are close in space but nearly orthogonal in orientation (i.e. if
to obtain a quantitative estimate on the norm of certain
|ek el | 1), then their intersection is essentially a -box in
Bochner-Riesz operators. In our context, we have the following
Rn , |Tek (a) Tel (b)| ! n . We proceed to the proof.
theorem.
Proof. Clearly we may assume that the tubes lie near each
Theorem 4.1 (Cordoba). In R2 , the following estimate
other in space otherwise there is nothing to prove. A typical
holds:
! high-intersection scenario is illustrated in Figure 1.
1
f L2 (S 1 ) ! log f L2 (R2 ) . We begin by proving (4.1). Recall that we may assume all
1
directions lie within 10
of the vertical. We can easily reduce
1 See Section 7.5 for a definition and brief discussion. to the case where the two tubes have a common center at the
Tek (a) 2 Tek (x) and Tel (b) 2 Tel (x). (4.3) Now tx and tx are both fixed numbers so we may assume that
|tx | |tx |. We want to bound |x| from above, so appealing to
Indeed, for any y Tek (a) we have (4.4) we see that it suffices to bound |mk | and |tx |. We already
have |mk | , so we only need a bound for |tx |.
|(y x) ek | |(y a) ek | + |(x a) ek | 1
Consider the triangle with vertices at mk , ml , and x as in
since x Tek (a) by assumption. Similarly, for any unit vector Figure 2. By the law of sines, we have that
v ek , we have sin sin
= ;
|mk ml | |tx |
|(y x) v| |(y a) v| + |(x a) v| 2.
consequently, we see that
A completely symmetric argument verifies the second contain-
|mk ml |
ment in (4.3). Without loss of generality we may translate the |tx | !
sin |ek el |
system so that x = 0; thus we see that
since sin = |ek el |. Evidently then, we have
Tek (a) Tel (b) 2 Tek (0) 2 Tel (0),
|x| |mk | + |tx | ! + ! . (4.6)
|ek el | |ek el |
so it suffices to show (4.1) with a = b = 0.
Let x Tek (0) Tel (0). We are going to parameterize x as The point x was arbitrarily chosen to lie in the intersection
we did in Section 3, only here we will have two parameteri- Tek (0) Tel (0), so (4.6) holds for all points in this intersection.
zations, one for each tube in which x lies. Accordingly, we Thus, we have
know that x lies on some unit line segment Ik that is parallel
to ek with midpoint mk B(0, ) lying within the unique diam(Tek (0) Tel (0)) = sup 2|x| !
xTek (0)Tel (0) |ek el |
hyperplane through the origin with normal vector ek . Similarly,
we know that x lies on some other unit line segment Il that by (4.6), verifying the first part of the lemma, (4.1).
is parallel to el with midpoint ml B(0, ) lying within the For the second part of the lemma, we apply another contain-
unique hyperplane through the origin with normal vector el . ment trick. We claim that
This is to be absolutely precise, but an appeal to Figure 2 should C
Tek (0) Tel (0) T |ek el | (0)
make the situation clearer. |ek el | ek
So we have two parameterizations of x Tek (0) Tel (0):
for some constant C. But this is immediate from our work
1 above. Indeed, since x Tek (0), we know that |xv| for any
x = mk + tx ek for some |tx | (4.4) " #
2 unit vector v ek and by (4.1), we know that x B 0, |ekCel |
Proof. Let {ek } be a maximal -separated subset of Sn1 and Using duality between lp and lp we have
'
suppose that p has the property stated in the hypothesis of the f p ! n1
yk fC (ek )
lemma. We can discretize the domain of the Kakeya maximal k
%
operator by appealing to a doubling-type argument. To see for some sequence {yk } such that n1 k |yk |p = 1. Plugging
this, suppose e, e Sn1 are such that |e e | < and fix in the definition of the maximal function, we find that
' )
any x Te (a) where a is an arbitrary point in Rn . Let E 1
f p ! n1 yk C f (x)dx
denote the principal axis of Te (a) and let b E be such that k
|Tek (ak )| TeC (ak )
k
$ $
Now $ | | e$ = |e1 | where e = (e1 , . . . , en ), so we see that the Let e denote the rotation that sends the unit vector e to e1 .
remaining restriction in (4.13) applies only to a single degree of Define e = e and notice that e e by the same
freedom. More precisely, for any direction e in the set defined reasoning as before. Consequently,
by (4.13), there is no restriction on its e2 , . . . , en components;
f (e) sup (e f )(a) = e f . (4.14)
the only restriction we need make is that |e1 | C
| |
. This defines aRn
a subset of the sphere that looks much like a ring with thickness
We proceed to the analysis. First we estimate (4.14) as
1
| |
in the e1 direction. Consequently, the size of this ring
1 1
is bounded by ! | |
! 1+| |
, since | | " 1. The lemma now e f e f1
follows accordingly. )
= |e ( )| |f( )|d (4.15)
We are now ready to prove our main theorem. Rn
Theorem 4.5 (Bourgain). Let n 3. Then we have the L2 which follows by the trivial fact that the norm of the Fourier
estimate transform defined as an operator from L1 to L is bounded
n2 by 1. Rewriting the right-hand side of (4.15) and applying
f L2 (Sn1 ) ! 2 f L2 (Rn ) .
Cauchy-Schwarz, we find that
Proof. We begin by writing our maximal operator as ) - .
9
6
a maximum of convolutions against smooth functions. | e ( )|
f (e) |f( )| |e ( )| (1 + | |) d
Naturally, this will allow us to take advantage of some nice 1 + | |
properties in the Fourier space. -) .1/2
Let e (x) = 1
Te (0) (x). Then
n1
|e ( )| |f( )|2 (1 + | |)d
)
1 () *1/2
f (e) = sup n1 f (y)dy |e ( )|
aRn Te (a) d . (4.16)
) 1 + | |
1
= sup n1 Te (0) f (y a)dy
aRn Rn We turn our attention to estimating the second integral in
(4.16). To do this, we first need to estimate |e |. In fact, since
= sup (e f )(a).
aRn e = e we need only analyze . Clearly, || is bounded
become log(1/), agreeing with the bound we acquired in the f n+1, !n n+1 f n+1 ,1 . (5.1)
2
previous section. As we have seen, this is more than we need to get the
2
The estimation done, we can now prove the desired L analogous bound on the Hausdorff dimension of Kakeya sets
bound. Combining (4.16) and (4.17), we find that in Rn , as it implies the equivalent strong type estimate on
) -) . the diagonal (see Section 2.4). We feel that this analytical
2 2
f 2 ! (n2)
|f ( )| (1 + | |) |e ( )|de d. overkill is still instructive though due to the prevalency of these
Rn Sn1
(4.18) techniques in much of the literature from the 1990s.
In Section 5.2, we will once again prove the estimate
Now we are in a position to apply the lemma. Notice that for " n+1 #
K 2 , this time exploiting a similar duality argument as was
any fixed Rn ,
used in Section 4.1. However, we will refine this approach,
)
|e ( )|de ! |supp(e ( ))| following Tao [39], and thus streamline the analysis. This will
Sn1 not only illustrate the different philosophies behind deriving
1 Kakeya estimates, but it will lay the foundation for the much
= |{e Sn1 : C Te1/ (0) }| !
1 + | | more complicated arguments of Section 6.
we are still left with the feeling that this result is clearly far for any collection of (1 )-tubes {T }, , then
from optimal, at least in light of the Kakeya set conjecture. But there is a bound
before we move onto proving a stronger bound, we will take
another look at the bush argument from a different angle. This f Lp (Sn1 ) # Af p .
new perspective will prove to be especially useful when we This will allow us to streamline the bush argument and
present Wolffs hairbrush argument in the next main section. concentrate more on the inherent geometrical nature of the
problem, rather than getting too bogged down in messy,
5.2 Taos approach
analytical details. This will prove to be very useful in the next
We introduce the notation A # B if one has A C B main section when we present the considerably more com-
" #
for every > 0. Thus A # B is weaker than A ! B, but plicated hairbrush argument to refine the estimate K n+1
2
to
" n+2 #
only by a factor of . In the context of the Kakeya conjec- K 2 . The following version of the bush argument, as well
tures, we see that a Kakeya estimate A # B is just as good as as all of Section 6, will liberally exploit the classic pigeonhole
A ! B since we can always afford to take a
loss. In fact, principle. We have already used this principle several times,
examining the maximal function conjecture (Conjecture 1.8) but now it will appear in nearly every reduction we make. It is
and Proposition 2.8 directly, we see that no finite number of worth mentioning that this principle will often be disguised
extra factors in our estimates will force us to weaken our as an application of the mean value theorem, its continuous
conclusions about the norm of the operator or the dimension analogue. This simple but powerful tool will aid us in trimming
of Kakeya sets. much of the analysis down to a more intuitively palpable level.
One of the attractive features of working with restricted To prove Proposition 5.7, we will combine two intermediate
weak type estimates as in Bourgains argument is that, by lemmas.
definition of the maximal function, we are then led to analyze
Lemma 5.8. Let 1 < p < and let {T }, be any
how dense a given -tube is in a set E; this is the sub-
collection of (1 )-tubes with orientations from
stance of (5.5). However, we can simplify matters further by
any -separated set , Sn1 . Then a bound of the form
disregarding the arbitrary set E. After all, the geometry of the
& & ( * 1
problem should depend only upon how our -tubes interact &' & ' p
& &
with each other. Thus, we would like to trim the argument down & T & # A |T | (5.16)
&, & ,
p
and simplify the objects we are working with. Tao offers the
best path to this slick treatment and we will follow his lecture implies a bound
notes [40] for the remainder of this and the following main
f Lp (Sn1 ) # Af p .
section.
Basically, we want to make use of the duality approach as Clearly, we can estimate (5.16) as
in Section 4. In its present form, this may actually compli- ( * 1
' p
cate things, so we will first strengthen Lemma 4.3 to remove A |T |
1
A ( n1 #,) p
the dependency on our set of directions being maximally ,
so there is no harm in assuming y 0. With this in place, holds for all -separated sets , with #, N. Since we are
define assuming (5.15) holds, we know that c(N ) # 1; in light of
(5.17), we need to improve this estimate to
,1 = { , : 0 y < 1},
1
j +1
c(N ) # ( n1 N) p . (5.22)
,j = { , : 2 y < 2 j
}, j 0.
? We will use a probability trick to derive this estimate from a
Clearly then , = j ,j and
recursive inequality.
' '
'
'
1n =
yp =
yp
2jp #,j . (5.18) Suppose that N 1n . By definition, we can find a
j =1 ,j j =1 -separated set , such that #, = N and
& &
Now &' &
& & & & & &
&' & ' &' & & T & = c(N ).
& & & & &, &
& y T & & y T & , (5.19) p
& & j =1 &, &
p j p
Now let U be a rotation in Rn selected uniformly at random
but we would like to remove the dependency on the y s from from the orthogonal group O(n) and consider the set U (,).
j
this expression. As such, we let z = 2 y for all ,j so It is an easy probability exercise to show that this set will be
that z 1. Then (5.19) becomes disjoint from , almost surely. If we define TU () to be the
& & & &
' & & ' &
& ' & &' &
& rotated tube U (T ), then by symmetry we have
2j & z T & ! 2j & T & & &
j
& ,
& j
& ,
& & ' &
j p j p & &
& T & = c(N ).
( * 1 &U (,) &
' ' p p
! 2 A j
|T | q q q
j ,j The binomial theroem gives us that f + gq f q + gq
n1 ' 1 for any 1 q < and nonnegative f, g; therefore,
! A p 2j (#,j ) p (5.20) & &
j & &
& ' &
Since we are integrating over the entire group O(n), symmetry c(N )( 1n N 1 )1/p # 1. Regardless of our choice of N, we
considerations tell us that f is independent of the choice of . see that there exists some k 0 such that 1n N 1 2k ; so
Thus we can write N 2k 1n . Thus it will suffice to require
) )
1
ck 2k/p c(2k 1n ) # 1 (5.26)
f (, ) = B(0,) ( U ( ))d dO(n).
|Sn1 | O(n) Sn1
If we examine the inner integral only, then and U are fixed, for all k 0. Notice that if k " log(1/ n1 ), then 2k " 1n
so and consequently N ! 1, a contradiction. Thus it is enough
) ) to prove (5.26) for all 0 k ! log(1/). Multiplying through
B(0,) ( U ( ))d = B(0,) ( e)de
by the factor 2k/p in (5.25), we see that what we have to work
Sn1 Sn1
with is the recursive inequality
= |{e Sn1 : | e| }|
n1
ck ck1 + C2k/p c2k (5.27)
,
for some constant C. Notice that if we did not have the
the surface measure of the ball B(0, ). So since
@ second summand in (5.27) (the error term), then we could
O(n) dO(n) = 1 by definition, we see that f (, )
n1
conclude immediately that ck is a nonincreasing sequence in
uniformly; thus, (5.24) becomes
) k and thus it attains its maximum at c0 . But c0 = c( 1n ) # 1
a(,, U (,))dO(n) n1 N 2 , by hypothesis, equation (5.15), so ck # 1 for all k.
O(n)
Looking back at (5.26), we see that this would imply that
2
since #(, U (,)) = N almost surely. c(N )( 1n N 1 )1/p # 1 for all N 1n ; this is exactly
What this means is that we can always find a rotation U such (5.16), and would verify our lemma.
that a(,, U (,)) ! n1 2
N just by pigeonholing (or applying Unfortunately, we cannot just drop the error term from
3 See
Conway [13], pp. 15556 for the necessary background (5.27) altogether. Nevertheless, we would like to assert that
on the Haar measure of a topological group. ck behaves as well as a nonincreasing sequence and apply the
for all k k0 , where k0 is some fixed constant. To verify this Now the second summand must be negative, so we see that
claim, multiply (5.27) through by a factor of (1 + C0 2k/p ) to dkmax < dkmax 1 which forces kmax = k0 . Therefore, ck < ck0
find that for all k > k0 . Notice that we trivially have ck ! ck0 for all
k < k0 . So since ck0 c(2k0 1n )2k0 /p ! c( 1n ) = c0 # 1
dk ck1 (1 + C0 2k/p ) + C2k/p c2k (1 + C0 2k/p )
by hypothesis, we have that ck # 1 for all 0 k ! log(1/),
( *
1 + C0 2k/p
completing the proof of Lemma 5.9.
= dk1 " #
1 + C0 2(k1)/p Thus, to prove the estimate K n+1 2
, it suffices to show
( * & &
&' &
k/p 1 + C0 2k/p & & n1
+ C2 d2k . (5.29) & T & # n+1 ,
1 + C0 22k/p &, & n+1
n1
It is easy to show that the second term can be ignored. First we find that, in fact
% %
notice that , |T E | ! |E | trivially; then notice
that since 1, |E | n , and #, ! 1n , we have n1 #, |E | (5.34)
'' '
|T E | |E | |T E | must hold. This procedure may be technical overkill, but
, :|T E | 2n |T | it serves as a nice illustration as to how the mean value
theorem can make the classic pigeonhole principle analytically
" |E | 2n
precise.
1 We see that, by (5.34), this particular acts as the dominant
" |E |.
2
density of a generic tube T in E . Notice that we have an
Consequently, we can simplify (5.32) and just write
estimate on this density, namely
''
|E | |T E |.
, $ |E | (5.35)
Abstract. We survey up to date progress on Bakers question (raised in 1984) on the dynamics of permutable entire functions:
Let f and g be two permutable (f g = g f ) non-linear entire functions. Are the Julia sets of f and g identical? Bakers question
still remains to be answered.
Keywords. Permutable entire functions, Normal family, Fatou set, Julia set, Wandering Domain.
2010 Mathematics Subject Classification. 30D35, 30D45.
diam [f n g(D(w, ))] Theorem 1.3. If f and g are two nonlinear permutable entire
= diam [g f n (D(w, ))] M[f n (D(w, ))] < . functions such that f g = A, where A is some constant,
then J (f ) = J (g).
This implies that {f n } is a normal family on the open set
g(D(w, )) and so in particular, g(w) F (f ) and therefore, Given the simplicity of the proof given by Baker, one is
g and {g n } map F (f ) onto itself showing that {g n } is normal tempted to present an outline of the proof, here.
on F (f ). Thus, F (f ) F (g). By symmetry, we conclude First, note the following:
that J (f ) = J (g). A point w C is called Fatou-exceptional for f if the
In 195859, I. N. Baker [2] and G. Iyer [21] started their backward orbit of w O (w) := n1 {f n (w)} is finite.
work on the classification of all pairs of nonlinear permutable For any z J (f ) and for any w which is not a Fatou-
entire functions. They both proved that if a nonconstant poly- exceptional point for f , there is a sequence {zn } such that
nomial f is permutable with a transcendental entire func- f n (zn ) = w, zn z.
tion g, then f (z) = e2mi/k z + b for some m, k N and If N is a neighbourhood of z J (f ), then there is an n0 such
complex number b. It follows from this result, as well as Julia that for every n > n0 , f n (N ) contains any given compact
and Fatous results that in order to answer questions about set which does not contain a Fatou-exceptional point of f.
dynamics and classification of permutable entire functions, The repulsive fixed points of f form a dense subset of J (f ).
we only need to consider permutable transcendental entire
Proof of Theorem 1.3. z J (f ) if and only if z is a limit
functions.
point of repulsive fixed points of f . But g maps a repul-
Baker [4] initiated the study of dynamics of permutable
sive fixed point w of order p to another fixed point w such
transcendental entire functions and posed the following
that (f p ) (w) = (f p ) (w ). Let f and g be transcendental
problem which still continues to be an open problem:
entire functions. Suppose that z F (f ) and there is a sub-
Problem A. Let f and g be nonlinear entire functions. If f sequence {f nk } which has a finite limit in the component of
and g are permutable, is J (f ) = J (g)? F (f ) which contains z. Let U be a neighbourhood of z such
Nodas proof of Theorem 1.7 shows the existence of an excep- The last theorem also holds for
tional set Ef C such taht fa satisfies conditions (B1)(B4).
H (z) = sin z(cos z)
Replacement of Ef by Ef = Ef {f (c) : f (c) = 0}
ensures that fa also satisfies (B5). Clearly (Bj) implies (Aj) such that the order of H is finite and not an integer and H has
for j = 1, 2, 3, 4 and one can check that conditions (B1) and only simple zeros, and
(B2) together imply condition (A1). Hence by combining the
last two theorems, Ng [28] obtained the following result which fa (z) = H (z)[cos z a].
says that in certain sense, the answer to Bakers question is
Question. Does the last theorem hold when
YES for almost all entire functions:
f (z) := p + p1 eq1 + p2 eq2 + + pn eqn A(f ) is always non-empty for transcendental entire functions
(see [33]).
such that either
Theorem 2.5 is in fact contained in the more precise result
(1) q1 + q2 + + qn = 0 and p1 p2 pn = constant, (see [7]): If f and g are permutable trancendental entire
Name: 24th International Conference on Finite or Infinite Dimensional Complex Analysis and Applications
Date: August 2226, 2016
Location: Anand International College of Engineering, Jaipur
Visit: http://anandice.ac.in/24icfidcaa-2016/#
Name: International Conference on Applications of Mathematics in Topological Dynamics, Physical, Biological and Chemical
Systems
Date: December 911, 2016
Name: International Conference of The Indian Mathematics Consortium (TIMC) in cooperation with American Mathematical
Society (AMS)
Date: December 1417, 2016
Location: DST-Centre for Interdisciplinary Mathematical Sciences, Banaras Hindu University, Varanasi 221005, India
Visit: http://www.bhu.ac.in/seminar/timcams2016/
Name: SPACE 2016 Sixth International Conference on Security, Privacy and Applied Cryptographic Engineering
Date: December 1618, 2016
Location: C. R. Rao Advanced Institute of Mathematics Statistics and Computer Science, Hyderabad, India (AIMSCS)
Visit: http://www.math.umn.edu/math-sa-sara0050/space16/
Name: 10th International Conference of IMBIC on Mathematical Sciences for Advancement of Science and
Technology
Date: December 2123, 2016
Location: Indismart Hotel, Salt Lake, Kolkata
Visit: http://imbic.org/forthcoming.html
Name: The 4th International Conference on Complex Dynamical Systems in Life Sciences: Modeling and Analysis
Date: October 2628, 2016
Location: Ibnou Zohr University, Agadir, Morocco
Visit: http://www.cosylis.org/iccds2016/
Name: IMA Annual Program Workshop: Mathematical and Physical Models of Nonlinear Optics
Date: October 31November 4, 2016
Location: IMA, University of Minnesota, Minneapolis, MN
Visit: https://www.ima.umn.edu/2016-2017/W10.31-11.4.16/
Name: IMA Annual Program Workshop: Mathematical and Numerical Modeling in Optics
Date: December 1216, 2016
Location: IMA, University of Minnesota, Minneapolis, MN
Visit: https://www.ima.umn.edu/2016-2017/W12.12-16.16/
Name: Ergodic Theory and its Connections with Arithmetic and Combinatorics
Date: December 1216, 2016
Location: CIRM Luminy, Marseille
Visit: http://lemanczyk-ferenczi.weebly.com/conference.html
Department of Mathematics,
I.I.T. Roorkee is Organizing the
International Conference on Mathematical Analysis and its
to be held between
Applications (ICMAA 2016)
November 28 December 02, 2016
The focus of the conference is on topics of Mathematical Analysis and its Applications, including but not limited to
Analysis of Differential Equations (including Control theory, Fractional Calculus and Stochastic PDEs)
Complex Analysis and Harmonic Analysis (including Potential theory, Harmonic Mappings and Quasi-Conformal Mappings)
Fourier and Wavelet Analysis
Inverse Problems and Non-linear Analysis
Matrix Analysis, Operator Theory and Function Spaces
Modern Methods of Summability and Approximation
Orthogonal Polynomials and Special Functions
The SIAM Activity group on Orthogonal Polynomials and Special Functions (SIAG-OPSF) is also involved in the conference.
Further, SIAM has agreed to provide travel grants to early career researchers from US Institutions to participate in the conference.
Important dates:
For further details and updates of the conference kindly visit www.iitr.ac.in/icmaa/2016/ or contact us at
icmaa2016@iitr.ac.in, icmaa2k16@gmail.com