summary:We apply the larger sieve to bound the number of $2\times 2$ matrices not having large order when reduced modulo the primes in an interval. Our motivation is the relation with linear recursive congruential generators. Basically our results establish that the probability of finding a matrix with large order modulo many primes drops drastically when a certain threshold involving the number of primes and the order is exceeded. We also study, for a given prime and a matrix, the existence of nearby non-similar matrices having large order. In this direction we find matrices of large order when the trace is restricted to take values in a short interval
Abstract. Matrix perturbation inequalities, such as Weyl’s theorem (con-cerning the singular values)...
International audienceAbstract We generalize current known distribution results on Shanks–Rényi prim...
We study a family of distributions that arise in critical unitary random matrix ensembles. They are ...
summary:We apply the larger sieve to bound the number of $2\times 2$ matrices not having large order...
summary:We apply the larger sieve to bound the number of $2\times 2$ matrices not having large order...
We study random submatrices of a large matrix A. We show how to approximately compute A fro...
We study random submatrices of a large matrix A. We show how to approximately compute A fro...
For a prime p, we consider some natural classes of matrices over a finite field Fp of p elements, su...
For a prime p, we consider some natural classes of matrices over a finite field Fp of p elements, su...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
The discrete distribution of the length of longest increasing subsequences in random permutations of...
We study a family of distributions that arise in critical unitary random matrix ensembles. They are ...
A regularity in the distribution of the solutions of the congruence f(X1,..., Xn) 0 (modp) is shown
Abstract. Matrix perturbation inequalities, such as Weyl’s theorem (con-cerning the singular values)...
International audienceAbstract We generalize current known distribution results on Shanks–Rényi prim...
We study a family of distributions that arise in critical unitary random matrix ensembles. They are ...
summary:We apply the larger sieve to bound the number of $2\times 2$ matrices not having large order...
summary:We apply the larger sieve to bound the number of $2\times 2$ matrices not having large order...
We study random submatrices of a large matrix A. We show how to approximately compute A fro...
We study random submatrices of a large matrix A. We show how to approximately compute A fro...
For a prime p, we consider some natural classes of matrices over a finite field Fp of p elements, su...
For a prime p, we consider some natural classes of matrices over a finite field Fp of p elements, su...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be...
The discrete distribution of the length of longest increasing subsequences in random permutations of...
We study a family of distributions that arise in critical unitary random matrix ensembles. They are ...
A regularity in the distribution of the solutions of the congruence f(X1,..., Xn) 0 (modp) is shown
Abstract. Matrix perturbation inequalities, such as Weyl’s theorem (con-cerning the singular values)...
International audienceAbstract We generalize current known distribution results on Shanks–Rényi prim...
We study a family of distributions that arise in critical unitary random matrix ensembles. They are ...