Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.06024

Factorization statistics and bug-eyed configuration spaces

Dan Petersen·Philip Tosteson
View original source ↗Read source document ↗Export metadata ↓

Abstract

A recent theorem of Hyde proves that the factorizations statistics of a random polynomial over a finite field are governed by the action of the symmetric group on the configuration space of $n$ distinct ordered points in $\mathbb R^3$. Hyde asked whether this result could be explained geometrically. We give a geometric proof of Hyde's theorem as an instance of the Grothendieck--Lefschetz trace formula applied to an interesting, highly nonseparated algebraic space. An advantage of our method is that it generalizes uniformly to an arbitrary Weyl group. In the process we study certain non-Hausdorff models for complements of hyperplane arrangements, first introduced by Proudfoot.

Explore related subjects

math.COmath.AGmath.ATmath.NTmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dan Petersen, Philip Tosteson. 2021-10-03. Factorization statistics and bug-eyed configuration spaces. https://doi.org/10.2140/gt.2021.25.3691

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