Related papers: Equicontinuous mappings on finite trees
Mean equicontinity is a well studied notion for actions. We propose a definition of mean equicontinuous factor maps that generalizes mean equicontinuity to the relative context. For this we work in the context of countable amenable groups.…
Let X_1 and X_2 be mixing connected algebraic dynamical systems with the Descending Chain Condition. We show that every equivariant continuous map X_1 to X_2 is affine (that is, X_2 is topologically rigid) if and only if the system X_2 has…
We consider $2$-colourings $f : E(G) \rightarrow \{ -1 ,1 \}$ of the edges of a graph $G$ with colours $-1$ and $1$ in $\mathbb{Z}$. A subgraph $H$ of $G$ is said to be a zero-sum subgraph of $G$ under $f$ if $f(H) := \sum_{e\in E(H)} f(e)…
We give an affine proof of Feuerbach's theorem, by constructing an explicit affine map which takes the nine-point circle of any given Euclidean triangle to the incircle and fixes the Feuerbach point. The proof is shown to be valid in any…
Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…
Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…
A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…
A real function $f$ is ward continuous if $f$ preserves quasi-Cauchyness, i.e. $(f(x_{n}))$ is a quasi-Cauchy sequence whenever $(x_{n})$ is quasi-Cauchy; and a subset $E$ of $\textbf{R}$ is quasi-Cauchy compact if any sequence…
Let Pi: M -> B be an onto maximal rank map or a Riemannian submersion between Riemannian manifolds M and B. Initially, we prove necessary and sufficient conditions for any fiber F to be roughly isometric to M. Then, we prove necessary and…
We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…
The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…
Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…
We prove that a continuum $X$ is tree-like (resp. circle-like, chainable) if and only if for each open cover $\U_4=\{U_1,U_2,U_3,U_4\}$ of $X$ there is a $\U_4$-map $f:X\to Y$ onto a tree (resp. onto the circle, onto the interval). A…
This paper investigates conditions under which canonical cofinal maps of the following three types exist: continuous, generated by finitary end-extension preserving maps, and generated by finitary maps. The main theorems prove that every…
We call a tree $T$ is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every $r$-regular nonbipartite connected graph $G$ has a spanning even tree.…
Let $(X,T)$ be a topological dynamical system and $\mu$ be a invariant measure, we show that $(X,\mathcal{B},\mu,T)$ is rigid if and only if there exists some subsequence $A$ of $\mathbb N$ such that $(X,T)$ is $\mu$-$A$-equicontinuous if…
Inspired by recent work of A. Mardani which elaborates on the elementary fact that for any continuous function $f:\omega_1\times\mathbb{R}\to\mathbb{R}$, there is an $\alpha\in\omega_1$ such that $f(\langle\beta,x\rangle) =…
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are…
The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying…
Let $f, g: \mathbb{R}^2 \to \mathbb{R}$ be two submersion functions and $\mathscr{F}(f)$ and $\mathscr{F}(g)$ be the regular foliations of $\mathbb{R}^2$ whose leaves are the connected components of the levels sets of $f$ and $g$,…