加载中…
In this note, we give two different proofs that relation algebra is representable over a finite set. The first is probabilistic, and uses Johnson schemes. The second is an explicit group representation over . We also give a finite representation of over using a technique due to Comer.

生成讲解博客的中文版本

生成AI智能校验的中文版本