Let $A$ be the adjacency matrix of $G\sim G(n,1/2)$, let $D=\operatorname{diag}(A\mathbf{1})$, and let $\Lambda_G=\mathbb{Z}\langle A,D\rangle\mathbf{1}$. We prove $\Pr[\Lambda_G\ne\mathbb{Z}^n]\le n^{-3/20+o(1)}$. Thus two dependent graph operators generate the entire vertex lattice from the constant vector, simultane...
We construct a fixed triangular family of noncommutative polynomials that spans the joint cyclic module of a real symmetric pair from any prescribed vector. In dimension at most $N$, when the second matrix has spectral diameter at most $N-1$, the family has $N(N+1)/2$ members, degree at most $N-1$, and a shared arithme...
For every finite $P\subset\mathbb{R}^2$ we prove $|\{p\cdot q: p,q\in P\}|\gg |P|^{199/295}$, with an absolute constant and no logarithmic loss, where $199/295 = 2/3+7/885$. This improves the bound $2/3+7/1425$ of Kokkinos (arXiv:2502.12727), which in turn had improved the first superthreshold bound of Hanson, Roche-Ne...
Let $P_n$ be the matrix of a random permutation of $n$ symbols and let $M_n=\log\max_{|z|=1}|\det(I-zP_n)|$. Cook and Zeitouni proved that $M_n/\log n$ converges in probability to a constant $x_0$ for a uniform permutation. We show that the $\sqrt{\log n}$ fluctuations of $M_n$ are carried entirely by the number of cyc...
For a connected regular graph G and a vertex a, we study the algebra generated by the adjacency and degree matrices of G-a and its cyclic module P_a generated by the all-ones vector. Our main theorem determines dim P_a for Cartesian products whose factors have equitable distance partitions at the chosen roots. A normal...
Zhi-Peng Lu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.