English
Related papers

Related papers: Rigidity Theorem of Graph-directed Fractals

200 papers

This paper is the first from a series of papers that establish a common analogue of the strong component and basilica decompositions for bidirected graphs. A bidirected graph is a graph in which a sign $+$ or $-$ is assigned to each end of…

Combinatorics · Mathematics 2017-09-22 Nanao Kita

We prove some rigidity theorems for configurations of closed disks. First, fix two collections $\mathcal{C}$ and $\tilde{\mathcal{C}}$ of closed disks in the Riemann sphere $\hat{\mathbb{C}}$, sharing a contact graph which…

Metric Geometry · Mathematics 2015-10-08 Andrey M. Mishchenko

A function $f:\RR^n \to \RR$ is called \emph{vertically rigid} if $graph(cf)$ is isometric to $graph (f)$ for all $c \neq 0$. We settled Jankovi\'c's conjecture in a separate paper by showing that a continuous function $f:\RR \to \RR$ is…

Classical Analysis and ODEs · Mathematics 2011-09-26 Richárd Balka , Márton Elekes

The main goal of this work is to show that if two weighted homogeneous (but not homogeneous) function-germs $(\C^2,0)\to(\C,0)$ are bi-Lipschitz equivalent, in the sense that these function-germs can be included in a strongly bi-Lipschitz…

Algebraic Geometry · Mathematics 2011-02-24 Alexandre Fernandes , Maria Ruas

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…

Analysis of PDEs · Mathematics 2025-11-04 Sedef Özcan

The purpose of this note is two fold. First, we study the relation between a pair of H\'{e}non maps that share the same forward and backward non-escaping sets. Second, it is shown that there exists a continuum of $Short-\mathbb{C}^2$'s that…

Dynamical Systems · Mathematics 2018-06-22 Sayani Bera , Ratna Pal , Kaushal Verma

We say that a bipartite graph $G(A, B)$ with fixed parts $A$, $B$ is proximinal if there is a semimetric space $(X, d)$ such that $A$ and $B$ are disjoint proximinal subsets of $X$ and all edges $\{a, b\}$ satisfy the equality $d(a, b) =…

Combinatorics · Mathematics 2022-01-24 Karim Chaira , Oleksiy Dovgoshey , Samih Lazaiz

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

Metric Geometry · Mathematics 2018-11-13 Siu Lam Leung , Sarah Nelson , Sofiya Ostrovska , Mikhail Ostrovskii

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Combinatorics · Mathematics 2024-03-29 C. Dalfó , G. Erskine , G. Exoo , M. A. Fiol , J. Tuite

A separable metric space X is an H-null set if any uniformly continuous image of X has Hausdorff dimension zero. upper H-null, directed P-null and P-null sets are defined likewise, with other fractal dimensions in place of Hausdorff…

Logic · Mathematics 2012-08-29 Ondrej Zindulka

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Combinatorics · Mathematics 2022-10-11 Lewis Stanton , Jeffrey Thompson

In the present paper we define statistically self-similar sets, and, using a modification of method described K.J.Falconer find a Hausdorff dimension of a statistically self-similar set.

Dynamical Systems · Mathematics 2007-05-23 Konstantin Igudesman

Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…

Materials Science · Physics 2019-11-20 Mohammed Ghadiyali , Sajeev Chacko

In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the…

Group Theory · Mathematics 2022-02-17 Changying Ding , Srivatsav Kunnawalkam Elayavalli

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…

Combinatorics · Mathematics 2024-11-27 Zejun Huang , Jiahui Liu , Chenxi Yang

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

Dynamical Systems · Mathematics 2026-01-21 Zhengyu Yin

We introduce a new family of fractal dimensions by restricting the set of diameters in the coverings in the usual definition of the Hausdorff dimension. Among others, we prove that this family contains continuum many distinct dimensions,…

Classical Analysis and ODEs · Mathematics 2026-05-26 Richárd Balka , Tamás Keleti

For all $1\leq m\leq n-1$, we investigate the interaction of locally finite measures in $\mathbb{R}^n$ with the family of $m$-dimensional Lipschitz graphs. For instance, we characterize Radon measures $\mu$, which are carried by Lipschitz…

Classical Analysis and ODEs · Mathematics 2021-03-03 Matthew Badger , Lisa Naples

We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected)…

Group Theory · Mathematics 2026-03-17 Dessislava H. Kochloukova