Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On families of anticommuting matrices (1412.5893v1)

Published 18 Dec 2014 in cs.CC and math.RT

Abstract: Let $e_{1},\dots, e_{k}$ be complex $n\times n$ matrices such that $e_{i}e_{j}=-e_{j}e_{i}$ whenever $i\not=j$. We conjecture that $\hbox{rk}(e_{1}{2})+\hbox{rk}(e_{2}{2})+\cdots+\hbox{rk}(e_{k}{2})\leq O(n\log n)$, and prove some results in this direction.

Citations (32)

Summary

We haven't generated a summary for this paper yet.