04.04.2011

We study the notion of matchings in homogeneous and antisymmetric m-schemes, as defined in Ivanyos, Karpinski & Saxena (2009). We give a general conjecture which involves the existence of matchings in homogeneous and antisymmetric m-schemes and prove certain special cases of it. Our results, as part of the general topic of matchings in m-schemes, are closely related to the deterministic time complexity of polynomial factoring over finite fields.