Sets and posets with inversions
Author(s) -
Árpád Száz
Publication year - 2011
Publication title -
publications de l institut mathematique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1104111s
Subject(s) - semilattice , unary operation , combinatorics , set (abstract data type) , mathematics , discrete mathematics , computer science , semigroup , programming language
We investigate unary operations ∨, ∧ and ♦ on a set X satisfying x = x ∨∨ = x ∧∧ and x ♦ = x ∨∧ = x ∧∨ for all x ∈ X. Moreover, if in particular X is a meet-semilattice, then we also investigate the operations defined by x = x ∧ x ∨ ,x = x ∧ x ∧ ,x = x ∧ x ♦ ; x• = x ∨ ∧ x ∧ ,x ♣ = x ∨ ∧ x ♦ ,x ♠ = x ∧ ∧ x ♦ ; and x = x ∧ x ∨ ∧ x ∧ ∧ x ♦ for all x ∈ X. Our prime example for this is the set-lattice P(U ×V ) of all relations on one group U to another V equipped with the operations defined such that F ∨ (u )= F (−u) ,F ∧ (u )= −F (u )a ndF ♦ (u )= −F (−u) for all F ⊂ U × V and u ∈ U.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom