English
Related papers

Related papers: On multivaled fixed-point free maps on R^n

200 papers

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

General Topology · Mathematics 2018-01-22 I. Juhász , J. van Mill

A field $k$ is called large if every irreducible $k$-curve with a $k$-rational smooth point has infinitely many $k$-points. Let $k$ be a perfect large field and let $f \in k[x]$. Consider the evaluation map $f_k: k \to k$. Assume that $f_k$…

Number Theory · Mathematics 2014-04-17 Michiel Kosters

This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…

Dynamical Systems · Mathematics 2016-12-12 David J. W. Simpson

Let $f \colon X \rightarrow Y$ be a resolvable-measurable mapping of a metrizable space $X$ to a regular space $Y$. Then $f$ is piecewise continuous. Additionally, for a metrizable completely Baire space $X$, it is proved that $f$ is…

General Topology · Mathematics 2016-08-03 Sergey Medvedev

We consider bounded 2-metric spaces satisfying an additional axiom, and show that a contractive mapping has either a fixed point or a fixed line.

Metric Geometry · Mathematics 2011-04-08 Abdelkrim Aliouche , Carlos T. Simpson

A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free…

Combinatorics · Mathematics 2016-10-24 Henning Bruhn , Elke Fuchs

An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…

Combinatorics · Mathematics 2020-05-11 Florian Lehner , Monika Pilśniak , Marcin Stawiski

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

Combinatorics · Mathematics 2019-09-17 Georg Grasegger , Jan Legerský , Josef Schicho

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

A colouring of a graph G is called distinguishing if its stabiliser in Aut G is trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing…

Combinatorics · Mathematics 2013-04-25 Florian Lehner

We characterize those complete commutative positive linear ordered monoids $W$ such that whenever $f$ is a map from a Cauchy complete $W$-metric space to itself, the existence of a fixed point of $f$ is independent of the background model…

General Topology · Mathematics 2025-04-15 Nathanael Ackerman , Mostafa Mirabi

An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…

Data Structures and Algorithms · Computer Science 2015-09-29 Christoph Berkholz , Paul Bonsma , Martin Grohe

An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of…

Combinatorics · Mathematics 2015-07-03 I. Javaid , M. Murtaza , M. Asif , F. Iftikhar

This paper concerns analytic free maps. These maps are free analogs of classical analytic functions in several complex variables, and are defined in terms of non-commuting variables amongst which there are no relations - they are free…

Functional Analysis · Mathematics 2011-04-19 J. William Helton , Igor Klep , Scott McCullough

A coloring is called $s$-wide if no walk of length $2s-1$ connects vertices of the same color. A graph is $s$-widely colorable with $t$ colors if and only if it admits a homomorphism into a universal graph $W(s,t)$. Tardif observed that the…

Combinatorics · Mathematics 2021-02-08 Anna Gujgiczer , Gábor Simonyi

The paper discusses the conditions for the existence of fixed points of multivalued mappings that are not based on the linear structure of the set. The descriptions for the sets of fixed points for mappings with closed graph in compact…

General Topology · Mathematics 2016-02-23 Dmitrii Serkov

A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…

Group Theory · Mathematics 2012-03-13 Pedro V. Silva

Consider the self-map F of the space of real-valued test functions on the line which takes a test function f to the test function sending a real number x to f(f(x))-f(0). We show that F is discontinuous, although its restriction to the…

General Topology · Mathematics 2007-05-23 Helge Glockner

If $X$ is a topological space and $Y$ is any set then we call a family $\mathcal{F}$ of maps from $X$ to $Y$ nowhere constant if for every non-empty open set $U$ in $X$ there is $f \in \mathcal{F}$ with $|f[U]| > 1$, i.e. $f$ is not…

General Topology · Mathematics 2023-12-20 István Juhász , Jan van Mill

In this article, we consider Kannan type contractive self-map $T$ on a metric space $(X,d)$ such that \[d(Tx,Ty)<\frac{1}{2}\{d(x,Tx)+d(y,Ty)\} \mbox{ for all } x \neq y \in X, \] and establish some new fixed point results without taking…

Functional Analysis · Mathematics 2017-07-21 Hiranmoy Garai , Tanusri Senapati , Lakshmi Kanta Dey