Related papers: Set mappings on 4-tuples
In this paper we study the action of the fundamental group of a finite metric graph on its universal covering tree. We assume the graph is finite, connected and the degree of each vertex is at least three. Further, we assume an…
New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.
The aim of this paper is to construct a fractal with the help of a finite family of generalized F-contraction mappings, a class of mappings more general than contraction mappings, defined in the setup of b-metric space. Consequently, we…
Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…
We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about preservation of certain type of unbounded…
This work presents a generalized notion of multiset mapping thus resolving a long standing obstacle in structural study of multiset processing. It has been shown that the mapping defined herein can model a vast array of notions as special…
The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…
We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous. The fixed-point theorem for such mappings is proved and the…
Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matching of $G$. This notion originally arose in chemistry in…
A $4$-general set in ${\rm PG}(n,q)$ is a set of points of ${\rm PG}(n,q)$ spanning the whole ${\rm PG}(n,q)$ and such that no four of them are on a plane. Such a pointset is said to be complete if it is not contained in a larger…
The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…
Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…
We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…
In this paper we give some coupled fixed point results for mappings satisfying different contractive conditions on complete partial metric spaces.
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…