39 citations · 182 across the 24 of their papers we have counts for
6 papers · 1 filter
On Boolean sublattices of finite partition lattices
Foldes Stephan, Sandor Radeleczki
We investigate maximal Boolean sublattices of the partition lattice Part(U) of a finite universe U. First, any largest size Boolean sublattice of Part(U) can be formed using all pa…
Defining rough sets using tolerances compatible with an equivalence
Jouni Järvinen, László Kovács, Sándor Radeleczki
We consider tolerances compatible with an equivalence on , meaning that the relational product is included in . We present the essential properties of …
The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence
Stephan Foldes, D. Stott Parker, Sandor Radeleczki
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maxi…
Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets
Jouni Järvinen, Sándor Radeleczki
We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irred…
Interval decomposition lattices are balanced
S. Foldes, S. Radeleczki
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are cha…
A general framework for island systems
Stephan Foldes, Eszter K. Horváth, Sándor Radeleczki +1
The notion of an island defined on a rectangular board is an elementary combinatorial concept that occurred first in [G. Czédli, The number of rectangular islands by means of distr…