Results 51 to 60 of about 2,902,153 (358)
On sets with rank one in simple homogeneous structures [PDF]
, 2014 We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits all relations
Ahlman, Ove, Koponen, Vera
core +1 more source
On binary relations without non-identical endomorphisms
, 2000 On every set A there is a rigid binary relation, i.e. such a relation R that there is no homomorphism (A,R)->(A,R) except the identity (Vopenka et al. [1965]). We state two conjectures which strengthen this theorem.
Tyszka, Apoloniusz
core +1 more source
Compressed Data Structures for Binary Relations in Practice
IEEE Access, 2020 Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent binary relations in compact space, such ...
Carlos Quijada Fuentes +3 more
doaj +1 more source
Fixed Point Theorems for Nonexpansive Mappings under Binary Relations
Mathematics, 2021 In the present article, we establish relation-theoretic fixed point theorems in a Banach space, satisfying the Opial condition, using the R-Krasnoselskii sequence. We observe that graphical versions (Fixed Point Theory Appl.
Aftab Alam +3 more
doaj +1 more source
Operations on binary relations
Discrete Mathematics, 1978 AbstractThe effects of five basic operations (asymmetrization, complementation, dualization, symmetrization, transitive closure) on binary relations are examined. Identifies between compound operations are developed (e.g. the symmetric part of the transitive closure of the complement of the transitive closure equals the transitive closure of the ...
openaire +2 more sources
Relation-theoretic metrical coincidence and common fixed point theorems under nonlinear contractions
Applied General Topology, 2018 In this paper, we prove coincidence and common fixed points results under nonlinear contractions on a metric space equipped with an arbitrary binary relation.
Md Ahmadullah +2 more
doaj +1 more source
Topological Structures on Vertex Set of Digraphs
مجلة بغداد للعلوم, 2023 Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation on a set can always be represented by a digraph. Topology on a set can be generated by binary relations on the set .
K. Lalithambigai, P. Gnanachandra
doaj +1 more source
Utilizing automatically inferred invariants in graph construction and search [PDF]
, 2000 In this paper we explore the relative importance of persistent and non-persistent mutex relations in the performance of Graphplan- based planners. We also show the advantages of pre-compiling persistent mutex relations. Using TIM we are able to generate,
Fox, Maria, Long, Derek
core +1 more source
Duality between erasures and defects
, 2016 We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the ...
Kim, Yongjune, Kumar, B. V. K. Vijaya
core +1 more source
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source