Logarithmic capacity of random G_\delta-sets

From MaRDI portal
Logarithmic capacity of random $G \delta$-sets



Abstract: We study the logarithmic capacity of Gdelta subsets of the interval [0,1]. Let S be of the form �egin{align*} S=�igcap_m �igcup_{kge m} I_k, end{align*} where each Ik is an interval in [0,1] with length lk that decrease to 0. We provide sufficient conditions for S to have full capacity, i.e. mathopmathrmCap(S)=mathopmathrmCap([0,1]). We consider the case when the intervals decay exponentially and are placed in [0,1] randomly with respect to some given distribution. The random Gdelta sets generated by such distribution satisfy our sufficient conditions almost surely and hence, have full capacity almost surely. This study is motivated by the Gdelta set of exceptional energies in the parametric version of the Furstenberg theorem on random matrix products. We also study the family of Gdelta sets S(alpha)alpha>0 that are generated by setting the decreasing speed of the intervals to lk=e−kalpha. We observe a sharp transition from full capacity to zero capacity by varying alpha>0.














This page was built for publication: Logarithmic capacity of random $G_\delta$-sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355187)