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

Let $f: S^2 \to S^2$ be an expanding branched covering map of the sphere to itself with finite postcritical set $P_f$. Associated to $f$ is a canonical quasisymmetry class $\GGG(f)$ of Ahlfors regular metrics on the sphere in which the…

The function $\Gamma$ on the space of graphons, introduced in [CGH$^+$15], aims to measure the extent to which a graphon $w$ exhibits the Robinson property: for all $x<y<z$, $w(x,z)\leq \min\{ w(x,y),w(y,z)\}$. Robinson graphons form a…

A 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 metric dimension of $\Gamma$ is the smallest size of…

The dynamical degrees of a rational map $f:X\dashrightarrow X$ are fundamental invariants describing the rate of growth of the action of iterates of $f$ on the cohomology of $X$. When $f$ has nonempty indeterminacy set, these quantities can…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…

Let $a, Q\in\Q$ be given and consider the set $\cal{G}(a, Q)=\{aQ^{i}:\;i\in\N\}$ of terms of geometric progression with 0th term equal to $a$ and the quotient $Q$. Let $f\in\Q(x, y)$ and $\cal{V}_{f}$ be the set of finite values of $f$. We…

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…

In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top…

Let $f,g:X \to Y$ be continuous mappings. We say that $f$ is topologically equivalent to $g$ if there exist homeomorphisms $\Phi : X\to X$ and $\Psi: Y\to Y$ such that $\Psi\circ f\circ \Phi=g.$ Let $X,Y$ be complex smooth irreducible…

In this paper, we prove the identity $\dim_{\textrm H}(F)=d\cdot \dim_{\textrm H}(\alpha^{-1}(F))$, where $\dim_{\textrm H}$ denotes Hausdorff dimension, $F\subseteq \mathbb{R}^d$, and $\alpha:[0,1]\to [0,1]^d$ is a function whose…

Let $\Gamma$ be a crystal group in $\mathbb R^d$. A function $\varphi:\mathbb R^d\longrightarrow \mathbb C$ is said to be {\em crystal-refinable} (or $\Gamma-$refinable) if it is a linear combination of finitely many of the rescaled and…

In this paper we study the dimension spectrum of general conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We perform a comprehensive study of the dimension spectrum addressing questions…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

Let $f: M\rightarrow M$ be a continuous map on a compact metric space $M$ equipped with a fixed metric $d$, and let $\tau$ be the topology on $M$ induced by $d$. First, we will establish some fundamental properties of the mean Hausdorff…

We investigate two open questions in a cohomology theory relative to the family of finite subgroups. The problem of whether the F-cohomological dimension is subadditive is reduced to extensions by groups of prime order. We show that every…

For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…

Two-dimensional conformal field theory (CFT) can be defined through its correlation functions. These must satisfy certain consistency conditions which arise from the cutting of world sheets along circles or intervals. The construction of a…