Related papers: Horofunctions on Sierpi\'nski type triangles

Many limits are known for hypergeometric orthogonal polynomials that occur in the Askey scheme. We show how asymptotic representations can be derived by using the generating functions of the polynomials. For example, we discuss the…

We prove that there exists a scrambled set for the Gauss map with full Hausdorff dimension. Meanwhile, we also investigate the topological properties of the sets of points with dense or non-dense orbits.

We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this we define relative digraph homotopy groups and show these satisfy a long exact sequence analogous to the relative homotopy groups…

A problem from thermodynamic formalism for countable symbolic Markov chains is considered. It concerns asymptotic behavior of the equilibrium measures corresponding to increasing sequences of finite sub-matrices of an infinite nonnegative…

We classify finite-dimensional Hopf algebras whose coradical is isomorphic to the algebra of functions on S_3. We describe a new infinite family of Hopf algebras of dimension 72.

We determine the set of Busemann points of an arbitrary finite-dimensional normed space. These are the points of the horofunction boundary that are the limits of "almost-geodesics". We prove that all points in the horofunction boundary are…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

We consider certain Dirichlet series of Selberg type, constructed from periods of automorphic forms. We study analytic properties of these Dirichlet series and show that they have analytic continuation to the whole complex plane.

The theoretical and numerical understanding of the key concept of topological entropy is an important problem in dynamical systems. Most studies have been carried out on maps (discrete-time systems). We analyse a scenario of global changes…

We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…

Let M be a geometrically finite pinched negatively curved Riemannian manifold with at least one cusp. We study the asymptotics of the number of geodesics in M starting from and returning to a given cusp, and of the number of horoballs at…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$. A…

We prove that the infinitely generated Apollonian gasket has full Hausdorff dimension spectrum. Our proof, which is computer assisted, relies on an iterative technique introduced by the first three authors in [3] and on a flexible method…

In this paper, we construct a new unpredictable function. Our approach is based on adapting the concept of symbolic dynamics to introduce a map on the space of infinite sequences generated by the discrete distribution. We show that there…

We study the convexity of the entropy functional along particular interpolating curves defined on the space of finitely supported probability measures on a graph.

We investigate the interpretability ordering $\trianglelefteq^*$ using generalized Ehrenfeucht-Mostowski models. This gives a new approach to proving inequalities and investigating the structure of types.

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…