Related papers: Set mappings on 4-tuples
We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.
It is consistent that there is a set mapping from the four-tuples of omega_n into the finite subsets with no free subsets of size t_n for some natural number t_n. For any n< omega it is consistent that there is a set mapping from the pairs…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
In this paper, we study hyperbolic rational maps with finitely connected Fatou sets. We construct models of post-critically finite hyperbolic tree mapping schemes for such maps, generalizing post-critically finite rational maps in the case…
In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…
This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal…
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…
We generalize the results of Sehgal and Guseman for mappings on a complete metric space with a contractive iterate condition at each point.
In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
In this paper, we present a novel concept of the Fenchel conjugate for set-valued mappings and investigate its properties in finite and infinite dimensions. After establishing the fundamental properties of the Fenchel conjugate for…
In this paper, we shall show that some coincidence point and common fixed point results for three or four mappings could easily be obtained from the corresponding fixed point results for two mappings.
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
We investigate the norms appearing in the forcing from combinatorial point of view. We make first steps towards building a catalog of the norms appearing in multiple settings and sources, reviewing four norms from Bartoszy\'nski and Judah…