Displaying 101 – 120 of 164

Showing per page

On the rank of random subsets of finite affine geometry

Wojciech Kordecki (2000)

Discussiones Mathematicae Graph Theory

The aim of the paper is to give an effective formula for the calculation of the probability that a random subset of an affine geometry AG(r-1,q) has rank r. Tables for the probabilities are given for small ranks. The expected time to the first moment at which a random subset of an affine geometry achieves the rank r is derived.

One-adhesive polymatroids

Laszlo Csirmaz (2020)

Kybernetika

Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized.

Currently displaying 101 – 120 of 164