Monads in computer science can be combined using distributive laws, but finding these laws is tough. A new study introduces two sets of theorems that determine when no distributive law exists for two monads. The first set expands on a known example and covers previous results, while the second set uncovers new situations. This research answers the question of whether the list monad distributes over itself and identifies errors in existing literature.