Thresholds in the Lattice of Subspaces of (F_q)^n

10/01/2019
by   Benjamin Rossman, et al.
0

Let Q be an ideal (downward-closed set) in the lattice of linear subspaces of (F_q)^n, ordered by inclusion. For 0 < k < n, let μ_k(Q) denote the fraction of k-dimensional subspaces that belong to Q. We show that these densities satisfy μ_k(Q) = 1/1+z μ_k+1(Q) <1/1+qz. This implies a sharp threshold theorem: if μ_k(Q) < 1-ε, then μ_ℓ(Q) <ε for ℓ = k + O(log_q(1/ε)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2019

When lattice cubes meet affine subspaces: a short note

We give short and simple proofs of what seem to be folklore results: * t...
research
12/03/2017

Toric Codes and Lattice Ideals

Let X be a complete simplicial toric variety over a finite field F_q wit...
research
09/05/2022

A geometric framework for asymptotic inference of principal subspaces in PCA

In this article, we develop an asymptotic method for testing hypothesis ...
research
04/16/2018

A Generalization of Birkhoff's Theorem for Distributive Lattices, with Applications to Robust Stable Matchings

Birkhoff's theorem, which has also been called the fundamental theorem ...
research
05/09/2020

On the Grassmann Graph of Linear Codes

Let Γ(n,k) be the Grassmann graph formed by the k-dimensional subspaces ...
research
09/10/2018

A log-Sobolev inequality for the multislice, with applications

Let κ∈N_+^ℓ satisfy κ_1 + ... + κ_ℓ = n and let U_κ denote the "multisli...
research
11/30/2020

On minimal subspace Zp-null designs

Let q be a power of a prime p, and let V be an n-dimensional space over ...

Please sign up or login with your details

Forgot password? Click here to reset