Related papers: Rigidity Theorem of Graph-directed Fractals

The notion of resistance distance, introduced by Klein and Randi\'c, has become a fundamental concept in spectral graph theory and network analysis, as it captures both the structural and electrical properties of a graph. The associated…

In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or…

In a former paper the first and third authors introduced the notion of direction set for a subset of R^n, and showed that the dimension of the common direction set of two subanalytic subsets, called directional dimension, is preserved by a…

We introduce a technique that uses projection properties of fractal percolation to establish dimension conservation results for sections of deterministic self-similar sets. For example, let $K$ be a self-similar subset of $\mathbb{R}^2$…

The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected…

In many low-dimensional dynamical systems transport coefficients are very irregular, perhaps even fractal functions of control parameters. To analyse this phenomenon we study a dynamical system defined by a piece-wise linear map and…

A connected r-regular graph, where $r \geq 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participates in some perfect matching. We set out to: (i) characterize…

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

We show a rigid connection between two classical objects: the R.Thompson group F and the Dunce hat. A diagram group of a directed 2-complex contains a copy of F if and only if the complex contains a copy of the Dunce hat.

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

The main result of this article is a Llarull-type rigidity statement for scalar curvature on Riemannian spin manifolds with cone-like singularities in odd dimensions. The even dimensional analog was proven in an earlier work together with…

We consider the concept of fractons as particles or quasiparticles which obey a specific fractal statistics in connection with a one-dimensional Luttinger liquid theory. We obtain a dual statistics parameter ${\tilde{\nu}}=\nu+1$ which is…

This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…

In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb Z_m$ such that $R=-R$, $T=-T$,…

We investigate the problem of reconstructing a set $P\subseteq \mathbb{R}$ of distinct points, where the only information available about $P$ consists of the distances between some of the pairs of points. More precisely, we examine which…