Characteristic polynomial patterns in difference sets of matrices

From MaRDI portal



Abstract: We show that for every subset E of positive density in the set of integer square-matrices with zero traces, there exists an integer kgeq1 such that the set of characteristic polynomials of matrices in E−E contains the set of emph{all} characteristic polynomials of integer matrices with zero traces and entries divisible by k. Our theorem is derived from results by Benoist-Quint on measure rigidity for actions on homogeneous spaces.


The authors establish an analogue of Furstenberg-Sárközy theorem for difference sets of matrices. Their main result is: For every subset \(E\) of positive density in the set of integer square-matrices with zero traces, there exists an integer \(k\geq 1\) such that the set of characteristic polynomials of matrices in \(E-E\) contains the set of all characteristic polynomials of integer matrices with zero traces and entries divisible by \(k\). A measure rigidity result for actions on homogeneous spaces by Benoist-Quint is used for the proof of this result. Finally, the authors also show a ``sum-product analogue of Bogolyubov's Theorem [\textit{I. Z. Ruzsa}, in: Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse). Basel: Birkhäuser. 87--210 (2009; Zbl 1221.11026)] as an application of the main result.











This page was built for publication: Characteristic polynomial patterns in difference sets of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801724)