Analysis Seminars @ CUHK Math Dept

Student Seminars

A series of analysis seminars, with an emphasis on the interests of the group, normally takes place on Tuesday afternoons at 14:30 HKT in LSB 219. All are welcome.

Upcoming

2024

  • A reading workshop on Tuesdays at 14:30 HKT in LSB 202.

Previous

2023

2022

Seminar Topics 2022

  • 11/15 Tuesday LSB 202
    Yuhao Xie

  • 11/1 Tuesday LSB 202
    Zhou Feng

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Summary
      We finish the Exercises 1.51, 1.52 and 1.53. Moreover, we show that the Hausdorff dimension of the set in Exercise 1.52 is still 0 0 after replacing the lim \lim with lim sup \limsup or lim inf \liminf in the definition.

    • Note.

  • 10/18 Tuesday LSB 202
    Yuji Li

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Summary
      We mainly talked about Levy's modulus of continuity of Brownian motion and also some Holder continuity property due to Levy's construction of Brownian motion.

  • 9/20 - 9/27 Tuesdays LSB 202
    Caiyun Ma

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Deliu, Anca; Geronimo, J. S.; Shonkwiler, R. & Hardin, D.. Dimensions associated with recurrent self-similar sets. Math. Proc. Cambridge Philos. Soc. , Vol. 110, No. 2 p. 327-336. 1991.

    • Outline
      Exercise 4.2 Hausdorff and Minkowski dimensions of McMullen Set K(D) K(D) agree if and only if D D has uniform horizontal fibers.

      Exercise 4.3 Show that if D D has uniform horizontal fibers, then K(D) K(D) has positive finite Hausdorff measure in its dimension.

      Exercise 4.5 Compute the dimension of a self-affine set of finite type if we assume the number of rectangles in corresponding rows is the same for each pattern.

    • Summary
      In computing the box dimension one applies compositions of affine maps to a square containing the attractor and one uses the number of boxes in this covering to get estimates on the minimum number of boxes needed to cover the attractor at various levels. One of the main problems is to know where the attractor is in order to count only those boxes that are needed.

      One method is to project the attractor onto a convenient axis and relate the dimension of the projected attractor to the dimension of the original set.

    • Note.

  • 9/13 Tuesday LSB 202
    Yuhao Xie

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Outline
      We will talk about a lower bound for dimpE×F \dim_{p} E \times F , and then give an example that the lower bound can be strict.

  • 7/26 Tuesday Zoom
    Caiyun Ma

  • 5/10 Tuesday Zoom
    Yuhao Xie

    • Lagarias, Jeffrey C. & Wang, Yang. Self-affine tiles in R^n. Adv. Math. , Vol. 121, No. 1 p. 21-49. 1996.

    • Note.

    • Outline
      We will introduce some properties of the homogenous Self-Affine IFS whose affine dimension is equal to the dimension of the space. These results are from Lagarias and Yang.

  • 5/3 Tuesday Zoom
    Zhou Feng

    • Kenyon, Richard. Projecting the one-dimensional Sierpinski gasket. Israel J. Math. , Vol. 97 p. 221-238. 1997.

    • Note; Dimension for IFS with exact-overlaps.

    • Summary
      We observe that the projections of every planar homogeneous self-similar set with rational (mod π \pi ) rotation angle are self-similar sets.

      Next we focus on the projections of 1-dim Sierpinski gasket. Let τR \tau \in \mathbb{R} . Let Eτ E_{\tau} be the attractor of IFS:

      {1/3x,1/3x+2/3,1/3x+τ/3}.\begin{aligned} \{ 1/3 x, 1/3 x + 2/3, 1/3 x + \tau / 3\}.\end{aligned}
      The following results are known.

      • If τQ \tau \notin \mathbb{Q} , then L(Eτ)=0 \mathcal{L}(E_{\tau}) = 0 and dimHEτ=1 \dim_{H} E_{\tau} = 1 .

      • If τ=2p/qQ \tau = 2 p/q \in \mathbb{Q} with gcd(p,q)=1 \gcd(p,q) = 1 and p+q0(mod3) p + q \equiv 0 \pmod 3 , then L(Eτ)=2/q \mathcal{L} (E_{\tau}) = 2 / q and Eτ=Eτ E_{\tau} = \overline{E_{\tau}^{\circ}} .

      • If τ=2p/qQ \tau = 2p/q \in \mathbb{Q} with gcd(p,q)=1 \gcd(p,q) = 1 and p+q≢0(mod3) p + q \not \equiv 0 \pmod 3 , then dimHEτ<1 \dim_{H} E_{\tau} < 1 and dimHEτ \dim_{H} E_{\tau} can be computed by an algorithm (in finite steps).

      The Open Set Condition only holds in the second case. The Exact Overlaps only happen in the third case.

      In particular for the Ex 2.7 in B-P, we compute that dimHE1/2=log3(5+32) \dim_{H} E_{1/2} = \log_{3}(\frac{\sqrt{5}+3}{2}) . Then we quickly finish Ex 2.15 and 2.16.

    • A joint note in progress: Basics on Moran structures

  • 4/26 Tuesday Zoom
    Yuji Li

  • 4/12 Tuesday Zoom
    Tianhan Yi

  • 3/29 Tuesday Zoom
    Yuhao Xie

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Note.

    • Outline
      We do some exercises about box dimension in the chapter five of Mattila’s book. And also introduce Example 1.3.3 and 1.7.1 in Bishop and Peres’ book.

  • 3/22 Tuesday Zoom
    Zhou Feng

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Note.

    • Summary

      We finished Exercises 1.2, 1.5, 1.38, 1.39, 1.42, 1.44, 1.45, 1.46 and 1.47 in the reference. During this progress, we have learned:

      • a trick to combine a sequence of scales in a desired way.

      • the power of dimension formula for homogeneous Moran sets. See the section about sets defined via digits in Basics on Moran structures. In this joint note, we also record a dimension formula for perturbed symmetric Cantor sets .

      • a combination of two ways of defining sets via digits.

      • a principle of choosing best Bernoulli measures on sets defined by digit densities.

  • 3/15 Tuesday Zoom
    Yuji Li

  • 3/1 — 3/8 Tuesdays Zoom
    Caiyun Ma

    • Feng, Dejun; Wen, Zhiying & Wu, Jun. Some dimensional results for homogeneous Moran sets. Sci. China Ser. A , Vol. 40, No. 5 p. 475-482. 1997.

    • Outline 3/1
      Theorem 1. Suppose EM(J,{nk},{ck}) E \in \mathcal{M}\left(J,\left\{n_{k}\right\},\left\{c_{k}\right\}\right). Then we have
      lim infklogn1n2nklogc1c2ck+1nk+1dimHElim infklogn1n2nklogc1c2ck.\begin{aligned} \liminf_{k \rightarrow \infty} \frac{\log n_{1} n_{2} \cdots n_{k}}{-\log c_{1} c_{2} \cdots c_{k+1} n_{k+1}} \leqslant \operatorname{dim}_{\mathrm{H}} E \leqslant \liminf_{k \rightarrow \infty} \frac{\log n_{1} n_{2} \cdots n_{k}}{-\log c_{1} c_{2} \cdots c_{k} }.\end{aligned}

      Theorem 2. For any EM(J,{nk},{ck}) E\in \mathcal{M}\left(J,\left\{n_{k}\right\},\left\{c_{k}\right\}\right) , we have

      lim supklogn1nklogc1c2ckdimPEdimBElim supklogn1nk+1logc1c2ck+lognk+1.\begin{aligned} \limsup_{k \rightarrow \infty} \frac{\log n_{1} \cdots n_{k}}{-\log c_{1} c_{2} \cdots c_{k}} \leqslant \operatorname{dim}_{\mathrm{P}} E \leqslant \overline{\operatorname{dim}_{\mathrm{B}}} E \leqslant \limsup_{k \rightarrow \infty} \frac{\log n_{1} \cdots n_{k+1}}{-\log c_{1} c_{2} \cdots c_{k}+\log n_{k+1}}.\end{aligned}

    • Feng, Dejun; Rao, Hui & Wu, Jun. The net measure properties of symmetric Cantor sets and their applications. Progr. Natur. Sci. (English Ed.) , Vol. 7, No. 2 p. 172-178. 1997.

    • Outline 3/8
      Theorem 1. Let EE be the symmetric Cantor set determined by the sequences {nk}k1\left\{n_{k}\right\}_{k} \geqslant 1, {ck}k1\left\{c_{k}\right\}_{k \geqslant 1}, Then
      climki=1knicisHs(E)limki=1knicis,\begin{aligned} c \underline{\lim} _{k \rightarrow \infty} \prod_{i=1}^{k} n_{i} c_{i}^{s} \leqslant H^{s}(E) \leqslant \underline{\lim }_{k \rightarrow \infty} \prod_{i=1}^{k} n_{i} c_{i}^{s},\end{aligned}
      where 0s10 \leqslant s \leqslant 1, and cc is an absolute positive constant.

    • Note 3/1; Note 3/8.

  • 2/15 Tuesday Zoom
    Tianhan Yi

  • 2/8 Tuesday Zoom
    Caiyun Ma

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Outline
      We consider the digits set that each digit occurs with a certain frequency. The resulting sets are dense in [0,1][0,1], so we need only consider their Hausdorff dimension and packing dimension.

      Let

      Ap={x=n=1xn2n:xn{0,1},limj1jk=1jxk=p}.\begin{aligned} A_{p}=\left\{x=\sum_{n=1}^{\infty} x_{n} 2^{-n}: x_{n} \in\{0,1\}, \lim _{j \rightarrow \infty} \frac{1}{j} \sum_{k=1}^{j} x_{k}=p\right\}.\end{aligned}
      Thus ApA_{p} is the set of real numbers in [0,1][0,1] in which a 1 occurs in the binary expansion with asymptotic frequency pp. We show that

      Theorem 1. For any p(0,1)p\in (0,1),

      dim(Ap)=h2(p)=plog2p(1p)log2(1p).\begin{aligned} \operatorname{dim}\left(A_{p}\right)=h_{2}(p)=-p \log _{2} p-(1-p) \log _{2}(1-p).\end{aligned}
      where dim\dim denotes the Huasdorff dimension or packing dimension.

    • Note.

  • 1/25 Tuesday LSB 202
    Yuhao Xie

    • Bishop, Christopher J. & Peres, Yuval. Fractals in probability and analysis. Vol. 162. Cambridge Studies in Advanced Mathematics Cambridge University Press, Cambridge p. ix+402. 2017.

    • Outline
      Let SNS\subset \mathbb{N}, define AS:={k=1xk2k:kS,xk{0,1}}A_{S}:=\{\sum_{k=1}^{\infty}x_{k}2^{-k}:k\in S, x_{k}\in\{ 0,1\} \}. Calculate dimHAS\dim_{H}A_{S} and dimPAS\dim_{P}A_{S}.

