Pith. sign in

REVIEW 7 minor 92 references

Elementary Symmetric Polynomial Inequalities for Centered Vectors and Matrices

T0 review · 0 major / 7 minor · reviewed 2026-07-30 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Centered vectors and matrices force elementary symmetric polynomials down to square-root binomial size, tightening permanent and de Finetti bounds.

desk verdict Solid analytic inequalities that cleanly improve the complex-vector ESP bound and give a genuine doubly-centered matrix version; applications unify the authors’ earlier permanent/de Finetti results without structural gaps. read the letter →

arxiv 2607.23836 v1 pith:FFWKVXBL submitted 2026-07-26 math.CO cs.ITmath.ITmath.PR

Yanjun Han , Jonathan Niles-Weed This is my paper · ORCID
classification math.COcs.ITmath.ITmath.PR MSC 05E0515A1560C0562E17
keywords elementarysymmetricpolynomialscenteredvectorsmatricesmatrixpermanentpermutationmixturesfinitedeFinettichi-squareddivergenceMaclaurininequalities
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Elementary symmetric polynomials measure how coordinates of a vector multiply and add. Classical bounds allow them to grow like a full binomial coefficient. This paper shows that when the vector sums to zero (and has unit average squared size), the growth drops to the square root of that binomial, even for complex entries. The same idea lifts to matrices that have zero row and column sums: an ESP-like permanent sum is then at most an exponential times the binomial, not the square of the binomial. Those two inequalities give a single permanent upper bound for positive-semidefinite doubly stochastic matrices that improves earlier spectral estimates. The permanent bound in turn yields a cleaner mean-field guarantee for permutation mixtures and a sharp chi-squared finite de Finetti theorem that recovers the classical small-alphabet and noisy regimes in one statement.

What carries the argument

A contour-integral representation of ek(z) controlled by Remez sublevel estimates on a degree-2 trigonometric polynomial (vector case), and a generating function Qk(p) = E[(X^T A Y)^k] whose leading coefficient is extracted by Chebyshev extremal polynomials after sub-Gaussian and McDiarmid moment bounds (matrix case).

What would settle it

Exhibit a single centered complex vector (sum zero, average squared length one) whose elementary symmetric polynomial of some degree k exceeds any fixed multiple of the square root of the binomial, or a zero-row-and-column-sum matrix whose permanent-sum quantity grows faster than any B^k times the binomial.

Watch

Extended reading notes

Core claim

For a complex vector z with sum zero and average squared length one, the k-th elementary symmetric mean is at most a universal constant times the square root of the binomial coefficient. For a complex matrix with zero row and column sums and Frobenius norm n, the analogous permanent-sum quantity is at most B^k times the binomial. Both statements are sharp enough in scaling to unify and strengthen previous permanent bounds and the resulting approximation guarantees for sampling without replacement.

Load-bearing premise

The matrix bound leans on crude sub-Gaussian and concentration moment estimates plus a Chebyshev leading-coefficient comparison; if those moment transfers fail, the exponential factor and the second permanent bound collapse.

Editorial extensions

If this is right

  • A single spectral permanent bound for PSD doubly stochastic matrices that simultaneously improves the linear, quadratic, and polynomial-factor estimates previously obtained by separate arguments.
  • A best-of-both-worlds chi-squared guarantee for the mean-field approximation of any permutation mixture in terms of the non-leading eigenvalues of its channel-overlap matrix.
  • A unified chi-squared finite de Finetti theorem: k = o(n / sqrt(T)) already makes the k-marginals of sampling without versus with replacement indistinguishable, recovering both the small-alphabet and bounded-noise regimes.
  • When the total non-leading mass T is O(1), even k = o(n) suffices for vanishing chi-squared distance between the marginals.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same contour-plus-Remez method may extend to other multilinear forms whose generating functions stay low-degree trigonometric after centering.
  • Improving the matrix constant from exponential in k down to a pure square-root binomial would immediately sharpen the local regime of the de Finetti corollary.
  • The permanent comparison suggests quantitative stability versions of van der Waerden: how fast the permanent must rise once the spectrum leaves the all-ones projector.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 7 minor

