Every smooth cubic plane curve has 9 flex points and 27 sextatic points. We study the following question asked by Farb: Is it true that the known algebraic structures give all the possible ways to continuously choose n distinct points on every smooth cubic plane curve, for each given positive integer n? We give an affirmative answer to the question when n=9 and 18 (the smallest open cases), and a negative answer for infinitely many n's.

We will prove Sarnak’s conjecture on Möbius disjointness for continuous interval maps of zero entropy and also for orientation-preserving circle homeomorphisms by reducing these result to a well-known theorem of Davenport from 1937.

We show that there exist $(d-1)$ -Ahlfors regular compact sets $E \subset\mathbb{R}^{d}$ , $d\geq2$ such that for any $t< d-1$ , we have $$\sup_{T} \frac{\mathcal{H}^{d-1}(E\cap T)}{w(T)^{t}}< \infty $$ where the supremum is over all tubes $T$ with width $w(T) >0$ . This settles a question of T. Orponen. The sets we construct are random Cantor sets, and the method combines geometric and probabilistic estimates on the intersections of these random Cantor sets with affine subspaces.

We consider a system coupling the incompressible Navier–Stokes equations to the Vlasov–Fokker–Planck equation. Such a problem arises in the description of particulate flows. We design a numerical scheme to simulate the behavior of the system. This scheme is asymptotic-preserving, thus efficient in both the kinetic and hydrodynamic regimes. It has a numerical stability condition controlled by the non-stiff convection operator, with an implicit treatment of the stiff drag term and the Fokker–Planck operator. Yet, consistent to a standard asymptotic-preserving Fokker–Planck solver or an incompressible Navier–Stokes solver, only the conjugate–gradient method and fast Poisson and Helmholtz solvers are needed. Numerical experiments are presented to demonstrate the accuracy and asymptotic behavior of the scheme, with several interesting applications.

No abstract uploaded!