Combinatorial properties of certain Toeplitz matrices
DOI:
https://doi.org/10.13069/jacodesmath.v13i1.379Keywords:
Additive combinatorics, Sumsets, Small doubling, Toeplitz matrices, GAPAbstract
In additive combinatorics, a family of finite sets $A_i$ is said to have bounded doubling if there exists a uniform constant $K$ such that
$|A_i + A_i|< K|A_i|$ for all i. In this paper, we study such families in the context of certain symmetric Toeplitz matrices over a field F. In particular, we show that if each matrix has bandwidth b and diagonal entries chosen from a finite set $S \subset F$, then the resulting family admits a doubling constant that depends only on b and the additive properties of $S$, but is independent of the matrix dimension. Also, if the diagonals lie in the image of a fixed-dimensional linear map $L: F^m \to F^{b+1}$, then the doubling constant depends on m rather than b. We include examples to illustrate how one-dimensional constraints on S lead to especially small doubling constants.
Accepted: 27 September 2025
Downloads
References
G. A. Freiman, On the addition of finite sets, Dokl. Akad. Nauk SSSR 158 (1964) 1038–1041.
G. A. Freiman, Foundations of a structural theory of set addition, Translations of Mathematical Monographs, Vol. 37, American Mathematical Society, Providence, RI (1973).
B. Green, I. Z. Ruzsa, Freiman’s theorem in an arbitrary abelian group, J. Lond. Math. Soc. (2) 75(1) (2007) 163–175.
I. Z. Ruzsa, Arithmetical progressions and the number of sums,, Period. Math. Hungar. 25(1) (1992) 105–111.
T. Tao, V. Vu, Additive combinatorics, Cambridge Studies in Advanced Mathematics, Vol. 105, Cambridge University Press, Cambridge (2006).