Summary. The paper proves two new upper bounds on elementary symmetric polynomials under centering conditions. Theorem 1.1 shows that for z ∈ ℂⁿ with ∑zᵢ = 0 and ∑|zᵢ|² = n, one has |eₖ(z)| ≤ √(C·C(n,k)) with universal C (unoptimized C = 24), extending a real-vector result of the authors' prior work [HNW26] to complex vectors; the proof uses a contour-integral representation, AM–GM on a normalized product q(θ), and a sublevel estimate for a degree-2 trigonometric polynomial via a Remez-type inequality of Ganzburg. Theorem 1.2 introduces a permanent-based matrix analogue eₖ(A) and shows |eₖ(A)| ≤ BᵏC(n,k) for doubly centered A with ‖A‖_F = n (unoptimized B = 8e²), via the generating polynomial Qₖ(p) = E[(XᵀAY)ᵏ] for Bern(p) vectors, sub-Gaussian/McDiarmid moment bounds, and Chebyshev leading-coefficient extraction. Corollaries 1.3–1.5 apply these to permanents of PSD doubly stochastic matrices, permutation mixtures (a best-of-both-worlds χ² bound), and a finite de Finetti theorem improving the sufficient condition from k = o(n/T) to k = o(n/√T).

Significance. If correct—and I believe the proofs are—these are the right bounds at the right level of generality, and the corollaries immediately improve published results in Annals of Statistics. Theorem 1.1 upgrades the authors' prior real-vector result to the complex case with no polynomial loss, which was explicitly left open by the real-rootedness restriction of the earlier argument. Theorem 1.2 is the first bound to exploit simultaneous row and column centering; the manuscript itself demonstrates (via the determinant-form counterexample) that the obvious tensorization shortcut is genuinely blocked, so the Bernoulli-generating-function route is a real contribution rather than a technicality. Particular strengths worth noting: the results are parameter-free with explicit, unoptimized universal constants (C = 24, B = 8e²); the proofs are complete, short, and built from classical, checkable tools (contour integration, AM–GM, the Ganzburg–Remez inequality, Hoeffding/McDiarmid concentration, Chebyshev extremal coefficients); and Corollaries 1.3–1.5 give concrete, falsifiable improvements over prior bounds, including a strictly better de Finetti threshold in the regime T ≥ 1. I independently re-

minor comments (7)
  1. [§2.2, Eq. (8)] §2.2, display (8): the integrand's exponent is written as e^{-2x^2/σ^2}, but with that exponent the integral equals 2^{1-k/2}σ^k Γ(k/2+1), a factor 2^k smaller than the closed form shown. The closed form 2^{k/2+1}σ^k Γ(k/2+1) is correct for the standard proxy convention P(|X|≥t) ≤ 2e^{-t^2/(2σ^2)}, so the integrand should read e^{-x^2/(2σ^2)}. As printed, a reader checking the equality literally gets a contradiction.
  2. [§2.2] §2.2, McDiarmid display: the two-sided tail P(|‖Aζ‖₂ − E‖Aζ‖₂| ≥ t) is bounded by exp(−2t²/n²); McDiarmid gives 2exp(−2t²/∑cᵢ²) = 2exp(−2t²/n²). The missing factor 2 is later correctly absorbed into the moment bound 2(kn²/4)^{k/2}, so the argument is unaffected, but the display itself should carry the 2.
  3. [§1.2, footnote 1] §1.2, footnote 1: the manuscript asserts that the proof of [Der16, Proposition 3.3] (multiplicativity of the spectral norm under Kronecker tensor products) 'has a gap.' Since this footnote does real work in motivating why the tensorization route fails, the gap should be identified briefly (one sentence locating the faulty step), or a reference given.
  4. [Abstract] Abstract: the phrase 'a sharp χ² version of the de Finetti theorem' overstates what is proved—Corollary 1.5 improves the sufficient condition from k = o(n/T) to k = o(n/√T), but no matching lower bound is given, so sharpness is not established. 'An improved' would be accurate.
  5. [§2.1] §2.1: the text says 'it is important to provide a superlevel estimate of q(θ)', but the argument in fact derives sublevel estimates for B(θ) (and A(θ)) which force q(θ) to be exponentially small away from a small set. The terminology should be aligned with what is actually proved, to avoid confusion on first reading.
  6. [§2.1–§2.2] §2.1, after Lemma 2.1: the sentence 'The above inequality trivially extends to a > 1/8' would benefit from the one-line reason (for a > 1/8 the right-hand side exceeds 2π, so the bound is vacuous). Similarly, in the final chain of (8), the step Γ(k/2+1) ≤ (k/2)^{k/2} is stated for k ≥ 2; noting that it fails at k = 1 (which is excluded since e₁(A) = 0) would preempt a reader's check.
  7. [References] References: [Tao23] is cited as an arXiv preprint and [HNW26] as Annals of Statistics 2026—please update both to their current publication status at revision time. Also, [JGI25] lists the third author as 'Kontoyiannis Ioannis' (name order reversed relative to [GK21]).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: main inequalities are self-contained classical analysis; HNW26 citations supply identities only.

