ESTIMATE OF THE HAUSDORFF MEASURE OF THE SIERPINSKI TRIANGLE

Fractals ◽  
2009 ◽  
Vol 17 (02) ◽  
pp. 137-148
Author(s):  
PÉTER MÓRA
Keyword(s):  
Lower Bound ◽  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Upper Bound ◽  
Open Problem ◽  
Dimensional Hausdorff Measure ◽  
Sierpinski Triangle ◽  
The One

It is well-known that the Hausdorff dimension of the Sierpinski triangle Λ is s = log 3/ log 2. However, it is a long standing open problem to compute the s-dimensional Hausdorff measure of Λ denoted by [Formula: see text]. In the literature the best existing estimate is [Formula: see text] In this paper we improve significantly the lower bound. We also give an upper bound which is weaker than the one above but everybody can check it easily. Namely, we prove that [Formula: see text] holds.

scholarly journals Improved Bounds for Restricted Families of Projections to Planes in ℝ3

2018 ◽  
Vol 2020 (19) ◽  
pp. 5797-5813 ◽  
Author(s):  
Tuomas Orponen ◽  
Laura Venieri
Keyword(s):  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Unit Sphere ◽  
Orthogonal Projection ◽  
Partial Result ◽  
Borel Set ◽  
Borel Sets ◽  
Dimensional Hausdorff Measure ◽  
One Dimensional ◽  
The One

Abstract For $e \in S^{2}$, the unit sphere in $\mathbb{R}^3$, let $\pi _{e}$ be the orthogonal projection to $e^{\perp } \subset \mathbb{R}^{3}$, and let $W \subset \mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K \subset \mathbb{R}^{3}$ is a Borel set with $\dim _{\textrm{H}} K \leq \tfrac{3}{2}$, then $\dim _{\textrm{H}} \pi _{e}(K) = \dim _{\textrm{H}} K$ for $\mathcal{H}^{1}$ almost every $e \in S^{2} \cap W$, where $\mathcal{H}^{1}$ denotes the one-dimensional Hausdorff measure and $\dim _{\textrm{H}}$ the Hausdorff dimension. This was known earlier, due to Järvenpää, Järvenpää, Ledrappier, and Leikas, for Borel sets $K$ with $\dim _{\textrm{H}} K \leq 1$. We also prove a partial result for sets with dimension exceeding $3/2$, improving earlier bounds by D. Oberlin and R. Oberlin.

DIAGONALIZATION MODULO NORM IDEALS AND HAUSDORFF DIMENSIONALITY

2000 ◽  
Vol 11 (08) ◽  
pp. 1057-1078
Author(s):  
JINGBO XIA
Keyword(s):  
Hausdorff Measure ◽  
Metric Spaces ◽  
Adjoint Operator ◽  
Trace Class ◽  
Multiplication Operators ◽  
Von Neumann ◽  
Dimensional Hausdorff Measure ◽  
One Dimensional ◽  
Compact Metric Spaces ◽  
The One

Kuroda's version of the Weyl-von Neumann theorem asserts that, given any norm ideal [Formula: see text] not contained in the trace class [Formula: see text], every self-adjoint operator A admits the decomposition A=D+K, where D is a self-adjoint diagonal operator and [Formula: see text]. We extend this theorem to the setting of multiplication operators on compact metric spaces (X, d). We show that if μ is a regular Borel measure on X which has a σ-finite one-dimensional Hausdorff measure, then the family {Mf:f∈ Lip (X)} of multiplication operators on T2(X, μ) can be simultaneously diagonalized modulo any [Formula: see text]. Because the condition [Formula: see text] in general cannot be dropped (Kato-Rosenblum theorem), this establishes a special relation between [Formula: see text] and the one-dimensional Hausdorff measure. The main result of the paper is that such a relation breaks down in Hausdorff dimensions p>1.

scholarly journals Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings

2018 ◽  
Vol 28 (3) ◽  
pp. 365-387
Author(s):  
S. CANNON ◽  
D. A. LEVIN ◽  
A. STAUFFER
Keyword(s):  
Markov Chain ◽  
Relaxation Time ◽  
Lower Bound ◽  
Upper Bound ◽  
Open Problem ◽  
Mixing Time ◽  
Perpendicular Bisector ◽  
Unit Square

We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall and Spencer in 2002 [14]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2−s, (a + 1)2−s] × [b2−t, (b + 1)2−t] for a, b, s, t ∈ ℤ⩾ 0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least Ω(n1.38), improving upon the previously best lower bound of Ω(n log n) coming from the diameter of the chain.

HAUSDORFF MEASURES OF A CLASS OF MORAN SETS

