Rank of Matrices with Entries from a Multiplicative Group

DOI10.1093/IMRN/RNAC183MaRDI QIDQ6114764zbMATH OpenOpenAlexWikidataFDO

Authors Noga Alon, József Solymosi

Publication date 15 August 2023

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.00618

zbMATH Keywords

lower boundsrank of matrices

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Miscellaneous inequalities involving matrices (15A45)

Abstract: We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $mathbb{R}^d$ generate high rank multiplicative groups and that multiplicative groups of small rank cannot contain large sumsets.

Recommendations

• Additive and Multiplicative Structure in Matrix Spaces
• Using the subspace theorem to bound unit distances
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• Some additive combinatorics problems in matrix rings
• Ranks of matrices with few distinct entries

Cited in

(3)

• Rank and matrix coefficients for simply laced groups
• On some matrix counting problems
• Counting matrices over finite rank multiplicative groups

This page was built for publication: Rank of Matrices with Entries from a Multiplicative Group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114764)