English
Related papers

Related papers: Equicontinuity of maps on dendrites

200 papers

We prove that for any nondegenerate dendrite $D$ there exist topologically mixing maps $F : D \to D$ and $f : [0, 1] \to [0, 1]$, such that the natural extensions (aka shift homeomorphisms) $\sigma_F$ and $\sigma_f$ are conjugate, and…

Dynamical Systems · Mathematics 2021-10-25 J. Boroński , P. Minc , S. Štimac

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

Dynamical Systems · Mathematics 2022-04-20 Guizhen Cui , Yan Gao , Jinsong Zeng

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

For a graph $G$ with $n$ vertices, let $\nu(G)$ and $A(G)$ denote the matching number and adjacency matrix of $G$, respectively. The permanental polynomial of $G$ is defined as $\pi(G,x)={\rm per}(Ix-A(G))$. The permanental nullity of $G$,…

Combinatorics · Mathematics 2016-03-11 Tingzeng Wu , Hong-Jian Lai

An {\em orthomorphism} over a finite field $\mathbb{F}$ is a permutation $\theta:\mathbb{F}\mapsto\mathbb{F}$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}$. The orthomorphism $\theta$ is {\em cyclotomic of…

Combinatorics · Mathematics 2021-01-05 David Fear , Ian M. Wanless

Let K be a a Lie group, modeled on a locally convex space, and M a finite-dimensional paracompact manifold with corners. We show that each continuous principal K-bundle over M is continuously equivalent to a smooth one and that two smooth…

Differential Geometry · Mathematics 2012-06-29 Christoph Müller , Christoph Wockel

In this paper, we show that, under some technical assumptions, the Kolmogorov-Sinai entropy and the permutation entropy are equal for one-dimensional maps if there exists a countable partition of the domain of definition into intervals such…

Dynamical Systems · Mathematics 2018-08-03 Tim Gutjahr , Karsten Keller

It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…

Combinatorics · Mathematics 2007-05-23 Anton Dochtermann

We prove that under the natural assumption over the dynamical degrees, the saddle periodic points of a H\'enon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of results of…

Dynamical Systems · Mathematics 2025-02-28 Muhan Luo , Qi Zhou

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin , Mihai Tibar

Our main result states that every fixed-point free continuous self-map of ${\mathbb R}^{n}$ is colorable. This result can be re-formulated as follows: A continuous map $f: {\mathbb R}^{n}\to {\mathbb R}^{n}$ is fixed-point free iff…

General Topology · Mathematics 2010-11-24 R. Z. Bouziakova , A. Chigogidze

Let $X$ be a zero-dimensional locally compact Hausdorff space not necessarily metric and $G$ a compactly generated topological group not necessarily abelian or countable. We define recurrence at a point for any continuous action of $G$ on…

Dynamical Systems · Mathematics 2022-03-17 Xiongping Dai

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

Combinatorics · Mathematics 2025-11-06 Paul Bastide , Julien Duron , Jędrzej Hodor , Weichan Liu , Xiangxiang Nie

For any composant $E \subset \mathbb H^*$ and corresponding near-coherence class $\mathscr E \subset \omega^*$ we prove the following are equivalent : (1) $E$ properly contains a dense semicontinuum. (2) Each countable subset of $E$ is…

General Topology · Mathematics 2020-07-21 Daron Anderson

The author shows that equicontinuous geodesic flows on surfaces are periodic. A similar result for flows on 3-manifolds is also proven. The idea of the proof is to show that the return map is recurrent and therefore periodic.

Dynamical Systems · Mathematics 2007-10-23 Christian Pries

A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…

Statistical Mechanics · Physics 2007-05-23 Vladimir Gudkov , Shmuel Nussinov

Let $C(X,E)$ be the linear space of all continuous functions on a compact Hausdorff space $X$ with values in a locally convex space $E$. We characterize maps $T:C(X,E)\to C(Y,E)$ which satisfy $\mathrm{Ran}(TF-TG)\subset\mathrm{Ran}(F-G)$…

Functional Analysis · Mathematics 2019-10-18 Yuta Enami

Two flows on a finite-dimensional normed space $X$ are equivalent if some homeomorphism $h$ of $X$ preserves all orbits, i.e., $h$ maps each orbit onto an orbit. Under the assumption that $h$, $h^{-1}$ both are $\beta$-H\"{o}lder continuous…

Dynamical Systems · Mathematics 2025-11-05 Arno Berger , Anthony Wynne

Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\lambda\in…

Combinatorics · Mathematics 2026-05-14 Paola Bonacini , Lucia Marino

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…

Combinatorics · Mathematics 2013-01-01 Robert Šámal
‹ Prev 1 4 5 6 7 8 10 Next ›