Search arXivSearch

arXiv · 2609.14340

Poisson laws and exterior stability for random alternating tensors

Abstract

For fixed $k\ge3$, we determine the critical law of totally isotropic $r$-spaces for a uniform random map $Θ_N:Λ^k\mathbb {F}_q^N\to\mathbb {F}_q^m$. At the exact balance $m\binom rk=r(N-r)$, the entire null configuration is asymptotically an independent Bernoulli subset of $\operatorname{Gr}(r,\mathbb {F}_q^N)$ in total variation, uniformly in $q$ and $m$. Consequently, the counting measure $Ξ_r$ is asymptotically a Poisson point process, and its total mass $X_{N,r}$ is asymptotically Poisson. An exterior-rank stability theorem shows that near-extremal families decompose into Grassmann clusters with uniformly controlled span deficiency. We obtain quantitative rates and identify the first exterior-dependence scale. We also show that rare null $(r+1)$-spaces force high-order factorial-moment divergence, while the fixed-target bilinear cases $m=1,2$ exhibit non-Poisson critical behavior.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pakin Methawisal. 2026-09-13. Poisson laws and exterior stability for random alternating tensors. https://arxiv.org/abs/2609.14340

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