3 citations · 13 across the 17 of their papers we have counts for
6 papers · 2 filters
On the polyhedral cones of convex and concave vectors
Stephan Foldes, Laszlo Major
Convex or concave sequences of positive terms, viewed as vectors in -space, constitute convex cones with and extreme rays, respectively. Explicit description is g…
On distances and metrics in discrete ordered sets
Stephan Foldes
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the di…
On the imbalance lattice of path-length sequences of binary trees
S. Foldes, R. Radeleczki
The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater a…
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…
The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes
Stephan Foldes
The set of all uniquely decipherable (UD) codes is partially ordered by refinement, meaning that all strings in the cruder code can be represented as concatenations of strings take…
Huffman coding as an algorithm to construct chains in partition lattices
Stephan Foldes
The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree ord…