Related papers: The generalized upper box dimension
The dimension of the visible part of self-affine sets, that satisfy domination and a projection condition, is being studied. The main result is that the assouad dimension of the visible part equals to 1 for all directions outside the set of…
Generalised parallelisable spaces permit to uplift many maximal gauged supergravities to ten or eleven dimensions. While some of the former are explicitly known, the literature is still lacking a systematic construction and a complete…
We introduce the notion of dynamical metric order of a continuous map on a compact metric space, study its basic properties, and compute it for several classes of maps. This concept which is a counterpart of the metric mean dimension with…
In this paper, we introduce the concept of graded extension dimension for a group graded ring R, denoted by gr.ext.dim(R). We prove that when R is strongly graded, its graded extension dimension coincides with the non-graded extension…
The concept of universality has shaped our understanding of many-body physics, but is mostly limited to homogenous systems. Here, we present a study of universality on a non-homogeneous graph, the long-range diluted graph (LRDG). Its…
We develop a probabilistic framework for large-scale dimension bounds in metric geometry, based on padded decompositions, randomized ball carving on net graphs, and the Lov\'asz Local Lemma. For metric measure spaces with volume doubling…
We show that any space with a positive upper curvature bound has in a small neighborhood of any point a closely related metric with a negative upper curvature bound.
Aimed at explaining the surprisingly good generalization behavior of overparameterized deep networks, recent works have developed a variety of generalization bounds for deep learning, all based on the fundamental learning-theoretic…
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…
We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $\epsilon>0$ such…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
In this paper we address what generalized geometric structures are possible on products of spaces that each admit generalized geometries. In particular we consider, first, the product of two odd dimensional spaces that each admit a…
We investigate the box dimensions of compact sets in $\mathbb{R}^2$ that contain a unit distance in every direction (such sets may have zero Hausdorff dimension). Among other results, we show that the lower box dimension must be at least…
Families of boxes in $\mathbb R^d$ are considered. In the paper an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the given family was improved.
The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.
Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.
We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…
We prove a packing exponent formula for the upper box-counting dimension of attractors of certain projective iterated function systems. This partially affirms a conjecture of De Leo, and gives that the box-counting dimension of the Rauzy…