Related papers: Equicontinuous mappings on finite trees

The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

We present some sufficient conditions for continuity of the mapping $f:\langle X,\tau_X^*\rangle \to \langle Y,\tau_Y^*\rangle$, where $\tau_X^*$ and $\tau_Y^*$ are topologies induced by the local function on $X$ and $Y$, resp. under the…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…

For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erd\H{o}s, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining…

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

A sufficient condition is established for the existence of a solution to the equation $\mathcal{T}(u,\mathcal{C}(u))=u$, by considering a class of Kannan type equicontraction mappings $\mathcal{T}:\mathcal{A}\times…

Suppose that $f: D\to D'$ is a quasiconformal mapping, where $D$ and $D'$ are domains in ${\mathbb R}^n$, and that $D$ is a broad domain. Then for every arcwise connected subset $A$ in $D$, the weak quasisymmetry of the restriction $f|_A:…

A half-tree is an edge configuration whose superimposition with a perfect matching is a tree. In this paper, we prove a half-tree theorem for the Pfaffian principal minors of a skew-symmetric matrix whose column sum is zero; introducing an…

Let $X$ and $Y$ be completely regular spaces and $E$ and $F$ be Hausdorff topological vector spaces. We call a linear map $T$ from a subspace of $C(X,E)$ into $C(Y,F)$ a \emph{Banach-Stone map} if it has the form $Tf(y) = S_{y}(f(h(y))$ for…

Given two non-empty graphs $H$ and $T$, write $H\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\cdot,\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient…

Given a symmetric Dirichlet form $(\mathcal{E},\mathcal{F})$ on a (non-trivial) $\sigma$-finite measure space $(E,\mathcal{B},m)$ with associated Markovian semigroup $\{T_{t}\}_{t\in(0,\infty)}$, we prove that $(\mathcal{E},\mathcal{F})$ is…

Let $\phi(x,y)$ be a continuous function, smooth away from the diagonal, such that, for some $\alpha>0$, the associated generalized Radon transforms \begin{equation} \label{Radon} R_t^{\phi}f(x)=\int_{\phi(x,y)=t} f(y) \psi(y)…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$,…

We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…

We prove that if E a subset of an n-dimensional manifold, then every continuous R^n-valued map on E that is zero-free on the interior of E can be approximated in the fine topology, and hence, in particular, in the uniform topology, by a…

We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…