Related papers: Set mappings on 4-tuples
In this paper, we first discussed multiplicative metric mapping by giving some topological properties of the relevant multiplicative metric space. As an interesting result of our discussions, we observed that the set of positive real…
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…
We develop a method for generating degree-of-freedom maps for arbitrary order finite element spaces for any cell shape. The approach is based on the composition of permutations and transformations by cell sub-entity. Current approaches to…
The zero forcing number was introduced as a combinatorial bound on the maximum nullity taken over the set of real symmetric matrices that respect the pattern of an underlying graph. The $Z_q$-forcing game is an analog to the standard zero…
We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…
In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…
For various quadruple systems F, we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our results extend those of Furedi, Keevash, Pikhurko, Simonovits…
We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…
This paper establishes new common fixed point theorems for weakly compatible mappings in metric spaces, relaxing traditional requirements such as continuity, compatibility, and reciprocal continuity. We present a unified framework for three…
Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…
In this paper, we study the existence of fixed points for mappings defined on complete, (sequentially compact) cone metric spaces, satisfying a general contractive inequality depending of two additional mappings.
Among other results, the paper gives new mapping theorems and new fixed point property theorems for inverse limits of inverse sequences of compact metric spaces with upper semicontinuous set-valued bonding functions. We also revisit the…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which…
We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…
In the current practices of both industry and academia, the convergence and accuracy of finite element calculations are closely related to the methods and quality of mesh generation. For years, the research on high-quality mesh generation…
We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over $L$, every analytic hypergraph on a Polish space admits a $\mathbf{\Delta}^1_2$ maximal independent set. As a main…
The 4-simplex equation is a higher-dimensional analogue of Zamolodchikov's tetrahedron equation and the Yang--Baxter equation which are two of the most fundamental equations of mathematical physics. In this paper, we introduce a method for…