Related papers: Equicontinuous mappings on finite trees

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

For M and N closed oriented connected smooth manifolds of the same dimension, we consider the mapping space Map(M,N;f) of continuous maps homotopic to f:M--> N.We show that the evaluation map from the space of maps to the manifold N induces…

An $(s,t)$-matching in a bipartite graph $G=(U,V,E)$ is a subset of the edges $F$ such that each component of $G[F]$ is a tree with at most $t$ edges and each vertex in $U$ has $s$ neighbours in $G[H]$. We give sharp conditions for a…

Let $X$ be a topological space and $f:X\to X$ a bijection. Let ${\mathcal C}(X,f)$ be a set of integers such that an integer $n$ is an element of ${\mathcal C}(X,f)$ if and only if the bijection $f^n:X\to X$ is continuous. A subset $S$ of…

Let $(X,\mathcal{B},\mu,T)$ be a measure preserving system. We say that a function $f\in L^2(X,\mu)$ is $\mu$-mean equicontinuous if for any $\epsilon>0$ there is $k\in \mathbb{N}$ and measurable sets ${A_1,A_2,\cdots,A_k}$ with…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…

We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…

When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded ``tree-length''. We will show that this is…

We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that for every…

Folkman's theorem asserts the existence of graphs $G$ which are $K_4$-free, but which have the property that every two-coloring of $E(G)$ contains a monochromatic triangle. The quantitative aspects of $f(2,3,4)$, the least $n$ such that…

A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…

We consider discrete dynamical systems whose phase spaces are compact metrizable countable spaces. In the first part of the article, we study some properties that guarantee the continuity of all functions of the corresponding Ellis…

For every connected manifold with corners we use a homology theory called conormal homology, defined in terms of faces and incidences and whose cycles correspond geometrically to corner's cycles. Its Euler characteristic (over the…

In this paper, we prove that the class of bi-f-harmonic maps and that of f-biharmonic maps from a conformal manifold of dimension not equal to 2 are the same (Theorem 1.1). We also give several results on nonexistence of proper…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Our main result concerns the behavior of bounded harmonic functions on a domain in $\mathbb{R}^N$ which may be represented as a strict epigraph of a Lipschitz function on $\mathbb{R}^{N-1}$. Generally speaking, the result says that the…

Consider the sub-Riemannian Heisenberg group $\mathbb{H}$. In this paper, we answer the following question: given a compact set $K \subseteq \mathbb{R}$ and a continuous map $f:K \to \mathbb{H}$, when is there a horizontal $C^m$ curve…

We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…

We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…

A continous map $f: \mathbb{C}^n \rightarrow \mathbb{C}^N$ is $k$-regular if the image of any $k$ points spans a $k$-dimensional subspace. It is an important problem in topology and interpolation theory, going back to Borsuk and Chebyshev,…