Related papers: Dimension of graphoids of rational vector-function…

If $F$ is a set-valued mapping from $\R^n$ into $\R^m$ with closed graph, then $y\in \R^m$ is a critical value of $F$ if for some $x$ with $y\in F(x)$, $F$ is not metrically regular at $(x,y)$. We prove that the set of critical values of a…

In [S. Arumugam, V. Mathew and J. Shen, On fractional metric dimension of graphs, preprint], Arumugam et al. studied the fractional metric dimension of the cartesian product of two graphs, and proposed four open problems. In this paper, we…

We determine the Hausdorff and box dimension of the fractal graphs for a general class of Weierstrass-type functions of the form $f(x) = \sum_{n=1}^\infty a_n \, g(b_n x + \theta_n)$, where $g$ is a periodic Lipschitz real function and…

We prove that the space $M(K(x,y))$ of $\mathbb R$-places of the field $K(x,y)$ of rational functions of two variables with coefficients in a totally Archimedean field $K$ has covering and integral dimensions $\dim M(K(x,y))=\dim_\IZ…

A family $\bfam$ of continuous real-valued functions on a space $X$ is said to be {\sl basic} if every $f \in C(X)$ can be represented $f = \sum_{i=1}^n g_i \circ \phi_i$ for some $\phi_i \in \bfam$ and $g_i \in C(\R)$ ($i=1, ..., n$).…

A vertex $x$ in a graph $G$ resolves two vertices $u$, $v$ of $G$ if the distance between $u$ and $x$ is not equal to the distance between $v$ and $x$. A function $g$ from the vertex set of $G$ to $[0,1]$ is a resolving function of $G$ if…

A vertex $v\in V$ is said to resolve two vertices $x$ and $y$ if $d_G(v,x)\ne d_G(v,y)$. A set $S\subset V$ is said to be a metric generator for $G$ if any pair of vertices of $G$ is resolved by some element of $S$. A minimum metric…

The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…

Let $p$ be an odd prime, $q=p^e$, $e\ge 1$, and $\mathbb{F} = \mathbb{F_q}$ denote the finite field of $q$ elements. Let $f: \mathbb{F}^2\to \mathbb{F}$ and $g: \mathbb{F}^3\to \mathbb{F}$ be functions, and let $P$ and $L$ be two copies of…

A set of vertices $W$ {\em resolves} a graph $G$ if every vertex of $G$ is uniquely determined by its vector of distances to the vertices in $W$. The {\em metric dimension} for $G$, denoted by $\dim(G)$, is the minimum cardinality of a…

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

A Roman $\{2\}$-dominating function (R2F) is a function $f:V\rightarrow \{0,1,2\}$ with the property that for every vertex $v\in V$ with $f(v)=0$ there is a neighbor $u$ of $v$ with $f(u)=2$, or there are two neighbors $x,y$ of $v$ with…

For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…

We prove that the Hausdorff dimension of the graph of a prevalent continuous function is 2. We also indicate how our results can be extended to the space of continuous functions on $[0,1]^d$ for $d \in \mathbb{N}$ and use this to obtain…

Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of…

A Roman dominating function for a (non-weighted) graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $u\in V$ with $f(u)=0$ has at least {one} neighbor $v\in V$ such that $f(v)=2$. The minimum weight $\sum_{v\in…

A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…

We consider fractal graphs invariant by a skew product $F:\mathbb{T}^k\times \mathbb{R}\rightarrow \mathbb{T}^k\times \mathbb{R}$ of the form $F(x,y)=(Ax, \lambda y+p(x))$ where $0<\lambda<1$, $p\colon\mathbb{T}^k\to\mathbb{R}$ is a…

We prove that for any discrete group $G$ with finite $\mathfrak{F}$-cohomological dimension, the Gorenstein cohomological dimension equals the $\mathfrak{F}$-cohomological dimension. This is achieved by constructing a long exact sequence of…

Let F be a family of Borel measurable functions on a complete separable metric space. The gap (or fat-shattering) dimension of F is a combinatorial quantity that measures the extent to which functions f in F can separate finite sets of…