English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Etant donnee une relation binaire R, de base E, on definit sa duale RB par RB(x, y) = R(y, x). La relation R est dite auto-duale si elle est isomorphe a RB. Une relation binaire R0 est hemimorphe a R, si elle est isomorphe a R ou a RB. Une relation binaire a n elements est (−k)-demi-reconstructible, si elle est determinee a l’hemimorphie pres, par la donnee a l’hemimorphie pres de ses restrictions de cardinal (n − k). L’etude faite en [8] entraine la (-d)- demi-reconstructibilite des relations binaires finies pour tout d ≥ 12. Nous etabissons la (−d)-demi-reconstructibilite des relations binaires finies pour tout d ∈ {11, 10, 9, 8, 7, 6}. Given a binary relation R of basis E, we define its dual RB by RB(x, y) = R(y, x). A relation R is self-dual if it is isomorphic to RB. A binary relation R0 is hemimorphic to R, if it is isomorphic to R or to RB. A relation R defined on n elements is (−k)- half - reconstructible if it is determined, up to hemimorphism, by its restrictions of cardinality (n − k). From [8] follows the (−d)-halfreconstructibility of finite binary relations, for all d ≥ 12. We establish the (−d)-half-reconstructibility of finite binary relations, for all d ∈ {11, 10, 9, 8, 7, 6}.

LE SEUIL DE RECONSTRUCTIBILITÉ PAR LE HAUT MODULO LA DUALITÉ DES RELATIONS BINAIRES FINIES