A discrete variation of the Littlewood-Offord problem (Q6194235)
From MaRDI portal
scientific article; zbMATH DE number 7820336
Language | Label | Description | Also known as |
---|---|---|---|
English | A discrete variation of the Littlewood-Offord problem |
scientific article; zbMATH DE number 7820336 |
Statements
A discrete variation of the Littlewood-Offord problem (English)
0 references
19 March 2024
0 references
Summary: The Littlewood-Offord problem concerns the number of subsums of a set of vectors that fall in a given convex set. We present a discrete variation of the Littlewood-Offord problem where we estimate the number of subsums that are \((0,1)\)-vectors. We then utilize this to find the maximum order of graphs with given rank or corank. The rank of a graph \(G\) is the rank of its adjacency matrix \(A(G)\) and the corank of \(G\) is the rank of \(A(G)+I\).
0 references
Sperner's theorem
0 references
rank-order problems for graphs
0 references