Related papers: Boolean dimension and local dimension
Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…
We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…
The intrinsic dimensionality refers to the ``true'' dimensionality of the data, as opposed to the dimensionality of the data representation. For example, when attributes are highly correlated, the intrinsic dimensionality can be much lower…
Let $X$ be a finite set. A family $P$ of subsets of $X$ is called a convex geometry with ground set $X$ if (1) $\emptyset, X\in P$; (2) $A\cap B\in P$ whenever $A,B\in P$; and (3) if $A\in P$ and $A\neq X$, there is an element $\alpha\in…
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…
It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to posets whose cover graphs have bounded treewidth, as the…
In 1977, Trotter and Moore proved that a poset has dimension at most $3$ whenever its cover graph is a forest, or equivalently, has treewidth at most $1$. On the other hand, a well-known construction of Kelly shows that there are posets of…
The problem of bounding of the distance between the two bodies of volume $\varepsilon$ located inside the $n$-dimensional body $B$ of unit volume where $n \to \infty$ is considered. In some cases such distances are bounded by function…
We introduce two new concepts, local homogeneity and local L^q-spectrum, both of which are tools that can be used in studying the local structure of measures. The main emphasis is given to the examination of local dimensions of measures in…
For $P$ a poset, the dimension of $P$ is defined to be the least cardinal $\kappa$ such that $P$ is embeddable in a direct product of $\kappa$ totally ordered sets. We study the behavior of this function on finite-dimensional (not…
Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced just very recently, in…
The Assouad and quasi-Assouad dimensions of a metric space provide information about the extreme local geometric nature of the set. The Assouad dimension of a set has a measure theoretic analogue, which is also known as the upper regularity…
Embedding spaces contain interpretable dimensions indicating gender, formality in style, or even object properties. This has been observed multiple times. Such interpretable dimensions are becoming valuable tools in different areas of…
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 relations between several notions of dimension for an additive set, some of which are well-known and some of which are more recent, appearing for instance in work of Schoen and Shkredov. We obtain bounds for the ratios between…
We introduce three measures of complexity for families of sets. Each of the three measures, that we call dimensions, is defined in terms of the minimal number of convex subfamilies that are needed for covering the given family: for upper…
The highly influential framework of conceptual spaces provides a geometric way of representing knowledge. Instances are represented by points in a high-dimensional space and concepts are represented by regions in this space. Our recent…
Firstly, we introduce a new notion called induced upper metric mean dimension with potential, which naturally generalizes the definition of upper metric mean dimension with potential given by Tsukamoto to more general cases, then we…