You are currently browsing the monthly archive for January 2012.

**January 2012.** This problem is motivated by the multidimensional conjecture posed by Barry Simon. It deserves a post on its own but the crux of the matter is this. Take a model case:

where and the parameter is real as well as the potential . We define the Cauchy problem by taking . Then, assuming is sufficiently regular, we can define the unique solution. Its norm is preserved in time. However, how fast do the Sobolev norms can grow? Even for fixed , this is an interesting problem but we want to know what happens for Lebesgue generic . My conjecture is that for the Sobolev norm is bounded in time. This is true for a.e. . The partial results were recently obtained here but more analysis is needed. For example, for the transport equation the solution can be explicitly written and the Carleson theorem on the Fourier series yields the sharp result. Here is Harmonic analysis in action. For the general case the combination of soft-analysis methods and the Christ-Kiselev type perturbation arguments is needed. The quantity most relevant to multidimensional case is

One wants to control it by norm of . The small values of correspond to the small gaps in the spectrum of the diagonal operator and this regime is the most difficult for analysis.

The difficulty of the problem is this– if one takes complex-valued then the norm of the solution is not preserved in time anymore. So, whatever analytical machinery one applies, it must be sensitive enough to account for that fact. A good classical example is function . Its Taylor expansion is hardly useful for the analysis of this function for large real .

_____________________________________________________________________

**June 2013.** I recently posted the new preprint on my webpage in which, in particular, the following statement is proved:

Consider in which is only bounded in both and . Then, for a.e. the solution has Sobolev norm , uniformly bounded for all .

This result is based on a recent generalization of Carleson theorem on Fourier maximal function (through the variational norm). The statement is rather striking as it gives more regularity for the solution than one can guess as long as the generic coupling constant is taken.

**January 2012.** Let denote the unit circle and let be a probability measure on . Take the sequence and orthonormalize in the Hilbert space to produce . We have

by definition. The question is what is the size of if and we assume some additional information on the measure ? This is a classical question in approximation theory. The Steklov’s conjecture was: assume that is purely a.c. and has the weight uniformly bounded away from zero, i.e.

Is it true that uniformly in and ? The negative answer to this question was given by Rakhmanov. He proved that the possible growth is essentially up to an inverse logarithmic factor. Can one drop it? This is a nice problem.** !!! SOLVED, see below.** Another important class of measures extensively studied in the literature is the so-called Szego class. It is defined as follows: where the singular component is arbitrary and for one has

How large the polynomials can be in this case? Well, for a while the conjecture was that the polynomial entropy is bounded, i.e.

uniformly in . That, however, again tuned out to be wrong with the possible growth like . This result is sharp. Then, what restriction on the size of do we get from the orthogonality? Not clear to me. _______________________________________________________________________ **August 2013.** In the joint paper with A. Aptekarev and D. Tulyakov which you can find on my webpage, we proved the sharp estimates for the uniform norms of the orthogonal polynomials in the Steklov class. This class is defined by the condition that

for a.e. point on the circle where is some small positive constant. The world record so far was made by Rakhmanov about 30 years ago. The method we used turned out to be powerful enough to also give the sharp bounds for the polynomial entropy in this class. We hope to iterate the construction to prove the lower bounds over the subsequence. If we succeed, this will give the full solution to the famous Steklov’s conjecture. ______________________________________________________________________________ ** February 2014.** Building on the previous paper (discussed above), we were able to settle a problem by Steklov. That involved a lot of technical work. Here is the main result: suppose is a probability measure on the circle which satisfies

and . That condition defines the Steklov’s class. If are the corresponding orthonormal polynomials, then the following upper bound is well-known and easy to prove:

In the paper, we prove **Theorem.** For every sequence , there is an absolutely continuous probability measure from the Steklov class such that

for some sequence . The proof is constructive and can be used when the measure satisfies different lower bounds. There are other interesting questions that naturally follow from the paper, some of them do not seem to be so hard anymore. The project on getting the uniform bound on the polynomials is mainly finished. What is left wide open is the problem on controlling the for a.e. provided the constructive information on measure is known. This is the so-called nonlinear Luzin’s conjecture and we know very little about it. ____________________________________________________________ **November 6, 2014 ** Fix , large and such that . Consider the class of probability measures defined as where , are arbitrary points on , and . Let . In the recent paper, I proved the following estimate It implies, for example, that the maximizer in the Steklov problem has point masses. In the same paper, I also proved the following inequality improving the bound by Kos: if and , then . That was done by using the duality between two extremal problems for one of which the bound is easy to obtain if the generalization of the Halasz’ result is used. ___________________________________________________________________________________________________________________ **May 19, 2015** The solution to a problem by Steklov discussed above allows to study other variational problems. For example, Then, the old idea by S.Bernstein and our method used for getting the lower bounds can be combined to get when is fixed and . In the case when the deviation of the weight is large, we have two results: 1. For every large , there is such that for every weight . 2. For every small , there is large and a weight such that . One can see that the growth can not be achieved by weights uniformly bounded in .

