Binary relation

Summary

In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain. A binary relation over sets X and Y is a new set of ordered pairs (x, y) consisting of elements x in X and y in Y. It is a generalization of the more widely understood idea of a unary function. It encodes the common concept of relation: an element x is related to an element y, if and only if the pair (x, y) belongs to the set of ordered pairs that defines the binary relation. A binary relation is the most studied special case n = 2 of an n-ary relation over sets X1, ..., Xn, which is a subset of the Cartesian product X_1 \times \cdots \times X_n. An example of a binary relation is the "divides" relation over the set of prime numbers \mathbb{P} and the set of integers \mathbb{Z}

Official source

https://en.wikipedia.org/wiki/Binary_relation

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (6)

A Looping-Delooping Adjunction For Topological Spaces

Martina Rovelli

Every principal G-bundle over X is classified up to equivalence by a homotopy class X -> BG, where BG is the classifying space of G. On the other hand, for every nice topological space X Milnor constructed a strict model of its loop space (Omega) over tildeX, that is a group. Moreover, the morphisms of topological groups (Omega) over tildeX -> G generate all the G-bundles over X up to equivalence. In this paper, we show that the relation between Milnor's loop space and the classifying space functor is, in a precise sense, an adjoint pair between based spaces and topological groups in a homotopical context. This proof leads to a classification of principal bundles over a fixed space, that is dual to the classification of bundles with a fixed group. Such a result clarifies the deep relation that exists between the theory of bundles, the classifying space construction and the loop space, which are very important in topological K-theory, group cohomology, and homotopy theory.

Int Press Boston, Inc2017

Computational Design of Weingarten Surfaces

Mark Pauly, Davide Pellis

In this paper we study Weingarten surfaces and explore their potential for fabrication-aware design in freeform architecture. Weingarten surfaces are characterized by a functional relation between their principal curvatures that implicitly defines approximate local congruences on the surface. These symmetries can be exploited to simplify surface paneling of double-curved architectural skins through mold re-use. We present an optimization approach to find a Weingarten surface that is close to a given input design. Leveraging insights from differential geometry, our method aligns curvature isolines of the surface in order to contract the curvature diagram from a 2D region into a 1D curve. The unknown functional curvature relation then emerges as the result of the optimization. We show how a robust and efficient numerical shape approximation method can be implemented using a guided projection approach on a high-order B-spline representation. This algorithm is applied in several design studies to illustrate how Weingarten surfaces define a versatile shape space for fabrication-aware exploration in freeform architecture. Our optimization algorithm provides the first practical tool to compute general Weingarten surfaces with arbitrary curvature relation, thus enabling new investigations into a rich, but as of yet largely unexplored class of surfaces.

ASSOC COMPUTING MACHINERY2021

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Sandro Stucki

The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application conditions (NACs) for arbitrary rule spans; this is a considerable generalisation compared with existing results for NACs, which only hold for linear rules (w.r.t. a suitable class of monos). Besides this main contribution, namely an adapted shifting construction for NACs, the paper presents a uniform commutativity result for a revised notion of independence that applies to arbitrary rules; these theorems hold in any category with (enough) stable pushouts and a class of monos rendering it weak adhesive HLR. To illustrate results and concepts, we use simple graphs, i.e. the category of binary endorelations and relation preserving functions, as it is a paradigmatic example of a category with stable pushouts; moreover, using regular monos to give semantics to NACs, we can shift NACs over arbitrary rule spans.

Springer2014

Related people

No results

Related units

No results

Related concepts (89)

Partially ordered set

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not eve

Order theory

Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that

Equivalence relation

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equiva

Related courses (42)

MATH-101(g): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, discrete structures & algorithmic thinking.

MATH-101(f): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.

Related lectures (119)

Semaine 2 - Jeudi - AB

MATH-101(g): Analysis I

cours

MATH-101(f): Analysis I

Week 4: Recording 4 (Sets and Functions)

CS-101: Advanced information, computation, communication I