full rationale

Theorems 1.1 and 1.2 are proved from first principles (contour integral + Remez sublevel estimates for vectors; generating function Q_k(p), sub-Gaussian/McDiarmid moments, and Chebyshev leading-coefficient extraction for matrices) without assuming the target bounds or fitting parameters. Corollaries 1.3–1.5 apply those new bounds to the permanent expansion nn/n! Perm(M) = ∑ n^k / binom(n,k) e_k(A) and the channel-overlap definition of M, both taken from the authors’ prior HNW26. Those citations are load-bearing only as algebraic identities and matrix constructions; they do not smuggle in the centered ESP estimates themselves. No self-definitional loop, no fitted-input-as-prediction, and no uniqueness theorem imported to force the result. The derivation chain is therefore independent and non-circular.

Assumptions & free parameters 0 free parameters · 6 assumptions · 2 invented entities

Load-bearing background is standard complex analysis, Remez-type inequalities for trigonometric polynomials, classical Chebyshev leading-coefficient bounds, and elementary concentration (Hoeffding, McDiarmid). No empirical free parameters. The only paper-specific modeling choices are the normalizations ∑ zi = 0, ∑ |zi|² = n and ‖A‖_F = n together with the particular generating function Qk(p) that encodes double centering; these are definitional scalings, not fitted constants. Invented analytic objects (A(θ), B(θ), Qk(p)) are proof devices, not physical entities.

assumptions (6)
  • standard math Ganzburg’s Remez-type inequality for trigonometric polynomials of degree ≤ d (Lemma 2.1 / [Gan12])
    Used in §2.1 to convert the L¹ mass of A(θ) into a measure bound on sublevel sets; without it the contour-integral tail estimate fails.
  • standard math Chebyshev polynomials maximize leading coefficient among degree-m polynomials bounded by 1 on [-1,1] ([DL93, Ch. 3, Thm 6.1])
    Extracts |ek(A)| from the uniform bound on Qk(p) in §2.2.
  • standard math Hoeffding sub-Gaussianity of centered Bernoullis and McDiarmid bounded-differences inequality
    Supply the moment bounds (8)–(9) that control |Qk(p)|.
  • domain assumption Permanent expansion nn/n! Perm(M) = ∑ nk / binom(n,k) ek(A) for A = M - J/n (HNW26 Appendix B)
    Bridge from the new ESP bounds to Corollaries 1.3–1.5; taken from the authors’ prior work as an identity.
  • domain assumption Channel-overlap matrix M(P1,…,Pn) is PSD and doubly stochastic (HNW26 Lemmas 5.1–5.2)
    Needed to apply the permanent bounds to permutation mixtures and de Finetti.
  • ad hoc to paper Normalization ∑ zi = 0, ∑ |zi|² = n (resp. A1 = Aᵀ1 = 0, ‖A‖_F = n)
    Scale-setting conventions that make the target bounds dimensionless; standard but chosen by the authors.
