相关论文: Horofunctions on Sierpi\'nski type triangles
We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.
The genus statistics of isodensity contours has become a well-established tool in cosmology. In this Letter we place the genus in the wider framework of a complete family of morphological descriptors. These are known as the Minkowski…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpi\'nski graphs. Let $G,H$ be graphs and let $f: V(G) \to V(H)$ be a function. Then the Sierpi\'nski product of $G$ and $H$ with…
In this paper, we explore some significant properties associated with a fractal operator on the space of all continuous functions defined on the Sierpi\'nski Gasket (SG). We also provide some results related to constrained approximation…
Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
The galaxies of nonstandard enlargements of conventionally infinite as well as of transfinite graphs are defined, analyzed, and illustrated by some examples. It is then shown that any such enlargement either has exactly one galaxy, its…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
The Sierpi\'nski product of graphs generalises the vast and relevant class of Sierpi\'nski-type graphs, and is also related to the classic lexicographic product of graphs. Our first main results are necessary and sufficient conditions for…
The classic Sierpinski triangle comprised of conducting bonds is multifractal. Thus the critical exponents and dimensions related to the conductivity are obtained asymptotically--that is, in the limit that the correlation length {\xi} of…
We study the pressure of the "edge-triangle model", which is equivalent to the cumulant generating function of triangles in the Erd\"os-R\'enyi random graph. By analyzing finite graphs of increasing volume, as well as the graphon…
The construction of a Laplacian on a class of fractals which includes the Sierpinski gasket ({\bf $SG$}) has given rise to an intensive research on analysis on fractals. For instance, a complete theory of polynomials and power series on…
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect…
We study semifinite harmonic functions on the zigzag graph, which corresponds to Pieri's rule for the fundamental quasisymmetric functions $\{F_{\lambda}\}$. The main problem, which we solve here, is to classify the indecomposable…
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 extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
Let E be a modular elliptic curve defined over a rational function field k of odd characteristic. We construct a sequence of Heegner points on E, defined over a $Z_p^{\infty}$-tower of finite extensions of k, and show that these Heegner…