3 citations · 13 across the 17 of their papers we have counts for
26 papers
Antichain cutsets in real-ranked lattices
Stephan Foldes, Russ Woodroofe
We show that in a rank supersolvable lattice that is graded by a bounded real interval, any antichain cutset is a level set for some appropriately constructed grading. As a consequ…
A modular characterization of supersolvable lattices
Stephan Foldes, Russ Woodroofe
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having…
Packing of permutations into Latin squares
Stephan Foldes, András Kaszanyitzky, Laszlo Major
For every positive integer greater than there is a set of Latin squares of order such that every permutation of the numbers appears exactly once as a row,…
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…
Log-concavity of rows of Pascal type triangles
Stephan Foldes, Laszlo Major
Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of t…
Arrow type impossibility theorems over median algebras
Miguel Couceiro, Stephan Foldes, Gerasimos C. Meletiou
We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that…