invented entities (2)
  • Matrix elementary symmetric quantity ek(A) via normalized permanents of k×k submatrices
    purpose: Extends vector ESPs to doubly centered matrices so that permanent bounds can exploit both row and column sum constraints.
    Definition (2) is natural (recovers ek(u)ek(v) on rank-1 matrices) but is a paper-level object; independent interest is demonstrated only through the applications here.
  • Generating polynomial Qk(p) = E[(Xᵀ A Y)^k] with i.i.d. Bern(p) vectors
    purpose: Encodes double centering so the leading coefficient is (k!)² ek(A) while lower moments stay controllable.
    Proof device introduced in §2.2; no external measurement attaches to it.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Elementary Symmetric Polynomial Inequalities for Centered Vectors and Matrices." pith.science (2026). https://pith.science/paper/FFWKVXBL

@misc{pith2026260723836,
  author       = {Pith},
  title        = {Pith review of: Elementary Symmetric Polynomial Inequalities for Centered Vectors and Matrices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FFWKVXBL}},
  note         = {Machine review of arXiv:2607.23836}
}
abstract

We prove new inequalities for elementary symmetric polynomials (ESPs) for vectors that sum to zero, and for square matrices with zero row and column sums. We apply these results to obtain a unified upper bound on the mean-field approximation guarantee for permutation mixtures, as well as a sharp $\chi^2$ version of the de Finetti theorem for finite sequences over a small alphabet. The main proof ideas were developed by the GPT-5.5 Pro model.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

92 extracted references · 4 canonical work pages

  1. [1]

    Statistical Inference and Estimation in High Dimensions , url =

    Ding,Yunzi , date-added =. Statistical Inference and Estimation in High Dimensions , url =. ProQuest Dissertations and Theses , keywords =. 2022 , bdsk-url-1 =

    2022

  2. [2]

    A class of statistics with asymptotically normal distribution , url =

    Hoeffding, Wassily , date-added =. A class of statistics with asymptotically normal distribution , url =. Ann. Math. Statistics , mrclass =. 1948 , bdsk-url-1 =. doi:10.1214/aoms/1177730196 , fjournal =

    arXiv 1948

  3. [3]

    Low coordinate degree algorithms

    Kunisky, Dmitriy , journal=. Low coordinate degree algorithms. 2025 , publisher=

    2025

  4. [4]

    Information-theoretic bounds and phase transitions in clustering, sparse

    Banks, Jess and Moore, Cristopher and Vershynin, Roman and Verzelen, Nicolas and Xu, Jiaming , date-added =. Information-theoretic bounds and phase transitions in clustering, sparse. IEEE Transactions on Information Theory , number =

  5. [5]

    Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio , year =

    Kunisky, Dmitriy and Wein, Alexander S and Bandeira, Afonso S , booktitle =. Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio , year =

  6. [6]

    Optimal rates of estimation for multi-reference alignment , volume =

    Bandeira, Afonso and Niles-Weed, Jonathan and Rigollet, Philippe , date-added =. Optimal rates of estimation for multi-reference alignment , volume =. Mathematical Statistics and Learning , number =

  7. [7]

    Optimality and sub-optimality of PCA I: Spiked random matrix models , volume =

    Perry, Amelia and Wein, Alexander S and Bandeira, Afonso S and Moitra, Ankur , date-added =. Optimality and sub-optimality of PCA I: Spiked random matrix models , volume =. The Annals of Statistics , number =

  8. [8]

    Minimax estimation of linear and quadratic functionals on sparsity classes , url =

    Collier, Olivier and Comminges, La\". Minimax estimation of linear and quadratic functionals on sparsity classes , url =. Ann. Statist. , mrclass =. 2017 , bdsk-url-1 =. doi:10.1214/15-AOS1432 , fjournal =

    work page doi:10.1214/15-aos1432 2017

