English
Related papers

Related papers: Periodic point theorem for generalized graphic con…

200 papers

We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…

Dynamical Systems · Mathematics 2025-11-05 Meng Li

For any $C\in[0,\infty]$ a compact group automorphism $T:X\to X$ is constructed with the property that $$ \frac{1}{n}\log|\{x\in X\mid T^n(x)=x\}|\longrightarrow C. $$ This may be interpreted as a combinatorial analogue of the (still open)…

Dynamical Systems · Mathematics 2007-05-23 Thomas Ward

Graphical domination was first introduced in [1] in the context of combinatorial threshold-linear networks (CTLNs). There it was shown that when a domination relationship exists between a pair of vertices in a graph, certain fixed points in…

Neurons and Cognition · Quantitative Biology 2025-10-07 Carina Curto

Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…

Combinatorics · Mathematics 2023-08-09 Talat Nazir , Zakaria Ali , Shahin Nosrat Jogan , Sergei Silvestrov

In this paper we establish some common fixed point theorem for a new class of pair of contractions mappings, called $\psi-(\alpha,\beta, m)$-contraction pairs, which we will assume occasionally weakly compatible and satisfying the property…

Functional Analysis · Mathematics 2013-07-17 J. R. Morales , E. M. Rojas

We establish explicit unconditional results on the graphic properties of the prime gap sequence. Let $p_n$ denote the $n$-th prime number (with $p_0=1$) and $\mathrm{PD}_n = (p_\ell - p_{\ell-1})_{\ell=1}^n$ be the sequence of the first $n$…

Number Theory · Mathematics 2026-01-16 Keshav Aggarwal , Robin Frot , Haozhe Gou , Hui Wang

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

Combinatorics · Mathematics 2015-01-29 Pierre Aboulker , Guillaume Lagarde , David Malec , Abhishek Methuku , Casey Tompkins

We focus on the new type perturbed metric spaces and introduce a contraction mapping namely new type perturbed Kannan mappings. For these mappings, we show that Banach's fixed point theorem holds. Moreover, this new generalization of…

General Mathematics · Mathematics 2025-05-30 Bekir Danış

We establish three major fixed-point theorems for functions satisfying an odd power type contractive condition in G-metric spaces. We first consider the case of a single mapping, followed by that of a triplet of mappings and we conclude by…

General Topology · Mathematics 2017-09-25 Yaé Ulrich Gaba , Collins Amburo Agyingi

In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…

Functional Analysis · Mathematics 2021-12-09 Abhik Digar , G. S. Raju K

An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $\alpha \to \beta$ if and only if $f(\alpha)…

Number Theory · Mathematics 2021-08-12 John R. Doyle

A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…

Dynamical Systems · Mathematics 2020-01-08 Benito Pires

The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…

Combinatorics · Mathematics 2008-02-25 Stephan Hell

Let $X$ be a metric space. Recently in~[1] it was considered a new type of mappings $T\colon X\to X$ which can be characterized as mappings contracting perimeters of triangles. These mappings are defined by the condition based on the…

General Topology · Mathematics 2025-02-28 Christian Bey , Evgeniy Petrov , Ruslan Salimov

In this paper, with a view to improve the g-monotonicity condition, we introduce the notion of g-comparability of a mapping defined on an ordered set and utilize the same to prove some existence and uniqueness results on coincidence points…

General Topology · Mathematics 2015-08-03 Aftab Alam , Mohammad Imdad

A self-map $T$ of a $\nu$-generalized metric space $(X,d\,)$ is said to be a Ciric-Matkowski contraction if $d(Tx,Ty)<d(x,y)$, for $x\neq y$, and, for every $\epsilon>0$, there is $\delta>0$ such that $d(x,y)<\delta+\epsilon$ implies…

General Topology · Mathematics 2015-06-01 Mortaza Abtahi

The paper is devoted to the fixed point theory in four aspects: of contractions, nonexpansive mappings, generalized inward mappings, and of the tool theorems. The manuscript was written about ten years ago. At first Nadler's concept of…

General Topology · Mathematics 2021-04-27 Lech Pasicki

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at…

Metric Geometry · Mathematics 2015-10-02 Imre Barany , Andreas F. Holmsen , Roman Karasev

The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…

Data Structures and Algorithms · Computer Science 2024-03-12 R. Krithika , V. K. Kutty Malu , Prafullkumar Tale