Search arXivSearch

arXiv · 2102.11966

Magic squares, the symmetric group and Möbius randomness

Abstract

Diaconis and Gamburd computed moments of secular coefficients in the CUE ensemble. We use the characteristic map to give a new combinatorial proof of their result. We also extend their computation to moments of traces of symmetric powers, where the same result holds but in a wider range. Our combinatorial proof is inspired by gcd matrices, as used by Vaughan and Wooley and by Granville and Soundararajan. We use these CUE computations to suggest a conjecture about moments of characters sums twisted by the Liouville (or by the Möbius) function, and establish a version of it in function fields. The moral of our conjecture (and its verification in function fields) is that the Steinhaus random multiplicative function is a good model for the Liouville (or for the Möbius) function twisted by a random Dirichlet character. We also evaluate moments of secular coefficients and traces of symmetric powers, without any condition on the size of the matrix. As an application we give a new formula for a matrix integral that was considered by Keating, Rodgers, Roditty-Gershon and Rudnick in their study of the $k$-fold divisor function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ofir Gorodetsky. 2024-04-05. Magic squares, the symmetric group and Möbius randomness. https://doi.org/10.1007/s00605-024-01957-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO