相关论文: Higher-dimensional multifractal value sets for con…
Given an infinite iterated function system (IFS) $\mathcal{F}$, we define its dimension spectrum $D(\mathcal{F})$ to be the set of real numbers which can be realised as the dimension of some subsystem of $\mathcal{F}$. In the case where…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…
Multifractals are inhomogeneous measures (or functions) which are typically described by a full spectrum of real dimensions, as opposed to a single real dimension. Results from the study of fractal strings in the analysis of their geometry,…
The complex dynamics of baker's map and its variants in an infinite-precision mathematical domain have been extensively analyzed in the past five decades. However, their real structure implemented in a finite-precision computer remains…
For countably infinite IFSs on $\mathbb R^2$ consisting of affine contractions with diagonal linear parts, we give conditions under which the affinity dimension is an upper bound for the Hausdorff dimension and a lower bound for the lower…
The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…
We survey the definition of the radial Julia set of a meromorphic function (in fact, more generally, any "Ahlfors islands map"), and give a simple proof that the Hausdorff dimension of the reduced Julia set always coincides with the…
We study new relations between countable iterated function systems (IFS) with overlaps, Smale endomorphisms and random systems with complete connections. We prove that stationary measures for countable conformal IFS with overlaps and…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
This work is devoted to giving a geometric framework for describing higher-order non-autonomous mechanical systems. The starting point is to extend the Lagrangian-Hamiltonian unified formalism of Skinner and Rusk for these kinds of systems,…
In this paper, the concept of coderivatives at infinity of set-valued mappings is introduced. Well-posedness properties at infinity of set-valued mappings as well as Mordukhovich's criterion at infinity are established. Fermat's rule at…
Representing the conditional independences present in a multivariate random vector via graphs has found widespread use in applications, and such representations are popularly known as graphical models or Markov random fields. These models…
We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…
We study the graph of the function $d(t)$ encoding the Hausdorff dimensions of the classical Lagrange and Markov spectra with half-infinite lines of the form $(-\infty, t)$. For this sake, we use the fact that the Hausdorff dimension of…
We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…
This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…
In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…