Inequalities for a Pair of Maps S x S ... S with S a Finite Set.
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.
Under every uncountable almost disjoint family is either anti-Luzin or has an uncountable Luzin subfamily. This fails under CH. Related properties are also investigated.