Related papers: Upper bounding for packing dimension in vectorial …
We undertake a general study of multifractal phenomena for functions. We show that the existence of several kinds of multifractal functions can be easily deduced from an abstract statement, leading to new results. This general approach does…
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
This article fits in many studies of multifractal analysis of measure. We took as a starting point the work of F. Ben Nasr in " Calculs de dimension de packing " to give a new inequality involving $Dim(\bar{X}^{\alpha})$ which would be, in…
We introduce a mixed generalized multifractal formalism which extends the mixed multifractal formalism introduced by L. Olsen based on generalizations of the Hausdorff and packing measures. The validity of such a formalism is proved in some…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In this paper, we study the multifractal Hausdorff and packing dimensions of Borel probability measures and study their behaviors under orthogonal projections. In particular, we try through these results to improve the main result of M. Dai…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We examine Frostman-type characterisations and other extremal measure criteria for a range of fractal dimensions of sets. In particular we derive properties of the less familiar modified lower box dimension and upper correlation dimension.…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
A way to add an extra dimension is briefly discussed.
Dimension profiles were introduced by Falconer and Howroyd to provide formulae for the box-counting and packing dimensions of the orthogonal projections of a set E or a measure on Euclidean space onto almost all m-dimensional subspaces. The…
We consider multifractal Mandelbrot cascades supported on planar $C^2$ curves with nonvanishing curvature and show that their Fourier dimension is as large as possible, i.e., equal to the infimum of the lower pointwise dimension of the…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
We extend the concept of packing dimension profiles, due to Falconer and Howroyd (1997) and Howroyd (2001), and use our extension in order to determine the packing dimension of an arbitrary image of a general Levy process.
Dimension profiles were introduced in [8,11] to give a formula for the box-counting and packing dimensions of the orthogonal projections of a set $R^n$ onto almost all $m$-dimensional subspaces. However, these definitions of dimension…
We provide a self-contained exposition of the well-known multifractal formalism for self-similar measures satisfying the strong separation condition. At the heart of our method lies a pair of quasiconvex optimization problems which encode…
We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued function classes. These dimensional notions play an important…
Theories defined in higher than four dimensions have been used in various frameworks and have a long and interesting history. Here we review certain attempts, developed over the last years, towards the construction of unified particle…
The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…
For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.