相关论文: On the packing dimension of weighted singular matr…
In this paper, we establish upper bounds on the dimension of sets of singular-on-average and \(\omega\)-singular affine forms in singly metric settings, where either the matrix or the shift is fixed. These results partially address open…
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 study the porosity properties of fractal percolation sets $E\subset\mathbb{R}^d$. Among other things, for all $0<\varepsilon<\tfrac12$, we obtain dimension bounds for the set of exceptional points where the upper porosity of $E$ is less…
We prove a sharp upper bound on the Hausdorff dimension of weighted singular vectors in $\mathbb{R}^m$ using dynamics on homogeneous spaces, specifically the method of integral inequalities. Together with the lower bound proved recently by…
Singular vectors are those for which the quality of rational approximations provided by Dirichlet's Theorem can be improved by arbitrarily small multiplicative constants. We provide an upper bound on the Hausdorff dimension of singular…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
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 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…
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.
In the parameter spaces of nonlinear dynamical systems, we investigate the boundaries between periodicity and chaos and unveil the existence of fractal sets characterized by a singular fractal dimension. This dimension stands out from the…
We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We introduce a fractal dimension for a metric space defined in terms of the persistent homology of extremal subsets of that space. We exhibit hypotheses under which this dimension is comparable to the upper box dimension; in particular, the…
In this paper, we define new fractal dimensions of a metric space in order to calculate the roughness of a set on a large scale. These fractal dimensions are called upper zeta dimension and lower zeta dimension. The upper zeta dimension is…
We describe some recent results on the dimensions of linear projections of self-affine fractals, focusing in particular on an upper bound for the dimension of the projected image. We give a self-contained treatment of this bound and…
We prove that the martingale dimensions for canonical diffusion processes on a class of self-similar sets including nested fractals are always one. This provides an affirmative answer to the conjecture of S. Kusuoka [Publ. Res. Inst. Math.…
We consider transport exponents associated with the dynamics of a wavepacket in a discrete one-dimensional quantum system and develop a general method for proving upper bounds for these exponents in terms of the norms of transfer matrices…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…
This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…