اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMarstrand-type theorems for the counting and mass dimensions in $mathbb{Z}^d$
73
0
0.0
(
0
)
تأليف
D. Glasscock
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The counting and (upper) mass dimensions are notions of dimension for subsets of $mathbb{Z}^d$. We develop their basic properties and give a characterization of the counting dimension via coverings. In addition, we prove Marstrand-type results for both dimensions. For example, if $A subseteq mathbb{R}^d$ has counting dimension $D(A)$, then for almost every orthogonal projection with range of dimension $k$, the counting dimension of the image of $A$ is at least $min big(k,D(A)big)$. As an application, for subsets $A_1, ldots, A_d$ of $mathbb{R}$, we are able to give bounds on the counting and mass dimensions of the sumset $c_1 A_1 + cdots + c_d A_d$ for Lebesgue-almost every $c in mathbb{R}^d$. This work extends recent work of Y. Lima and C. G. Moreira.
قيم البحث
اقرأ أيضاً
We introduce the notions of directional dynamical cubes and directional regionally proximal relation defined via these cubes for a minimal $mathbb{Z}^d$-system $(X,T_1,ldots,T_d)$. We study the structural properties of systems that satisfy the so cal
led unique closing parallelepiped property and we characterize them in several ways. In the distal case, we build the maximal factor of a $mathbb{Z}^d$-system $(X,T_1,ldots,T_d)$ that satisfies this property by taking the quotient with respect to the directional regionally proximal relation. Finally, we completely describe distal $mathbb{Z}^d$-systems that enjoy the unique closing parallelepiped property and provide explicit examples.
We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In doi:10.1016/j.tcs.2018.05.034 and doi
:10.3934/dcds.2020186, Petersen and Salama demonstrated the existence of topological entropy for tree-shifts and $h(mathcal{T}_X) geq h(X)$, where $mathcal{T}_X$ is the hom tree-shift derived from $X$. We characterize a necessary and sufficient condition when the equality holds for the case where $X$ is a shift of finite type. In addition, two novel phenomena have been revealed for tree-shifts. There is a gap in the set of topological entropy of hom tree-shifts of finite type, which makes such a set not dense. Last but not least, the topological entropy of a reducible hom tree-shift of finite type is equal to or larger than that of its maximal irreducible component.
We study the periodic orbits problem on energy levels of Tonelli Lagrangian systems over configuration spaces of arbitrary dimension. We show that, when the fundamental group is finite and the Lagrangian has no stationary orbit at the Ma~ne critical
energy level, there is a waist on every energy level just above the Ma~ne critical value. With a suitable perturbation with a potential, we show that there are infinitely many periodic orbits on every energy level just above the Ma~ne critical value, and on almost every energy level just below. Finally, we prove the Tonelli analogue of a closed geodesics result due to Ballmann-Thorbergsson-Ziller.
For $d ge 2$ and all $qgeq q_{0}(d)$ we give an efficient algorithm to approximately sample from the $q$-state ferromagnetic Potts and random cluster models on the torus $(mathbb Z / n mathbb Z )^d$ for any inverse temperature $betageq 0$. This stand
s in contrast to Markov chain mixing time results: the Glauber dynamics mix slowly at and below the critical temperature, and the Swendsen--Wang dynamics mix slowly at the critical temperature. We also provide an efficient algorithm (an FPRAS) for approximating the partition functions of these models. Our algorithms are based on representing the random cluster model as a contour model using Pirogov-Sinai theory, and then computing an accurate approximation of the logarithm of the partition function by inductively truncating the resulting cluster expansion. The main innovation of our approach is an algorithmic treatment of unstable ground states; this is essential for our algorithms to apply to all inverse temperatures $beta$. By treating unstable ground states our work gives a general template for converting probabilistic applications of Pirogov--Sinai theory to efficient algorithms.
We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $Delta$ on $n$ vertices, for all $k le (1-delta)m^*(G)$, where $delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an FPTAS for the num
ber of independent sets of size $k le (1-delta) alpha_c(Delta) n$, where $alpha_c(Delta)$ is the NP-hardness threshold for this problem. We also provide quasi-linear time randomized algorithms to approximately sample from the uniform distribution on matchings of size $k leq (1-delta)m^*(G)$ and independent sets of size $k leq (1-delta)alpha_c(Delta)n$. Our results are based on a new framework for exploiting local central limit theorems as an algorithmic tool. We use a combination of Fourier inversion, probabilistic estimates, and the deterministic approximation of partition functions at complex activities to extract approximations of the coefficients of the partition function. For our results for independent sets, we prove a new local central limit theorem for the hard-core model that applies to all fugacities below $lambda_c(Delta)$, the uniqueness threshold on the infinite $Delta$-regular tree.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
