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

A {\it 2-rainbow domination function} of a graph $G$ is a function $f$ that assigns to each vertex a set of colors chosen from the set $\{1,2\}$, such that for any $v\in V(G)$, $f(v)=\emptyset$ implies $\bigcup_{u\in N(v)}f(u)=\{1,2\}$. The…

Let $Y$ be an algebraic manifold of dimension 3 with $H^i(Y, \Omega^j_Y)=0$ for all $j\geq 0$, $i>0$ and $h^0(Y, {\mathcal{O}}_Y) > 1$. Let $X$ be a smooth completion of $Y$ such that the boundary $X-Y$ is the support of an effective…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

We introduce two frameworks in order to deal with fractal and multi-fractal analysis for subset sum problems where some embedding into the $1$-dimensional Euclidean space plays an important role. As one of these frameworks, the notion of…

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph…

Given a vector function ${\bf F}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common denominator in…

Given a map $f: X\rightarrow Y$ of simply connected spaces of finite type such. The space of based loops at $f$ of the space of maps between $X$ and $Y$ is denoted by $\Omega_{f} Map(X,Y)$. For $n> 0$, we give a model categorical…

In this paper we study definable families of functions from an ordered abelian group into various naturally arising definable quotients. We show that for an ordered abelian group $G$ and definable family of convex subgroups…

Let $G=(V(G),E(G))$ be a simple graph. A restrained double Roman dominating function (RDRD-function) of $G$ is a function $f: V(G) \rightarrow \{0,1,2,3\}$ satisfying the following properties: if $f(v)=0$, then the vertex $v$ has at least…

For a digraph $\Gamma$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $\Gamma$, then $F$ is called the splitting field of $\Gamma$. The extension degree of $F$ over the…

Given a finite set $E$, a subset $D\sub E$ (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as $D$ is orthogonal to every $\sub$-minimal element of $\FF$.…

Modular graph functions associate to a graph an $SL(2,Z)$-invariant function on the upper half plane. We obtain the Fourier series of modular graph functions of arbitrary weight $w$ and two-loop order. The motivation for this work is to…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…

We describe the structure of all codimension-two lattice configurations $A$ which admit a stable rational $A$-hypergeometric function, that is a rational function $F$ all whose partial derivatives are non zero, and which is a solution of…

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…

Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…

Let $G=(V,E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \in V$ is a function of vertices $x_1, \ldots, x_k \in V$ if there exists a Boolean function $f$ of $k$ variables such that for any vertex $z \in V - \{y, x_1,…

We prove the following theorem. Suppose that $F=(f_1, f_2)$ is a 2-dimensional vector-valued modular form on $SL_2(Z)$ whose component functions $f_1, f_2$ have rational Fourier coefficients with bounded denominators. Then $f_1$ and $f_2$…

Let $G$ be a graph with vertex set $V=V(G)$. A double Roman dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the conditions that if $f(v) = 0$, then vertex $v$ must have at least two neighbors in $V_2$ or…