On some matrix counting problems

Abstract We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime . In particular, in the integer case, we improve a recent bound of V. Blomer and J. Li (2022).

Authors

Institutions

Publication Details

Journal
Journal of the London Mathematical Society
Published
2024-12-01
DOI
https://doi.org/10.1112/jlms.70044
Citations
4
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On some matrix counting problems

Alina Ostafe, Ali Mohammadi, Igor E. Shparlinski
4 citations
Journal of the London Mathematical Society
Coding theory and cryptography
1.39
article

On some matrix counting problems

Alina Ostafe, Ali Mohammadi, Igor E. Shparlinski
article en
4 citations

Abstract

Abstract We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime . In particular, in the integer case, we improve a recent bound of V. Blomer and J. Li (2022).

Journal of the London Mathematical SocietyVol. 110(6)
UNSW Sydney (AU)
Australian Research Council
Openalex Percentile: Top 15%
Coding theory and cryptography
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.