Related papers: Counting lattice points in central simple algebras…
We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…
In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity.…
Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…
Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…
We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…
We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The…
Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…
Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…
We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…
We use spectral analysis to give an asymptotic formula for the number of matrices in SL(n, Z) of height at most T with strong error terms, far beyond the previous known, both for small and large rank.
We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
We study moments of the logarithmic derivative of characteristic polynomials of orthogonal and symplectic random matrices. In particular, we compute the asymptotics for large matrix size, $N$, of these moments evaluated at points which are…
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.