---
res:
  bibo_abstract:
  - Let $f$ be a monic polynomial of degree $n$ with integer coefficients. We use
    Fourier analysis to prove a new upper bound on the number of $n\times n$ matrices
    with characteristic polynomial $f$ and integer entries in $[-T,T]$, as $T\to \infty$.
    The implied constant in our bound only depends on $n$ and is otherwise uniform
    in $f$. Our bound improves on recent work of Habegger, Ostafe and Shparlinski
    for $n\geq 4$.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Tim
      foaf_name: Browning, Tim
      foaf_surname: Browning
  - foaf_Person:
      foaf_givenName: Fabian
      foaf_name: Gundlach, Fabian
      foaf_surname: Gundlach
      foaf_workInfoHomepage: http://www.librecat.org/personId=100450
  - foaf_Person:
      foaf_givenName: Will
      foaf_name: Sawin, Will
      foaf_surname: Sawin
  dct_date: 2026^xs_gYear
  dct_language: eng
  dct_title: Counting matrices with given characteristic polynomial@
...