Search arXivSearch

arXiv · 2607.26857

The Sixth Moment of Random Determinants for Arbitrarily Distributed Random Entries

Abstract

Via the method of marked permutation tables presented in this paper, we generalize the formula for the sixth moment of a random determinant to account for entries with arbitrary distribution. That is, let $f_6(n) = \mathbb{E}(\det A)^6$, where $A$ is an $n$ by $n$ random matrix with independent and identically distributed entries. We show that the exponential generating function $F_6(t) = \sum_{n=0}^\infty f_6(n)t^n/(n!)^2$ is D-finite and we present it in a closed form. Our method relies on carefully decomposing marked permutation tables into a shell, a core, and a floating component, each of which has a separate contribution to $F_6(t)$. After this decomposition, it is sufficient to enumerate over a finite number of possible shells, which we did using a highly intricate computer program. We verified our result up to $n = 7$ in the general case and up to $n = 9$ for random matrices whose entries only take two values by using a different method for computing $f_6(n)$ for these cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominik Beck, Zelin Lv, Aaron Potechin. 2026-07-29. The Sixth Moment of Random Determinants for Arbitrarily Distributed Random Entries. https://arxiv.org/abs/2607.26857

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO