Related papers: Rigidity Theorem of Graph-directed Fractals

Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…

Circle packings with specified patterns of tangencies form a discrete counterpart of analytic functions. In this paper we study univalent packings (with a combinatorial closed disk as tangent graph) which are embedded in (or fill) a…

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

For complete Riemannian manifolds with vanishing Bach tensor and positive constant scalar curvature, we provide a rigidity theorem characterized by some pointwise inequalities. Furthermore, we prove some rigidity results under an inequality…

Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…

We show that pseudoconvex Reinhardt domains in dimension two with isomorphic semigroups of holomorphic endomorphisms are biholomorphically or anti-biholomorphically equivalent. Moreover, we show that every Stein manifold that retracts to a…

Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between $w$ and $v$ containing $u$. A vertex set $R$ is a strong…

We present measure theoretic rigidity for graphs of first Betti number b>1 in terms of measures on the boundary of a 2b-regular tree, that we make explicit in terms of the edge-adjacency and closed-walk structure of the graph. We prove that…

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…

It is shown that every bi-Lipschitz bijection from $\mathbb{Z}$ to itself is at a bounded $L_{\infty}$ distance from either the identity or the reflection. We then comment on the group-theoretic properties of the action of bi-Lipschitz…

We investigate how the Hausdorff dimension and measure of a self-similar set $K\subseteq\mathbb{R}^{d}$ behave under linear images. This depends on the nature of the group $\mathcal{T}$ generated by the orthogonal parts of the defining maps…

We propose two new kinds of infinite resistor networks based on the Fibonacci sequence: a serial association of resistor sets connected in parallel (type 1) or a parallel association of resistor sets connected in series (type 2). We show…

The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…

We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of…