Fractals ◽  
2020 ◽  
Vol 28 (03) ◽  
pp. 2050053
Author(s):  
XIAOFANG JIANG ◽  
QINGHUI LIU ◽  
GUIZHEN WANG ◽  
ZHIYING WEN
Keyword(s):  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Hausdorff Measures ◽  
Dimensional Hausdorff Measure ◽  
Self Similar

Let [Formula: see text] be the class of Moran sets with integer [Formula: see text] and real [Formula: see text] satisfying [Formula: see text]. It is well known that the Hausdorff dimension of any set in this class is [Formula: see text]. We show that for any [Formula: see text], [Formula: see text] where [Formula: see text] denotes [Formula: see text]-dimensional Hausdorff measure of [Formula: see text]. For any [Formula: see text] with [Formula: see text] there exists a self-similar set [Formula: see text] such that [Formula: see text].

Entropy of dynamical systems and perturbations of operators

1991 ◽  
Vol 11 (4) ◽  
pp. 779-786 ◽  
Author(s):  
Dan Voiculescu
Keyword(s):  
Hilbert Space ◽  
Dynamical Systems ◽  
Lower Bound ◽  
Hausdorff Measure ◽  
Spectral Measure ◽  
Von Neumann ◽  
Dimensional Hausdorff Measure ◽  
Hilbert Space Operators ◽  
Neumann Class ◽  
Adjoint Operators

In the papers [9, 10, 3, 11] on perturbations of Hilbert space operators, we studied an invariant (τ) where is a normed ideal of compact operators and τ a family of operators. The size of an ideal for which (τ) vanishes or does not vanish is an upper, respectively lower, bound for a kind of dimension of τ. In the case of systems of commuting self-adjoint operators τ, the results of [9,3] relate (τ) with (an ideal slightly smaller than the Schatten von Neumann class ) to the way the spectral measure of τ compares to p-dimensional Hausdorff measure.

The sets of Dirichlet non-improvable numbers versus well-approximable numbers

2019 ◽  
Vol 40 (12) ◽  
pp. 3217-3235 ◽  
Author(s):  
AYREENA BAKHTAWAR ◽  
PHILIP BOS ◽  
MUMTAZ HUSSAIN
Keyword(s):  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Affirmative Answer ◽  
Partial Quotient ◽  
Dimensional Hausdorff Measure ◽  
Image Position

Let $\unicode[STIX]{x1D6F9}:[1,\infty )\rightarrow \mathbb{R}_{+}$ be a non-decreasing function, $a_{n}(x)$ the $n$th partial quotient of $x$ and $q_{n}(x)$ the denominator of the $n$th convergent. The set of $\unicode[STIX]{x1D6F9}$-Dirichlet non-improvable numbers, $$\begin{eqnarray}G(\unicode[STIX]{x1D6F9}):=\{x\in [0,1):a_{n}(x)a_{n+1}(x)>\unicode[STIX]{x1D6F9}(q_{n}(x))\text{ for infinitely many }n\in \mathbb{N}\},\end{eqnarray}$$ is related with the classical set of $1/q^{2}\unicode[STIX]{x1D6F9}(q)$-approximable numbers ${\mathcal{K}}(\unicode[STIX]{x1D6F9})$ in the sense that ${\mathcal{K}}(3\unicode[STIX]{x1D6F9})\subset G(\unicode[STIX]{x1D6F9})$. Both of these sets enjoy the same $s$-dimensional Hausdorff measure criterion for $s\in (0,1)$. We prove that the set $G(\unicode[STIX]{x1D6F9})\setminus {\mathcal{K}}(3\unicode[STIX]{x1D6F9})$ is uncountable by proving that its Hausdorff dimension is the same as that for the sets ${\mathcal{K}}(\unicode[STIX]{x1D6F9})$ and $G(\unicode[STIX]{x1D6F9})$. This gives an affirmative answer to a question raised by Hussain et al [Hausdorff measure of sets of Dirichlet non-improvable numbers. Mathematika 64(2) (2018), 502–518].

scholarly journals The number of olfactory stimuli that humans can discriminate is still unknown

eLife ◽  
2015 ◽  
Vol 4 ◽  
Author(s):  
Richard C Gerkin ◽  
Jason B Castro
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Olfactory Stimuli ◽  
The One ◽  
Reported Data

It was recently proposed (<xref ref-type="bibr" rid="bib2">Bushdid et al., 2014</xref>) that humans can discriminate between at least a trillion olfactory stimuli. Here we show that this claim is the result of a fragile estimation framework capable of producing nearly any result from the reported data, including values tens of orders of magnitude larger or smaller than the one originally reported in (<xref ref-type="bibr" rid="bib2">Bushdid et al., 2014</xref>). Additionally, the formula used to derive this estimate is well-known to provide an upper bound, not a lower bound as reported. That is to say, the actual claim supported by the calculation is in fact that humans can discriminate at most one trillion olfactory stimuli. We conclude that there is no evidence for the original claim.

