Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (printed pp. 1--2). For a primitive -th root of unity , the cyclotomic matroid of order , , is the matroid on the vectors of the -vector space ; its rank is . For a -dimensional simplicial complex with and exactly facets, the simplicial matroid is the matroid on the facets represented over by the columns of the boundary map . The complex is the simplicial join of -dimensional complexes , where consists of disjoint vertices; a face takes at most one vertex from each . The dual of a matroid is the matroid whose bases are the complements of the bases of (p. 1).
Theorem 1 (printed p. 2). "Let , with distinct primes and positive integers.
Then the following two matroids representable over are dual:
- The cyclotomic matroid .
- The direct sum of copies of ."
The two ground sets both have elements: has facets, one for each choice of a vertex from every , and the direct sum has copies of it. The statement leaves the matching of the ground sets implicit; the proof (pp. 3--4) makes it by splitting into blocks, each a copy of , and, for square-free , through the Chinese Remainder Theorem, which matches a facet, one residue modulo each , with the root whose exponent has those residues. This is a filing observation, not a review verdict.
Consequences recorded in the paper. Remark 6 (p. 5): if is divisible by at most two primes, the complex is a graph, the complete bipartite graph (p. 3), and is cographic; if is odd, is the parallel extension of with one parallel copy of each ground-set element, so that for odd primes the matroid is the cographic matroid of the graph obtained from by doubling every edge. Remark 5 (p. 5) records, citing Johnsen, that the primitive -th roots of unity form a -basis of if and only if is square-free, and identifies the corresponding basis of the simplicial matroid for square-free as a union of vertex stars, a contractible complex.
Source. Jeremy L. Martin and Victor Reiner, "Cyclotomic and simplicial matroids," arXiv:math/0402206v1 (2004), published in Israel J. Math. 150 (2005), 229--240; Theorem 1 on printed p. 2 of the arXiv preprint. Labels and pages here are the preprint's; the edition read is identified in the source digest.
Read depth. Claims checked: the definitions (pp. 1--2), Theorem 1, Lemma 3 (p. 3) and Remarks 5 and 6 (p. 5) were read clause by clause on the page images of the preprint. The proof (pp. 3--4) was read for structure only; nothing here is independently reviewed.
Proof pointer
§ 2, pp. 3--4. Lemma 3 (p. 3) says that a matroid whose ground set splits into parts whose restricted ranks add up to the full rank is the direct sum of the restrictions. With and , the sets , , partition , each restriction is isomorphic to , and , so is the direct sum of copies of . Since duality commutes with direct sums, it remains to treat square-free . There the tensor product over the primes of the two-term complexes is the augmented cochain complex of the join ; by the Künneth formula it is exact except at the top, where the Chinese Remainder Theorem identifies the map onto the top cohomology with , . So the last coboundary spans the kernel of that map, and its transpose, whose columns represent the simplicial matroid, represents the dual of .
Dependencies
Lemma 3 (p. 3), which the paper calls a well-known general fact; the Künneth formula over and the Chinese Remainder Theorem. Remark 5 cites K. Johnsen, Lineare Abhängigkeiten von Einheitswurzeln, Elem. Math. 40 (1985), 57--59, which has no library card.
Bears on
- Problem 774: indirectly. The circuits of are the minimal rational linear relations among the -th roots of unity; as circuits of a matroid are the complements of the hyperplanes of its dual, the theorem identifies them with complements of hyperplanes of the direct sum of simplicial matroids, which for with two distinct prime factors are the minimal edge cuts of a copy of (Remark 6). A -linearly independent set of roots of unity is dissociated, but dissociation forbids only relations with coefficients in , so this dictionary describes a stronger condition. The theorem concerns roots of unity, not subsets of the natural numbers, and proves nothing about dissociated or proportionately dissociated sets.