Stable phase retrieval holds for L2-spans of independent centered real random variables iff all but at most one coordinate obeys a uniform two-sided L1 bound.
Semi-autonomous formalization of the Vlasov-Maxwell-Landau equilibrium
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 5roles
background 1polarities
background 1representative citing papers
For every d>1, explicit lattice criteria with D(Λ)>1 are derived under which no continuous-Zak-transform function generates a Gabor frame, negatively resolving existence questions for several classes of smooth windows.
A hypothesis-disciplined multi-agent pipeline in Lean 4 produces axiom-clean, source-faithful formalizations of parametric and semi-parametric asymptotic distribution and efficiency theorems.
Rethlas+Archon automatically construct and Lean-verify a counterexample showing weak quasi-completeness does not imply quasi-completeness for Noetherian local rings.
STFT with Gaussian window performs L²-local stable phase retrieval at the constant function, with Lean 4 autoformalization for an extension to Hermite windows and finite spans of basis vectors.
citing papers explorer
-
Stable Phase Retrieval for Spans of Independent Random Variables
Stable phase retrieval holds for L2-spans of independent centered real random variables iff all but at most one coordinate obeys a uniform two-sided L1 bound.
-
On the existence problem of regular Gabor frames
For every d>1, explicit lattice criteria with D(Λ)>1 are derived under which no continuous-Zak-transform function generates a Gabor frame, negatively resolving existence questions for several classes of smooth windows.
-
Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory
A hypothesis-disciplined multi-agent pipeline in Lean 4 produces axiom-clean, source-faithful formalizations of parametric and semi-parametric asymptotic distribution and efficiency theorems.
-
Automated Conjecture Resolution with Formal Verification
Rethlas+Archon automatically construct and Lean-verify a counterexample showing weak quasi-completeness does not imply quasi-completeness for Noetherian local rings.
-
$L^2$-Stability for STFT phase retrieval
STFT with Gaussian window performs L²-local stable phase retrieval at the constant function, with Lean 4 autoformalization for an extension to Hermite windows and finite spans of basis vectors.