Results 31 to 40 of about 601,015 (329)
A language hierarchy of binary relations
19 pages, 2 figures (Several new examples added)
Brough, Tara, Cain, Alan J.
openaire +3 more sources
On sets with rank one in simple homogeneous structures [PDF]
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
Binary relations in the space of binary relations. I.
This article formulates principles of extension, saturation and convergence, and shows how to implement them. In socio-economic systems, there are "reference groups", with the indicators of which the results of the research and experimentation are compared.
openaire +1 more source
On binary relations without non-identical endomorphisms
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
Quasiuniversal properties of neutron star mergers [PDF]
Binary neutron star mergers are studied using nonlinear 3+1 numerical relativity simulations and the analytical effective-one-body (EOB) model. The EOB model predicts quasiuniversal relations between the mass-rescaled gravitational wave frequency and the
Balmelli, Simone +4 more
core +3 more sources
Fixed Point Theorems for Nonexpansive Mappings under Binary Relations
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
Relation-theoretic metrical coincidence and common fixed point theorems under nonlinear contractions
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
Compressed Data Structures for Binary Relations in Practice
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
Utilizing automatically inferred invariants in graph construction and search [PDF]
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
Binary relations and reduced hypergroups
Let \(H\) be a nonempty set, \(\mathcal P(H)^*\) the family of nonempty subsets of \(H\) and \(\cdot\) a hyperoperation in \(H\), that is, \(\cdot\colon H\times H\to\mathcal P(H)^*\). J. Jantosciak defined three fundamental equivalence relations on any hypergroupoid \((H,\cdot)\) as follows: Let \(x,y\in H\), then (i) \(x\) and \(y\) are said to be ...
Cristea, Irina, Ştefănescu, Mirela
openaire +1 more source

