Related papers: Dimensions of graphs of prevalent continuous maps

In this article, we provide a simple and systematic way to represent general (inhomogeneous) fractals that may look different at different scales and places. By using set-valued compression maps, we express these general fractals as…

We show that every holomorphic map $f\in\mathcal{H}(\Omega\setminus K)$ ($K\subset\Omega\subset\mathbb{C}^n$, with $K$ compact, $\Omega$ open, and $n\ge2$), has a unique "\emph{Hartogs companion}" $\tilde f\in\mathcal{H}(\Omega)$ matching…

A generalization of the celebrated Falconer distance problem asks for a graph $G=(\mathcal{V},\mathcal{E})$, with vertex set $\mathcal{V}$ and edge set $\mathcal{E}$, how large the Hausdorff dimension of a compact set $E\subset…

For a multigraph $F$, the $k$-subdivision of $F$ is the graph obtained by replacing the edges of $F$ with pairwise internally vertex-disjoint paths of length $k+1$. Conlon and Lee conjectured that if $k$ is even, then the…

Let F(X) be the set of finite nonempty subsets of a set X. We have found the necessary and sufficient conditions under which for a given function f:F(X)-->R there is an ultrametric on X such that f(A)=diam A for every A\in F(X). For finite…

Hausdorff dimensions of level sets of generic continuous functions defined on fractals were considered in two papers by R. Balka, Z. Buczolich and M. Elekes. In those papers the topological Hausdorff dimension of fractals was defined. In…

Edmonds' fundamental theorem on arborescences characterizes the existence of $k$ pairwise arc-disjoint spanning arborescences with prescribed root sets in a digraph. In this paper, we study the problem of packing branchings in digraphs…

A classical result of Erd\H{o}s, Lov\'asz and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected…

Let $C$ be the attractor of the IFS $\{f_{d}(z) = (-n+i)^{-1}(z+d): d\in D\}$, $D\subset\{0, 1, \ldots, n^{2}\}$ and let $\dim$ denote the box-counting dimension. It is known that for all $\lambda\in[0, 1]$, that the set of complex numbers…

For graphs $G$ and $H$, a {\em homomorphism} from $G$ to $H$, or {\em $H$-coloring} of $G$, is an adjacency preserving map from the vertex set of $G$ to the vertex set of $H$. Writing ${\rm hom}(G,H)$ for the number of $H$-colorings…

For a positive integer $n$, a graph $F$ and a bipartite graph $G\subseteq K_{n,n}$ let ${F(n+n, G)}$ denote the number of copies of $F$ in $G$, and let $F(n+n, m)$ denote the minimum number of copies of $F$ in all graphs $G\subseteq…

We study the singularity (multifractal) spectrum of continuous convex functions defined on $[0,1]^{d}$. Let $E_f({h}) $ be the set of points at which $f$ has a pointwise exponent equal to $h$. We first obtain general upper bounds for the…

Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…

Let $F$ be a strictly $1$-balanced $k$-graph on $s$ vertices with $t$ edges and $\delta_{F,d}^T$ be the infimum of $\delta>0$ such that for every $\alpha>0$ and sufficiently large $n\in \mathbb{N}$, every $k$-graph system $\mathbf…

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…

Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…

Let $k$ be a natural number. We consider $k$-times continuously-differentiable real-valued functions $f:E\to\mathbb{R}$, where $E$ is some interval on the line having positive length. For $0<\alpha<1$ let $I_\alpha(f)$ denote the set of…

For a hyperbolic map f on a saddle type fractal Lambda with self-intersections, the number of f- preimages of a point x in Lambda may depend on x. This makes estimates of the stable dimensions more difficult than for diffeomorphisms or for…

In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…

We study the Hausdorff dimension and measures of full Hausdorff dimension for a compact invariant set of an expanding nonconformal map on the torus given by an integer-valued diagonal matrix. The Hausdorff dimension of a "general Sierpinski…