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

Let $f$ be a generalized affine recurrent fractal interpolation function with vertical scaling functions. In this paper, by introducing underlying local iterated function systems of $f$, we define restricted vertical scaling matrices. Then…

In a graph G, a dominating set Df subset of V (G) is called a dom-forcing set if the sub-graph induced by Df must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph G, denoted by…

Let $F=\{H_1,...,H_k\}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$-decomposable} if for {\em every} linear combination of the form $\alpha_1 e(H_1) + ... + \alpha_k e(H_k) = m$ where each $\alpha_i$ is a…

The geometric dimension for proper actions $\underline{\mathrm{gd}}(G)$ of a group $G$ is the minimal dimension of a classifying space for proper actions $\underline{E}G$. We construct for every integer $r\geq 1$, an example of a virtually…

A Roman dominating function of a graph $G=(V,E)$ is a labeling $f: V \rightarrow{} \{0 ,1, 2\}$ such that for each vertex $u \in V$ with $f(u) = 0$, there exists a vertex $v \in N(u)$ with $f(v) =2$. A Roman dominating function $f$ is a…

Let $K$ be an uncountable compact metric space and let $C(K,\mathbb{R}^d)$ denote the set of continuous maps $f\colon K \to \mathbb{R}^d$ endowed with the maximum norm. The goal of this paper is to determine various fractal dimensions of…

A space is defined to be "$n$-spheroidal" if it has the homotopy type of an $n$-dimensional CW-complex $X$ with $H_{n}(X, \mathbb{Z})$ not zero and finitely generated. A group $G$ is called "$n$-spheroidal" if its classifying space $K(G,1)$…

We have been interested in graphs and realizing them as Reeb graphs of explicit real algebraic functions. The Reeb graph of a differentiable function is the quotient space of the manifold of the domain, regarded as the space consisting of…

If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…

For a connected graph $\Gamma=(V,E)$, a subset $R$ of ordered vertices in $V$ is said to be a resolving set in $\Gamma$, if the vector of distances to the vertices in $R$ is unique for each $u^{i}\in V(\Gamma)$. The metric dimension of…

The domatic number of a graph $G$ is the maximum number of pairwise disjoint dominating sets of $G$. We are interested in the LP-relaxation of this parameter, which is called the fractional domatic number of $G$. We study its extremal value…

A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = \Sigma_{v\in V} f(v)$. The…

Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…

For a finite dimensional real vector space V with inner product, let F(V) be the block structure space, in the sense of surgery theory, of the projective space of V. Continuing a program launched in part I, we investigate F as a functor on…

Erd\H{o}s, Harary, and Tutte defined the dimension of a graph $G$ as the smallest natural number $n$ such that $G$ can be embedded in $\mathbb{R}^n$ with each edge a straight line segment of length 1. Since the proposal of this definition,…

We study the path of family size decompositions of varying depth of genealogical trees. We prove that this decomposition as a function on (equivalence classes of) ultra-metric measure spaces to the Skorohod space describing the family sizes…

Let $G$ be a graph, and $g,f:V(G)\rightarrow N$ be two functions with $g(x)\leq f(x)$ for each vertex $x$ in $G$. We say that $G$ has all fractional $(g,f)$-factors if $G$ includes a fractional $r$-factor for every $r:V(G)\rightarrow N$…

The paper is about methods of discrete Fourier analysis in the context of Weyl group symmetry. Three families of class functions are defined on the maximal torus of each compact simply connected semisimple Lie group $G$. Such functions can…

The Riordan group is a set of infinite lower-triangular matrices defined by two generating functions, $g$ and $f$. The elements of the group are called Riordan arrays, denoted by $(g,f)$, and the $k$th column of a Riordan array is given by…

For a finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem consists in, given a graph $G$ and an integer $k$, deciding whether there exists $S \subseteq V(G)$ with $|S| \leq k$ such that $G \setminus S$ does not contain…