A remark on the Chebotarev theorem about roots of unity
F. Pakovich

TL;DR
This paper explores an extension of Chebotarev's theorem, which originally states that all minors of a specific matrix are non-zero for prime n, to the case where n is composite, providing new insights into the structure of such matrices.
Contribution
The paper offers a novel analogue of Chebotarev's theorem applicable to composite integers n, expanding understanding beyond the prime case.
Findings
Established conditions under which minors of the matrix are non-zero for composite n
Extended Chebotarev's theorem to composite n cases
Provided theoretical framework for analyzing roots of unity matrices
Abstract
Let be a matrix with entries where The Chebotarev theorem states that if is a prime then any minor of is non-zero. In this note we provide an analogue of this statement for composite
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Matrix Theory and Algorithms
