English
Related papers

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

200 papers

This article concerns the dimension theory of the graphs of a family of functions which include the well-known 'popcorn function' and its pyramid-like higher-dimensional analogues. We calculate the box and Assouad dimensions of these…

Metric Geometry · Mathematics 2023-09-07 Amlan Banaji , Haipeng Chen

For any field $\mathbb{F}$ and polynomials $f_{2},f_{3}\in\mathbb{F}[x,y]$, let $\Gamma_{\mathbb{F}}(f_{2},f_{3})$ denote the bipartite graph with vertex partition $P\cup L$, where $P$ and $L$ are two copies of $\mathbb{F}^{3}$, and…

Combinatorics · Mathematics 2020-07-31 Ming Xu , Xiaoyan Cheng , Yuansheng Tang

Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön

The fractional versions of graph theoretic-invariants multiply the range of applications in scheduling, assignment and operational research problems. In this paper, we introduce the fractional version of local metric dimension of graphs.…

Combinatorics · Mathematics 2018-10-09 Hira Benish , Muhammad Murtaza , Imran Javaid

A graph $G$ on $n$ vertices is a \emph{threshold graph} if there exist real numbers $a_1,a_2, \ldots, a_n$ and $b$ such that the zero-one solutions of the linear inequality $\sum \limits_{i=1}^n a_i x_i \leq b$ are the characteristic…

Combinatorics · Mathematics 2022-07-26 Mathew C. Francis , Atrayee Majumder , Rogers Mathew

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

Group Theory · Mathematics 2021-03-10 Jacek Świątkowski

For any finite-dimensional vector space ${\mathcal F}$ of continuous functions $f:{\mathbb R}^1 \to {\mathbb R}^1$ consider subspaces in ${\mathcal F}$ defined by systems of {\em equality conditions} $f(a_i) = f(b_i)$, where $(a_i, b_i)$,…

Geometric Topology · Mathematics 2023-12-20 Victor A. Vassiliev

Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…

Group Theory · Mathematics 2019-01-18 Motiejus Valiunas

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…

Combinatorics · Mathematics 2025-11-03 Jan Hubička , Michael Kompatscher , Matěj Konečný

Diagonals of rational functions are an important class of functions arising in number theory, algebraic geometry, combinatorics, and physics. In this paper we study the diagonal grade of a function $f$, which is defined to be the smallest…

Combinatorics · Mathematics 2025-04-15 Andrew Harder , Joe Kramer-Miller

We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…

Dynamical Systems · Mathematics 2024-07-23 Giovanni Panti

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

Combinatorics · Mathematics 2023-07-11 Daniel Neuen

Let S denote the family of all subspaces of the plane that are graphs of functions from the real line R to itself. We prove that S has two subfamilies G,H of spaces such that the cardinality of G is c (the cardinality of the continuum) and…

General Topology · Mathematics 2026-03-12 Gerald Kuba

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…

We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups,…

Group Theory · Mathematics 2007-05-23 V. S. Guba , M. V. Sapir

Let $G$ be a graph. A good function is a function $f:V(G)\rightarrow \{-1,1\}$, satisfying $f(N(v))\geq 1$, for each $v\in V(G)$, where $ N(v)=\{u\in V(G)\, |\, uv\in E(G) \} $ and $f(S) = \sum_{u\in S} f(u)$ for every $S \subseteq V(G) $.…

Discrete Mathematics · Computer Science 2014-06-12 S. Akbari , M. Dalirrooyfard , S. Davodpoor , K. Ehsani , R. Sherkati

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

Combinatorics · Mathematics 2020-01-28 Lucas Mol , Matthew J. H. Murphy , Ortrud R. Oellermann

Given a compact metric graph $\Gamma$ and the Laplacian $\Delta_{\Gamma}$ coupled with standard (Kirchhoff) vertex conditions, solutions to fractional elliptic partial differential equations of the form $(\kappa^2 -…

Analysis of PDEs · Mathematics 2025-12-16 Elsiddig Awadelkarim , David Bolin , Alexandre B. Simas

In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…

Rings and Algebras · Mathematics 2026-05-12 David A. Towers , Yesneri Zuleta , Ismael Gutierrez

Given a finite simple graph G, let G' be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If L(0)=0<L(1) <=…

Discrete Mathematics · Computer Science 2015-08-11 Oliver Knill