Related papers: Strict inequality in the box-counting dimension pr…
Hausdorff and box dimension are two familiar notions of fractal dimension. Box dimension can be larger than Hausdorff dimension, because in the definition of box dimension, all sets in the cover have the same diameter, but for Hausdorff…
We prove that if $G = G_1\times\dots\times G_n$ acts essentially, properly and cocompactly on a CAT(0) cube complex X, then the cube complex splits as a product. We use this theorem to give various examples of groups for which the minimal…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
We use the differentiability of the arithmetic volume function and an arithmetic Bertini type theorem to classify when one can find a closed point on the generic fiber of an arithmetic variety, whose heights with respect to some finite…
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…
In this paper we study two random analogues of the box-like self-affine attractors introduced by Fraser, itself an extension of Sierpi\'nski carpets. We determine the almost sure box-counting dimension for the homogeneous random case…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
We estimate the bounds of box-counting dimension of hidden variable fractal interpolation functions (HVFIFs) and hidden variable bivariate fractal interpolation functions (HVBFIFs) with four function contractivity factors and present…
We generalize the inequality being a counterpart of the several complex variables version of the Suita conjecture. For this aim higher order generalizations of the Bergman kernel are introduced. As a corollary some new partial results on…
We determine the Hausdorff, packing and box-counting dimension of a family of self-affine sets generalizing Bara\'nski carpets. More specifically, we fix a Bara\'nski system and allow both vertical and horizontal random translations, while…
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…
We give universal upper bounds on the relative dimensions of isotypic components of a tensor product of the linear group GL(n) representations and universal upper bounds on the relative dimensions of irreducible components of a tensor…
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…
Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…
This note contains two simple observations. First, by the weak factorization of product $H^1$ (Ferguson--Lacey, Lacey--Terwilleger), we obtain a multi-parameter analogue of Hardy's inequality. Second, as a dual statement, the Fourier…
Non-integer dimensions are commonplace in quantum field theories (QFTs) through dimensional regularization. In particular this affects angular calculations involving dot products. The structure of these rises from the generally accepted…
In this paper, Wielandt's inequality for classical channels is extended to quantum channels. That is, an upper bound to the number of times a channel must be applied, so that it maps any density operator to one with full rank, is found.…
For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…