Characteristic polynomial patterns in difference sets of matrices (Q2801724)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6571543
Language Label Description Also known as
default for all languages
No label defined
    English
    Characteristic polynomial patterns in difference sets of matrices
    scientific article; zbMATH DE number 6571543

      Statements

      Characteristic polynomial patterns in difference sets of matrices (English)
      0 references
      0 references
      0 references
      21 April 2016
      0 references
      integer square-matrices
      0 references
      characteristic polynomials
      0 references
      homogeneous space
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references