_________________________________________________________________________________________________

**July 2015. ** We significantly simplified several proofs in the paper “On a problem by Steklov” and submitted a new version to arXiv. We also fixed some minor mistakes and typos.

______________________________________________________________________________________________

**September 2015. **In his original paper on the Steklov’s conjecture, Rakhmanov used a formula for orthogonal polynomial obtained by adding mass points to the measure of orthogonality. Although its uniform norm can grow not faster than (where is a degree), it is interesting to deduce this polynomial by method used for getting the sharp lower bound in the problem by Steklov. This was carried out in my recent preprint. The interesting feature is a different kind of cancellation. It is less effective than the one giving the bound but it still might be interesting.

___________________________________________________________________________________________________

**November 2015. **The method used to solve the problem of Steklov proves the possibility of growth of polynomials with weights that satisfy and with arbitrary . If then the upper bound gives an exponent smaller than : . In a joint project with my student Keith Rush, we proved that is sufficient to have . The proof gives more that that. Under these assumptions, we can show that the polynomial entropies are uniformly bounded. In terms of the regularity of weight, this results is rather sharp since the entropies are known to grow logarithmically for with any .

**January 2012. ** The 2D Euler equation can be written in the following form

where is — periodic in both and and it denotes the vorticity of the velocity field. The symbol stands for . To define the Cauchy problem, one needs to specify

This is a transport equation with the divergence-free vector field and so all norms of are preserved in time. The global regularity is known for many functional spaces, e.g. or with large will do. The quantitative version is a bound

Is this estimate sharp? I do not know but one can have double exponential growth for arbitrarily large but finite time. The lower bound valid for all time is only superlinear.

Another interesting problem is dynamics of patches. Assume that is the characteristic function of a domain and the problem is considered on the whole plane, not on the 2d torus. Then, and the boundary of is smooth provided that the boundary of was smooth. However, one can study the growth of curvature and the rate of merging (if there are several patches).

The merging mechanism was studied recently and the INFINITE double exponential rate is possible at least if the regular strain is present. This result is sharp.

If one modifies equation for vorticity by writing instead of , then the resulting equation is called SQG (surface quasi-geostrophic). The outstanding conjecture in the field is that the singularity forms in finite time. No proof so far.

_____________________________________________________________________

**May 2013.** I have finished one more revision of the paper on the corner formation and you can check either my webpage or arxiv. The estimates are now sharp and the regularity of the strain is as optimal as the method can give. I think I approach the stage when the paper can finally be read by the students.

_________________________________________________________________________

**October 2013.** In the recent preprint, Kiselev and Sverak considered the 2d Euler equation on the disc and proved the infinite in time double-exponential growth of the Lipschitz norm for the vorticity. The singularity forms on the boundary and happens as two identical vortices of different sign slide along the boundary towards each other. This interesting result might indicate that singularity formation is generic when the equation is considered on the domain with the boundary. The initial data is smooth but is not zero near the boundary (this is important for the construction). So, if one writes the equation on the Fourier side, the decay of

in is very weak. The stable mechanism for the singularity formation in the bulk is still missing.

________________________________________________________________

**October 2013.** Another interesting result obtained for 2d Euler. My colleague Andrej Zlatos proved the possibility of infinite exponential growth of the Hessian of vorticity for smooth initial data. This was done for the 2d torus and no boundary effects were used. He also showed that the Lipschitz norm can grow exponentially for initial data. In this work the hyperbolic scenario is exploited. I think the interesting question is the possibility of the exponential growth of the Lipschitz norm for smooth initial data (e.g., trig polynomial). So far we have only superlinear estimate. Even better problem is to show that the sharp front can form with width decaying exponentially. This would prove that the results of Fefferman and D. Cordoba on the fronts are essentially sharp. There are plausible mechanisms but the justification for Euler equation is hard.