Benchmark 5 QP solvers (OSQP, qpOASES, Gurobi, ECOS, CVXPY+SCS) on MPC problems with horizon N=5-200 for 3 system dimensions (2-state, 10-state, 50-state). Computation time t(N): theoretical O(N³) for dense QP.
Reproduce convergence experiments from 25 published AEC papers (LMS, NLMS, RLS, affine projection). Using the exact parameters reported, convergence rates match published claims in only 15/25 papers (60%).
Analyze recovery of structured sparse signals (block-sparse, tree-sparse, group-sparse) when sparsity assumptions are violated. Standard RIP-based guarantees assume exact sparsity; we characterize performance for approximately sparse signals with sparsity defect δ = ||x - x_s||₁/||x_s||₁ where x_s is the best s-sparse approximation.
Compare ADVI (automatic differentiation variational inference) against HMC (NUTS) on 6 hierarchical models from the Stan case studies (8-schools, radon, election forecasting, disease mapping, IRT, occupancy). ADVI posterior means match HMC within 3% (mean absolute deviation).
Cross-country regression (N=45 OECD+emerging) of AI adoption index (Stanford HAI) on GDP/capita, labor market flexibility (OECD EPL index), education expenditure, internet penetration, and R&D spending. Bivariate: GDP/capita r=0.
Develop and implement an algorithm to compute Hodge numbers h^{p,q} of complete intersection Calabi-Yau manifolds (CICYs) in products of projective spaces P^{n1}×...×P^{nk}.
Verify Witten's conjecture (Kontsevich's theorem) by independently computing intersection numbers ⟨τ_{d1}...τ_{dn}⟩_g on M̄_{g,n} for genus g=0-5 using two methods: (1) Virasoro constraints (recursive) and (2) direct integration via Chern class computations in Sage/Macaulay2.
Apply transfer matrix method to count independent sets i(G_{m×n}) for m=2-8 and arbitrary n. The transfer matrix T_m has dimension 2^m × 2^m (reduced by symmetry to Fib(m+2) × Fib(m+2)).
Test 4 GI heuristics (1-WL, 2-WL, VF2, nauty) on 15 families of strongly regular graphs (SRGs) with parameters (v,k,λ,μ). 1-WL fails to distinguish non-isomorphic SRGs in 100% of tested pairs (by construction).
Study χ(G(n,r)) for n=100-10000 nodes uniformly in [0,1]² with connection radius r chosen at the connectivity threshold r_c = √(ln n / (πn)). Empirically: χ concentrates around c·√(n/ln n) with c=1.
Measure gradient variance ⟨(∂C/∂θᵢ)²⟩ as a function of qubit count n (4-24) for 3 ansatz types: hardware-efficient (HEA, random 2-qubit gates), chemistry-inspired (UCCSD), and QAOA. HEA: variance decays as 2^{-2n} (barren plateau at n≈12).
Simulate random Clifford circuits (up to 256 qubits) with variable measurement rate p (fraction of qubits measured per layer). Entanglement entropy S_A of half-chain: at p=0 (no measurement), S_A scales as volume law S_A ∝ L.
Compare LSTM, Transformer, GRU, random forest against simple persistence (forecast = current value) for 1-min to 60-min ahead wind speed at 5 NREL stations (3 years data). Persistence outperforms all ML methods for horizons ≤15 min (RMSE ratio ML/persistence > 1.
Record AE events during uniaxial compression of glass (brittle), concrete (quasi-brittle), and alumina ceramics. Waiting time distributions: glass follows exponential (Poisson process, KS p=0.