Show all 92 references
  1. [9]

    Non-asymptotic minimax rates of testing in signal detection , volume =

    Baraud, Yannick , date-added =. Non-asymptotic minimax rates of testing in signal detection , volume =. Bernoulli , mrclass =

  2. [10]

    Hypothesis testing for densities and high-dimensional multinomials , volume =

    Balakrishnan, Sivaraman and Wasserman, Larry , date-added =. Hypothesis testing for densities and high-dimensional multinomials , volume =. The Annals of Statistics , number =

  3. [11]

    Barber, Rina Foygel and Candes, Emmanuel J and Ramdas, Aaditya and Tibshirani, Ryan J , journal=. De. 2024 , publisher=

    2024

  4. [12]

    Advances in neural information processing systems , title =

    Tibshirani, Ryan J and Barber, Rina Foygel and Candes, Emmanuel and Ramdas, Aaditya , date-added =. Advances in neural information processing systems , title =

  5. [13]

    Conformal prediction beyond exchangeability , volume =

    Barber, Rina Foygel and Candes, Emmanuel J and Ramdas, Aaditya and Tibshirani, Ryan J , date-added =. Conformal prediction beyond exchangeability , volume =. The Annals of Statistics , number =

  6. [14]

    Symmetric measures on Cartesian products , volume =

    Hewitt, Edwin and Savage, Leonard J , date-added =. Symmetric measures on Cartesian products , volume =. Transactions of the American Mathematical Society , number =

  7. [15]

    On the minimum attainable risk in permutation invariant problems , year =

    Weinstein, Asaf , journal =. On the minimum attainable risk in permutation invariant problems , year =

  8. [16]

    Comment: Empirical Bayes, Compound Decisions and Exchangeability , url =

    Greenshtein, Eitan and Ritov, Ya'acov , date-added =. Comment: Empirical Bayes, Compound Decisions and Exchangeability , url =. Statistical Science , month =. 2019 , bdsk-url-1 =. doi:10.1214/19-sts709 , issn =

    2019 doi

  9. [17]

    Asymptotic solutions of compound decision problems , year =

    Hannan, James Francis , date-added =. Asymptotic solutions of compound decision problems , year =

  10. [18]

    Permanents , volume =

    Minc, Henryk , date-added =. Permanents , volume =

  11. [19]

    MacLaurin, Colin , date-added =. IV. A second letter from Mr. Colin McLaurin, Professor of Mathematicks in the University of Edinburgh and FRS to Martin Folkes, Esq; concerning the roots of equations, with the demonstration of other rules in algebra; being the continuation of ...

  12. [20]

    , date-added =

    Tsybakov, Alexandre B. , date-added =. Introduction to nonparametric estimation , year =

  13. [21]

    General maximum likelihood empirical Bayes estimation of normal means , url =

    Jiang, Wenhua and Zhang, Cun-Hui , date-added =. General maximum likelihood empirical Bayes estimation of normal means , url =. The Annals of Statistics , month =. 2009 , bdsk-url-1 =. doi:10.1214/08-aos638 , issn =

    2009 doi

  14. [22]

    Nonparametric empirical Bayes and compound decision approaches to estimation of a high-dimensional vector of normal means , year =

    Brown, Lawrence D and Greenshtein, Eitan , date-added =. Nonparametric empirical Bayes and compound decision approaches to estimation of a high-dimensional vector of normal means , year =. The Annals of Statistics , pages =

  15. [23]

    A dozen de Finetti-style results in search of a theory , volume =

    Diaconis, Persi and Freedman, David , booktitle =. A dozen de Finetti-style results in search of a theory , volume =

  16. [24]

    Minimax estimation of discrete distributions under _1 loss , volume =

    Han, Yanjun and Jiao, Jiantao and Weissman, Tsachy , date-added =. Minimax estimation of discrete distributions under _1 loss , volume =. IEEE Transactions on Information Theory , number =

  17. [25]

    Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional , year =

    Cai, T Tony and Low, Mark G , date-added =. Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional , year =. The Annals of Statistics , pages =

  18. [26]

    On estimation of the L r norm of a regression function , volume =

    Lepski, Oleg and Nemirovski, Arkady and Spokoiny, Vladimir , date-added =. On estimation of the L r norm of a regression function , volume =. Probability theory and related fields , pages =

  19. [27]

    Finite forms of de

    Diaconis, Persi , date-added =. Finite forms of de. Synthese , mrclass =. 1977 , bdsk-url-1 =. doi:10.1007/BF00486116 , fjournal =

    1977 doi

  20. [28]

    Funzione caratteristica di un fenomeno aleatorio , year =

    De Finetti, Bruno , booktitle =. Funzione caratteristica di un fenomeno aleatorio , year =

  21. [29]

    Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective , url =

    Jain, Vishesh and Risteski, Andrej and Koehler, Frederic , booktitle =. Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective , url =. 2019 , bdsk-url-1 =. doi:10.1145/3313276.3316299 , mrclass =

    2019

  22. [30]

    Statistical field theory , volume =

    Parisi, Giorgio , date-added =. Statistical field theory , volume =

  23. [31]

    Mean field approximations via log-concavity , url =

    Lacker, Daniel and Mukherjee, Sumit and Yeung, Lane Chun , date-added =. Mean field approximations via log-concavity , url =. Int. Math. Res. Not. IMRN , mrclass =. 2024 , bdsk-url-1 =. doi:10.1093/imrn/rnad302 , fjournal =

    2024 doi

  24. [32]

    Bayes, oracle

    Efron, Bradley , date-added =. Bayes, oracle. Statist. Sci. , mrclass =. 2019 , bdsk-url-1 =. doi:10.1214/18-STS674 , fjournal =

    2019 doi

  25. [33]

    Locally asymptotically normal families of distributions

    Le Cam, Lucien , date-added =. Locally asymptotically normal families of distributions. Univ. California Publ. Statist. , mrclass =

  26. [34]

    Distance between sampling with and without replacement , volume =

    Stam, Adriaan Johannes , journal =. Distance between sampling with and without replacement , volume =

  27. [35]

    Finite exchangeable sequences , year =

    Diaconis, Persi and Freedman, David , journal =. Finite exchangeable sequences , year =

  28. [36]

    An information-theoretic proof of a finite de

    Gavalakis, Lampros and Kontoyiannis, Ioannis , journal =. An information-theoretic proof of a finite de

  29. [37]

    Journal of Applied Probability , year=

    Relative entropy bounds for sampling with and without replacement , author=. Journal of Applied Probability , year=

  30. [38]

    Asymptotically subminimax solutions of compound statistical decision problems , volume =

    Robbins, Herbert , booktitle =. Asymptotically subminimax solutions of compound statistical decision problems , volume =

  31. [39]

    Asymptotic efficiency of simple decisions for the compound decision problem , year =

    Greenshtein, Eitan and Ritov, Ya'acov , journal =. Asymptotic efficiency of simple decisions for the compound decision problem , year =

  32. [40]

    Nonparametric goodness-of-fit testing under Gaussian models , volume =

    Ingster, Yuri and Suslina, Irina A , publisher =. Nonparametric goodness-of-fit testing under Gaussian models , volume =

  33. [41]

    The concentration of measure phenomenon , year =

    Ledoux, Michel , number =. The concentration of measure phenomenon , year =

  34. [42]

    Tight bounds for learning a mixture of two

    Hardt, Moritz and Price, Eric , booktitle =. Tight bounds for learning a mixture of two

  35. [43]

    The Annals of Statistics , keywords =

    Yihong Wu and Pengkun Yang , doi =. The Annals of Statistics , keywords =. 2020 , bdsk-url-1 =

    2020

  36. [44]

    Computational barriers to estimation from low-degree polynomials , volume =

    Schramm, Tselil and Wein, Alexander S , journal =. Computational barriers to estimation from low-degree polynomials , volume =

  37. [45]

    Is It Easier to Count Communities Than Find Them? , volume =

    Rush, Cynthia and Skerman, Fiona and Wein, Alexander S and Yang, Dana , booktitle =. Is It Easier to Count Communities Than Find Them? , volume =

  38. [46]

    Analytic combinatorics , year =

    Flajolet, Philippe and Sedgewick, Robert , publisher =. Analytic combinatorics , year =

  39. [47]

    An Inequality of Hadamard Type for Permanents , volume =

    Carlen, Eric and Lieb, Elliott H and Loss, Michael , journal =. An Inequality of Hadamard Type for Permanents , volume =

  40. [48]

    Banach, Stefan , journal =

  41. [49]

    Inequalities and tail bounds for elementary symmetric polynomials , volume =

    Gopalan, Parikshit and Yehudayoff, Amir , booktitle =. Inequalities and tail bounds for elementary symmetric polynomials , volume =

  42. [50]

    Log-seed pseudorandom generators via iterated restrictions , year =

    Doron, Dean and Hatami, Pooya and Hoza, William M , booktitle =. Log-seed pseudorandom generators via iterated restrictions , year =

  43. [51]

    Pseudorandom generators for width-3 branching programs , year =

    Meka, Raghu and Reingold, Omer and Tal, Avishay , booktitle =. Pseudorandom generators for width-3 branching programs , year =

  44. [52]

    Tao, Terence , journal =. A

  45. [53]

    Inverse spectral problem for normal matrices and the

    Malamud, S , journal =. Inverse spectral problem for normal matrices and the

  46. [54]

    Differentiators and the geometry of polynomials , volume =

    Pereira, Rajesh , journal =. Differentiators and the geometry of polynomials , volume =

  47. [55]

    The solution of van der

    Egorychev, Gregory P , journal =. The solution of van der

  48. [56]

    Aufgabe 45 , volume =

    van der Waerden, Bartel Leendert , journal =. Aufgabe 45 , volume =

  49. [57]

    Proof of the van der

    Falikman, DI , journal =. Proof of the van der

  50. [58]

    Generalized matrix functions , volume =

    Marcus, Marvin and Minc, Henryk , journal =. Generalized matrix functions , volume =

  51. [59]

    Simply exponential approximation of the permanent of positive semidefinite matrices , year =

    Anari, Nima and Gurvits, Leonid and Gharan, Shayan Oveis and Saberi, Amin , booktitle =. Simply exponential approximation of the permanent of positive semidefinite matrices , year =

  52. [60]

    Classical deterministic complexity of Edmonds' problem and quantum entanglement , year =

    Gurvits, Leonid , booktitle =. Classical deterministic complexity of Edmonds' problem and quantum entanglement , year =

  53. [61]

    Information theory: From coding to learning , year =

    Polyanskiy, Yury and Wu, Yihong , publisher =. Information theory: From coding to learning , year =

  54. [62]

    On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables , volume =

    Isserlis, Leon , journal =. On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables , volume =

  55. [63]

    Ueber die Aufl

    Kirchhoff, Gustav , journal =. Ueber die Aufl

  56. [64]

    Asymptotic solutions of the compound decision problem for two completely specified distributions , year =

    Hannan, James F and Robbins, Herbert , journal =. Asymptotic solutions of the compound decision problem for two completely specified distributions , year =

  57. [65]

    Minimax risk over _p -balls for _q -error , volume =

    Donoho, David L and Johnstone, Iain M , journal =. Minimax risk over _p -balls for _q -error , volume =

  58. [66]

    Minimax _q risk in _p balls , volume =

    Zhang, Cun-Hui , booktitle =. Minimax _q risk in _p balls , volume =

  59. [67]

    Mutual information and minimum mean-square error in Gaussian channels , volume =

    Guo, Dongning and Shamai, Shlomo and Verd. Mutual information and minimum mean-square error in Gaussian channels , volume =. IEEE transactions on information theory , number =

  60. [68]

    IEEE Transactions on Information Theory , volume=

    Minimax rates of entropy estimation on large alphabets via best polynomial approximation , author=. IEEE Transactions on Information Theory , volume=. 2016 , publisher=

    2016

  61. [69]

    Minimax estimation of the

    Jiao, Jiantao and Han, Yanjun and Weissman, Tsachy , journal=. Minimax estimation of the. 2018 , publisher=

    2018

  62. [70]

    IEEE Transactions on Information Theory , volume=

    Capacity of noisy permutation channels , author=. IEEE Transactions on Information Theory , volume=. 2023 , publisher=

    2023

  63. [71]

    IEEE Transactions on Information Theory , volume=

    Coding theorems for noisy permutation channels , author=. IEEE Transactions on Information Theory , volume=. 2020 , publisher=

    2020

  64. [72]

    The Annals of Statistics , volume=

    Mutual information, metric entropy and cumulative relative entropy risk , author=. The Annals of Statistics , volume=. 1997 , publisher=

    1997

  65. [73]

    Annals of Statistics , pages=

    Information-theoretic determination of minimax rates of convergence , author=. Annals of Statistics , pages=. 1999 , publisher=

    1999

  66. [74]

    IEEE Transactions on Information Theory , volume=

    On the minimax rate of the Gaussian sequence model under bounded convex constraints , author=. IEEE Transactions on Information Theory , volume=. 2022 , publisher=

    2022

  67. [75]

    arXiv preprint arXiv:2303.07279 , year=

    Universal coding, intrinsic volumes, and metric complexity , author=. arXiv preprint arXiv:2303.07279 , year=

    arXiv

  68. [76]

    The Thirty Sixth Annual Conference on Learning Theory , pages=

    Entropic characterization of optimal rates for learning Gaussian mixtures , author=. The Thirty Sixth Annual Conference on Learning Theory , pages=. 2023 , organization=

    2023

  69. [77]

    Indagationes Mathematicae (Proceedings) , volume=

    On the Shannon capacity of an arbitrary channel , author=. Indagationes Mathematicae (Proceedings) , volume=. 1974 , organization=

    1974

  70. [78]

    Roos, Bero , journal=. On

  71. [79]

    Generalized symmetric polynomials and an approximate de

    Bobkov, Sergey G , journal=. Generalized symmetric polynomials and an approximate de. 2005 , publisher=

    2005

  72. [80]

    arXiv preprint arXiv:2509.07355 , year =

    Han, Yanjun and Niles-Weed, Jonathan and Shen, Yandi and Wu, Yihong , title =. arXiv preprint arXiv:2509.07355 , year =

    arXiv

  73. [81]

    Theory of cryptography conference , pages=

    Calibrating noise to sensitivity in private data analysis , author=. Theory of cryptography conference , pages=. 2006 , organization=

    2006

  74. [82]

    Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

    Amplification by shuffling: From local to central differential privacy via anonymity , author=. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2019 , organization=

    2019

  75. [83]

    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Hiding among the clones: A simple and nearly optimal analysis of privacy amplification by shuffling , author=. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2022 , organization=

    2021

  76. [84]

    Girgis, Antonious M and Data, Deepesh and Diggavi, Suhas and Suresh, Ananda Theertha and Kairouz, Peter , booktitle=. On the

  77. [85]

    Compound decision theory and empirical

    Zhang, Cun-Hui , journal=. Compound decision theory and empirical. 2003 , publisher=

    2003

  78. [86]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Compound decisions and empirical Bayes , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 1969 , publisher=

    1969

  79. [87]

    The Annals of Statistics , volume=

    Approximate independence of permutation mixtures , author=. The Annals of Statistics , volume=. 2026 , publisher=

    2026

  80. [88]

    Ganzburg, Michael I , journal=. On a. 2012 , publisher=

    2012

  81. [89]

    Foundations of Computational Mathematics , volume=

    On the nuclear norm and the singular value decomposition of tensors , author=. Foundations of Computational Mathematics , volume=

  82. [90]

    Mathematics of Computation , volume=

    Nuclear norm of higher-order tensors , author=. Mathematics of Computation , volume=

  83. [91]

    Nuclear norm under tensor

    Cochrane, Robert , journal=. Nuclear norm under tensor

  84. [92]

    1993 , publisher=

    Constructive approximation , author=. 1993 , publisher=

    1993

Pith tools

Reviewed July 30, 2026 · model on record in the stance chip above.