Mass transference principle for limsup sets generated by rectangles

2015 ◽  
Vol 158 (3) ◽  
pp. 419-437 ◽  
Author(s):  
BAO-WEI WANG ◽  
JUN WU ◽  
JIAN XU
Keyword(s):  
Lower Bound ◽  
Hausdorff Dimension ◽  
Lebesgue Measure ◽  
Hausdorff Measure ◽  
Unit Cube ◽  
Transference Principle ◽  
Theoretical Statement ◽  
Formula Group ◽  
Image Position ◽  
Full Lebesgue Measure

AbstractWe generalise the mass transference principle established by Beresnevich and Velani to limsup sets generated by rectangles. More precisely, let {xn}n⩾1 be a sequence of points in the unit cube [0, 1]d with d ⩾ 1 and {rn}n⩾1 a sequence of positive numbers tending to zero. Under the assumption of full Lebesgue measure theoretical statement of the set \begin{equation*}\big\{x\in [0,1]^d: x\in B(x_n,r_n), \ {{\rm for}\, {\rm infinitely}\, {\rm many}}\ n\in \mathbb{N}\big\},\end{equation*} we determine the lower bound of the Hausdorff dimension and Hausdorff measure of the set \begin{equation*}\big\{x\in [0,1]^d: x\in B^{a}(x_n,r_n), \ {{\rm for}\, {\rm infinitely}\, {\rm many}}\ n\in \mathbb{N}\big\},\end{equation*} where a = (a1, . . ., ad) with 1 ⩽ a1 ⩽ a2 ⩽ . . . ⩽ ad and Ba(x, r) denotes a rectangle with center x and side-length (ra1, ra2,. . .,rad). When a1 = a2 = . . . = ad, the result is included in the setting considered by Beresnevich and Velani.

scholarly journals The Exact Security of PMAC with Two Powering-Up Masks

2019 ◽  
pp. 125-145 ◽  
Author(s):  
Yusuke Naito
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Open Problem ◽  
Random Function ◽  
Block Cipher ◽  
Random Permutation ◽  
Authentication Code ◽  
Open Problems ◽  
Main Research ◽  
Main Research Topic

PMAC is a rate-1, parallelizable, block-cipher-based message authentication code (MAC), proposed by Black and Rogaway (EUROCRYPT 2002). Improving the security bound is a main research topic for PMAC. In particular, showing a tight bound is the primary goal of the research, since Luykx et al.’s paper (EUROCRYPT 2016). Regarding the pseudo-random-function (PRF) security of PMAC, a collision of the hash function, or the difference between a random permutation and a random function offers the lower bound Ω(q2/2n) for q queries and the block cipher size n. Regarding the MAC security (unforgeability), a hash collision for MAC queries, or guessing a tag offers the lower bound Ω(q2m /2n + qv/2n) for qm MAC queries and qv verification queries (forgery attempts). The tight upper bound of the PRF-security O(q2/2n) of PMAC was given by Gaži et el. (ToSC 2017, Issue 1), but their proof requires a 4-wise independent masking scheme that uses 4 n-bit random values. Open problems from their work are: (1) find a masking scheme with three or less random values with which PMAC has the tight upper bound for PRF-security; (2) find a masking scheme with which PMAC has the tight upper bound for MAC-security.In this paper, we consider PMAC with two powering-up masks that uses two random values for the masking scheme. Using the structure of the powering-up masking scheme, we show that the PMAC has the tight upper bound O(q2/2n) for PRF-security, which answers the open problem (1), and the tight upper bound O(q2m /2n + qv/2n) for MAC-security, which answers the open problem (2). Note that these results deal with two-key PMACs, thus showing tight upper bounds of PMACs with single-key and/or with one powering-up mask are open problems.

Geometric measures for parabolic rational maps

1992 ◽  
Vol 12 (1) ◽  
pp. 53-66 ◽  
Author(s):  
M. Denker ◽  
M. Urbański
Keyword(s):  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Julia Set ◽  
Rational Maps ◽  
Packing Measure ◽  
Rational Map ◽  
Dimensional Hausdorff Measure ◽  
Conformal Measure

AbstractLet h denote the Hausdorff dimension of the Julia set J(T) of a parabolic rational map T. In this paper we prove that (after normalisation) the h-conformal measure on J(T) equals the h-dimensional Hausdorff measure Hh on J(T), if h ≥ 1, and equals the h-dimensional packing measure Πh on J(T), if h ≤ 1. Moreover, if h < 1, then Hh = 0 and, if h > 1, then Πh(J(T)) = ∞.

Sign in / Sign up

Export Citation Format

Share Document