Related papers: Dimension estimates for sets of uniformly badly ap…
Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…
In this paper, we determine the Hausdorff dimension of the set of points with divergent trajectories on the product of certain homogeneous spaces. The flow is allowed to be weighted with respect to the factors in the product space. The…
In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…
Metric estimates are quantities that approximate the word metric of a finitely presented group up to multiplicative constants. In this paper, they are computed for some nilpotent groups and used to compute the distortion functions of…
In metric Diophantine approximation, one frequently encounters the problem of showing that a limsup set has positive or full measure. Often it is a set of points in $m$-dimensional Euclidean space, or a set of $n$-by-$m$ systems of linear…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible to obtain consistent procedures unless $p/n\rightarrow0$, a…
Metric mean dimension is a geometric invariant of dynamical systems with infinite topological entropy. We relate this concept with the fractal structure of the phase space and the H\"older regularity of the map. Afterwards we improve our…
In 1988 K. Falconer introduced a formula which predicts the value of the Hausdorff dimension of the attractor of an affine iterated function system. The value given by this formula -- sometimes referred to as the affinity dimension -- is…
In [14], the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In this paper, we extend this approach to incorporate high order approximation methods.…
We construct a quasiconformal mapping of $n$-dimensional Euclidean space, $n \geq 2$, that simultaneously distorts the Hausdorff dimension of a nearly maximal collection of parallel lines by a given amount. This answers a question of…
This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual…
The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. In this work, a modified version of this fractal dimension is presented in order to make it more robust when applied in estimating…
This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…
We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…
The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of…
We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…
We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…
We compute the Hausdorff, upper box and packing dimensions for certain inhomogeneous Moran set constructions. These constructions are beyond the classical theory of iterated function systems, as different nonlinear contraction…