English
Related papers

Related papers: Wandering continua for rational maps

200 papers

After surveying some known properties of compact convex sets in the plane, we give a two rigorous proofs of the general feeling that supporting lines can be slide-turned slowly and continuously. Targeting a wide readership, our treatment is…

Combinatorics · Mathematics 2016-12-06 Gábor Czédli , László L. Stachó

The propagator is calculated on a noncommutative version of the flat plane and the Lobachevsky plane with and without an extra (euclidean) time parameter. In agreement with the general idea of noncommutative geometry it is found that the…

High Energy Physics - Theory · Physics 2009-10-31 S. Cho , R. Hinterding , J. Madore , H. Steinacker

Any endomorphism of a finitely generated free group naturally descends to an injective endomorphism of its stable quotient. In this paper, we prove a geometric incarnation of this phenomenon: namely, that every expanding irreducible train…

Group Theory · Mathematics 2017-08-31 Spencer Dowdall , Ilya Kapovich , Christopher J. Leininger

Quandles can be regarded as generalizations of symmetric spaces. In the study of symmetric spaces, the notion of flatness plays an important role. In this paper, we define the notion of flat quandles, by referring to the theory of…

Differential Geometry · Mathematics 2015-09-30 Yoshitaka Ishihara , Hiroshi Tamaru

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

Combinatorics · Mathematics 2023-04-27 Agelos Georgakopoulos , Alex Wendland

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…

Combinatorics · Mathematics 2023-04-18 Houshan Fu , Chunming Tang , Suijie Wang

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

Discrete Mathematics · Computer Science 2013-08-06 David White

A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…

chao-dyn · Physics 2009-10-30 Wolfram Just

In this paper we present local Sternberg conjugation theorems near attracting fixed points for lattice systems. The interactions are spatially decaying and are not restricted to finite distance. The conjugations obtained retain the same…

Dynamical Systems · Mathematics 2021-02-24 Ruben Berenguel , Ernest Fontich

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…

Geometric Topology · Mathematics 2013-06-14 José L. Estévez

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

Combinatorics · Mathematics 2019-03-07 Christian Lindorfer , Wolfgang Woess

We prove that a compact simply connected manifold $M$ with a variationally complete $G$-action satisfying certain mild conditions (e.g. trivial principal isotropy, or simply connected principal orbits) is rationally elliptic if and only if…

Differential Geometry · Mathematics 2025-12-30 Ricardo Mendes , Alessandro Minuzzo , Marco Radeschi

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.

Combinatorics · Mathematics 2026-02-11 Jan Kurkofka , Tim Planken

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

Combinatorics · Mathematics 2021-06-22 Tetsuya Hosaka

We show that if $f\colon I\to I$ is piecewise monotone, post-critically finite, and locally eventually onto, then for every point $x\in X=\underleftarrow{\lim}(I,f)$ there exists a planar embedding of $X$ such that $x$ is accessible. In…

General Topology · Mathematics 2020-10-08 Ana Anušić

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

Combinatorics · Mathematics 2025-10-02 Jan Kynčl , Jan Soukup

A Morse 2-function is a generic smooth map from a smooth manifold to a surface. In the absence of definite folds (in which case we say that the Morse 2-function is indefinite), these are natural generalizations of broken (Lefschetz)…

Geometric Topology · Mathematics 2016-01-20 David T. Gay , Robion Kirby

The Lang map, namely the universal dominant rational map to a variety of general type, is constructed and briefly discussed in relation with arithmetic conjectures of Harris, Lang and Manin. Existence of the Lang map follows from the…

alg-geom · Mathematics 2008-02-03 Dan Abramovich

Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…

Dynamical Systems · Mathematics 2015-08-10 Guizhen Cui , Wenjuan Peng , Lei Tan

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

Combinatorics · Mathematics 2021-02-05 Jan Kurkofka , Ruben Melcher , Max Pitz
‹ Prev 1 8 9 10 Next ›