2021

  • 11/23 — 11/30 Tuesdays LSB 202
    Yuhao Xie

  • 10/19 — 11/9 Tuesdays LSB 202
    Zhou Feng

    • Breuillard, E. & Varjú, P. P. Cut-off phenomenon for the ax+b Markov chain over a finite field. ArXiv:1909.09053. 2019.

    • Outline
      We will study the cut-off phenomenon for a type of Markov chain over finite fields. The target Markov chain also has a self-similar structure.

    • Summary
      We first established a concrete setup and some basic intuition on the concerned Markov chain. With the concepts of the mixing times and the cut-off phenomenon, we stated the main theorems and discussed the delicate dependencies of the parameters. Next we introduced the key observation connecting the sum of 2\ell_2 norms and the expectation of the number of the roots of a random polynomial in Fp\mathbb{F}_p.

      After reviewing the Fourier transform on Fp\mathbb{F}_{p}, we established the Konyagin's O(logploglogp) O(\log p \log\log p) upper bound on the mixing time. The proof follows Konyagin's orginal idea and relies on the Dobrowolski's lower bound on Mahler measures.

      Based on the convolution structure of the envolving measures and the key observation, we applied the Fourier transform and the small-average-control-num-of-large-fibers arguments to obtain an upper bound on the mixing time for general pp but not all multipliers with high orders. To prove the 2\ell_2 cut-off phenomenon, a nested version of the aformmentioned argument was conducted via Markov inequality. The complete proof depends an upper bound of an expectation where the GRH came into the game through the key observation.

  • 9/28 — 10/12 Tuesdays LSB 202
    Yuji Li

  • 9/14 Tuesday LSB 202
    Tianhan Yi

  • 9/7 Tuesday LSB 239
    Yuhao Xie

    • Falconer, K. J. & Marsh, D. T. On the Lipschitz equivalence of Cantor sets. Mathematika, 1992, 39, 223-233

    • Outline
      We will talk about a necessary condition for the lipschitz equivalence of two dust-like self-similar sets. This classic result is by Falconer.

  • 8/17 — 8/31 Tuesdays LSB 239
    Caiyun Ma

    • Feng, D.-J. Lyapunov exponents for products of matrices and multifractal analysis. I. Positive matrices. Israel J. Math., 2003, 138, 353-376.

    • Summary
      Let (Σ,σ)(\Sigma, \sigma) be a full shift space on an alphabet consisting of mm symbols and let M:ΣL+(Rd,Rd)M: \Sigma \rightarrow L^{+}\left(\mathbb{R}^{d}, \mathbb{R}^{d}\right) be a continuous function taking values in the set of d×dd \times d positive matrices. Denote by λM(x)\lambda_{M}(x) the Lyapunov exponent of MM at xx.

      Proposition 1. The set LM \mathcal{L}_M of possible Lyapunov exponents denoted is just an interval.

      Theorem 1. For any αLM \alpha\in \mathcal{L}_M,

      dimH{xΣ:λM(x)=α}=dimP{xΣ:λM(x)=α}.\begin{aligned} \dim_H\left\{x \in \Sigma:\lambda_{M}(x)=\alpha\right\}=\dim_P\left\{x \in \Sigma: \lambda_{M}(x)=\alpha\right\}.\end{aligned}
      The pressure function of M M is defined by
      PM(q)=limn1nlogωΣnsupx[ω]M(x)M(σx)M(σn1x)q,qR.\begin{aligned} P_{M}(q)=\lim _{n \rightarrow \infty} \frac{1}{n} \log \sum_{\omega \in \Sigma_{n}} \sup _{x \in[\omega]}\left\|M(x) M(\sigma x) \ldots M\left(\sigma^{n-1} x\right)\right\|^{q}, \quad q \in \mathbb{R}.\end{aligned}
      The matrix function MM induces a map M:Mσ(Σ)R{}M_{*}: \mathcal{M}_{\sigma}(\Sigma) \rightarrow \mathbb{R} \cup\{-\infty\} given by
      M(μ)=limn1nlogM(y)M(σy)M(σn1y)dμ(y),μMσ(Σ).\begin{aligned} M_{*}(\mu)=\lim _{n \rightarrow \infty} \frac{1}{n} \int \log \left\|M(y) M(\sigma y) \ldots M\left(\sigma^{n-1} y\right)\right\| d \mu(y), \quad \mu \in \mathcal{M}_{\sigma}(\Sigma).\end{aligned}

      Theorem 2. For any αLM \alpha\in \mathcal{L}_M,

      dimHEM(α)=1logminfqR{αq+PM(q)}=1logmsup{h(μ):μMσ(Σ),M(μ)=α},\begin{aligned} \dim_{H} E_{M}(\alpha) &=\frac{1}{\log m} \inf _{q \in \mathbb{R}}\left\{-\alpha q+P_{M}(q)\right\} \\ &=\frac{1}{\log m} \sup \left\{h(\mu): \mu \in \mathcal{M}_{\sigma}(\Sigma), M_{*}(\mu)=\alpha\right\},\end{aligned}
      where h(μ) h(\mu) denotes the measure-theoretic entropy of μ \mu .

  • 7/27 — 8/10 Tuesdays Zoom
    Jiaming Wu

  • 6/22 — 7/20 Tuesdays LSB 222
    Zhou Feng

  • Last century — 6/15 Tuesdays LSB 222
    Tianhan Yi