相关论文: Horofunctions on Sierpi\'nski type triangles
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
In this work we consider infinite dimensional extensions of some finite dimensional Gaussian geometric functionals called the Gaussian Minkowski functionals. These functionals appear as coefficients in the probability content of a tube…
Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…
The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
A set $\mathcal{S}$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x,x^\sigma)$ for $x\in V$ and $\sigma\in\mathcal{S}$. We address the problem of characterising those…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain…
Consider an infinite tree. A hierarchomorphism (spheromorphism) is a homeomorphism of the absolute which can be extended to the tree except a finite subtree. Examples of groups of hierarchomorphisms: groups of locally analitic…
We give positive answer to a conjecture by Agranovsky. A continuous function on the sphere which has separate holomorphic extension along the set of complex lines passing through three non aligned interior points, is the trace of a…
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…
In \cite{Ch91a} it was shown that the billiard ball map for the periodic Lorentz gas has infinite topological entropy. In this article we study the set of points with infinite Lyapunov exponents. Using the cell structure developed in…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
For each natural number n, we construct an example of a graph manifold supporting at least n different Anosov flows that are not orbit equivalent. Our construction is reminiscent of the Thurston-Handel construction: we cut a geodesic flow…
We introduce a parametrization of the conjugates of Christoffel words based on the integer Ostrowski numeration system. We use it to give a precise description of the borders (prefixes which are also suffixes) of the conjugates of…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
The dominant rational maps of finite degree from a fixed variety to varieties of general type, up to birational isomorphisms, form a finite set. This has been known as the Iitaka-Severi conjecture, and is nowdays an established result, in…
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…