Pith. sign in

REVIEW 2 major objections 5 minor 1 cited by

Khintchine inequalities, trace monoids and Tur\'an-type problems

T0 review · 2 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read The paper proves that the operator norm of a sum of G-independent semicircle variables equals the spectral radius of the Cayley graph of the trace monoid defined by the graph G, and derives from this the sharp bound 2√ω(G) with the Turán…

desk verdict The trace-monoid results are original and largely sound, but the complex-coefficient scalar theorem is not proven due to a false moment formula. read the letter →

arxiv 2506.02517 v1 pith:BKTTPKB3 submitted 2025-06-03 math.OA math.COmath.FAmath.PR

Patrick Oliveira Santos , Raghavendra Tripathi , Pierre Youssef This is my paper
classification math.OAmath.COmath.FAmath.PR MSC 46L5405C2505C3505A15
keywords G-independencesemicirclevariablesKhintchineinequalitytracemonoidCayleygraphspectralradiusTuránoperator-valued
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

This paper establishes Khintchine-type inequalities for sums of semicircle variables whose independence is governed by a graph G: adjacent vertices commute classically, non-adjacent vertices are free. It proves that the operator norm of the unweighted sum equals the spectral radius of the Cayley graph of the trace monoid generated by the commutation relations of G, and derives the sharp bound ∥T_G∥ ≤ 2√ω(G), where ω(G) is the clique number. The bound is attained by the balanced complete ω-partite Turán graph. The same machinery yields an operator-valued Khintchine inequality with constant 2√ω(G), interpolating between the classical and free Haagerup–Pisier results. If correct, these results connect non-commutative probability with combinatorial group theory and extremal graph theory.

What carries the argument

The load-bearing object is the trace monoid T(G), a monoid whose letters are vertices of G and whose commutation relations are exactly the edges of G, together with its Cayley graph. The argument uses the Cartier–Foata decomposition, the unique factorization of a trace-monoid word into a normal sequence of cliques, to control the structure of paths. The key identity carrying the argument is the moment-cumulant formula τ(s_{i_1}...s_{i_{2p}}) = |NC_2(G,i)|, which turns joint moments into counts of noncrossing pair partitions compatible with the graph, re-expressed as graph-homomorphism counts. The bijection between these pairing/homomorphism data and closed paths in the Cayley graph is what reduces the norm of the sum to a spectral radius.

What would settle it

Take G to be a small graph such as the path on three vertices, build the Fock-space representation of G-independent semicircles from the trace monoid, and numerically compute ∥s_1 + s_2 + s_3∥ by truncating the Cayley-graph adjacency matrix A to words of bounded length; Theorem 1.4 predicts the two numbers agree, so a finite difference at any truncation with controlled error would disprove the equality.

Watch

Extended reading notes

Core claim

The paper's central claim is an exact correspondence between moments of sums of G-independent semicircles and closed walks on the Cayley graph of the trace monoid T(G), whose letters are the vertices of G and whose commutation relations are exactly the edges of G. A bijection is constructed between the pair partitions and graph homomorphisms that count the moments and the closed paths of length 2p from the empty word back to itself in that Cayley graph. Consequently the norm of the sum equals the spectral radius of the Cayley adjacency matrix of the trace monoid. Passing to p → ∞ in the resulting 2p-norm estimates gives the sharp bound ∥T_G∥ ≤ 2√ω(G), with equality for the balanced complete ω-partite Turán graph. In the operator-valued setting, the same structural control over the Fock space built from trace-monoid words yields the constant 2√ω(G).

Load-bearing premise

The load-bearing premise is the moment-cumulant formula for G-independent semicircles, which says joint moments are exactly counted by the noncrossing pair partitions compatible with the graph's commutation structure, since every moment expansion, path bijection, and norm characterization builds on it.

Editorial extensions

If this is right

  • For any graph G with clique number ω, the normalized sum T_G satisfies ∥T_G∥ ≤ 2√ω, so the growth of the norm is governed by the largest commuting block.
  • The balanced complete ω-partite Turán graph maximizes ∥T_G∥ among graphs on L vertices with clique number ω, and its norm is exactly 2√ω.
  • The disjoint union of a clique K_ω and an edgeless graph minimizes ∥T_G∥, with norm of order √((ω² + L − ω)/L).
  • For operator coefficients, the bound ∥Σ a_i ⊗ s_i∥ ≤ 2√ω(G) max(∥Σ a_i a_i*∥^{1/2}, ∥Σ a_i* a_i∥^{1/2}) extends the free operator-valued Khintchine inequality and improves the previous bound 2√(λ_1 + 1).

Reading between the lines

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

  • Beyond the paper, the exact spectral-radius formula suggests a computational route to ∥T_G∥ via finite truncations of the infinite Cayley graph, and raises the question of which graph parameters beyond the clique number control the growth rate of the norm.
  • The same trace-monoid bijection should extend to graph products of groups, where the Cartier–Foata normal form is replaced by the group normal form; the paper already notes the right-angled Artin group version.
  • A testable extension is that extremal norm growth is controlled by local commuting structure rather than by average connectivity; this could be probed by comparing ∥T_G∥ for random graphs with the same clique number but different edge densities.
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

2 major / 5 minor

Summary. The paper studies G-independent semicircle variables, which interpolate between classical and free independence according to a graph G. The main results are a scalar Khintchine inequality for sums of such variables (Theorem 1.1), a characterization of the norm of the unweighted sum as the spectral radius of the Cayley graph of the associated trace monoid (Theorem 1.4), an operator-valued Khintchine inequality (Theorem 1.5), and Turán-type extremal results (Corollary 1.2 and Proposition 1.3). The proofs use moment-cumulant formulas for G-independence, a bijection between pair partitions and closed paths in trace monoids, Cartier-Foata normal forms, and a Fock space representation of the semicircle variables.

Significance. If the results are correct, this is a significant contribution to noncommutative probability and its interactions with combinatorics and extremal graph theory. The connection between norms of G-independent semicircle sums and spectral radii of trace monoid Cayley graphs is novel and elegant. Theorem 1.5 improves a recent result of Collins and Miyagawa. The extremal results are clean and identify the balanced complete multipartite graph as the maximizer. The paper contains no free parameters and the main real-coefficient arguments are detailed and largely rigorous. However, the complex-coefficient case of the scalar Khintchine inequality is not proved as stated because Lemma 2.2 is false for complex coefficients; this requires a repair before the paper can be accepted.

major comments (2)
  1. [§2.3, Lemma 2.2] The formula for τ[(S_G S_G^*)^p] with complex coefficients α_i omits the complex conjugates at the even positions. For example, with G=K_1, p=1, and α_1=i, the left side is τ((i s)(-i s)) = τ(s^2) = 1, while the displayed right side is i·i = -1. The proof of Lemma 2.2 repeats the same omission in the expansion. Consequently, the reduction in the proof of Theorem 1.1 to nonnegative coefficients via "Lemma 2.2 and the triangle inequality" is unsupported, and Theorem 1.1 as stated for arbitrary complex coefficients is not proven. The real-coefficient version of Lemma 2.2 is correct, so Theorems 1.4 and 1.5 and Corollary 1.2 are unaffected. To repair the paper, Lemma 2.2 should be restated with \bar α at even positions; the triangle inequality then still yields the desired reduction to nonnegative coefficients, or a separate symmetry argument for the G-independent joint distribution should be supplied.
  2. [§4, Proposition 4.1] In the inductive step of the proof, the equality |P(ε)_{2(p+1)}(G,i)| = Σ_{r=1}^{|c_1|} |P(ε^{(r)})_{2p}(G,i^{(r)})| is asserted without proof. The deletion of the up step at position t_r and the down step at position k+1 must be shown to be a bijection between the two sets; the current text only indicates the forward direction and does not justify why the resulting object is in P(ε^{(r)}) or why the inverse reconstruction is valid. Since this decomposition is load-bearing for the bound on |P(ε)|, the authors should provide a short bijective argument or a precise reference for this fact.
minor comments (5)
  1. [§2.2, Lemma 2.1] There is a typo: "semicirlce" should be "semicircle".
  2. [§2.4, definition of P_{2p}(G)] The notation [T(G)]^{2p} is nonstandard; it should be T(G)^{2p} to denote a tuple of elements of the trace monoid.
  3. [§1, equation (1.3)] The display "λ1 + 1" should read "λ_1 + 1" to denote the largest eigenvalue of the adjacency matrix.
  4. [§4, proof of Theorem 1.1] In the nonnegative-coefficient case, the proof writes α_i^2 where the coefficients are real and nonnegative; to avoid confusion with the complex coefficients of the theorem, it would be clearer to use |α_i|^2 throughout.
  5. [References] Reference [21] is cited as a 2008 preprint without journal or volume details; if it has been published, the full citation should be provided.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main estimates are derived from external moment formulas, explicit bijections, and internal counting arguments rather than from the conclusions they establish.

full rationale

The derivation chain is not circular. Lemma 2.1 is taken from Speicher-Wysoczanski [47], an external source, and provides the moment-cumulant formula for G-independent semicircles. Lemma 2.2 then converts this formula into homomorphism counts by a direct computation; it does not assume the target inequality. The trace-monoid correspondence in Section 3 is constructed explicitly: the recursive mapping Phi_p from partition/homomorphism pairs to closed paths in Cay(T(G)) is proved injective and surjective in Lemmas 3.3 and 3.4, and Theorem 1.4 follows by identifying |P_{2p}(G)| with both the 2p-th moment and <A^{2p}e,e>, using standard spectral results for locally finite graphs cited from [35,36]. Proposition 4.1 gives an independent counting bound on path sets by clique size, from which Theorem 1.1 follows; no parameter is fitted to the predicted norm, and the lower bounds in Proposition 1.3 use the external Collins-Miyagawa theorem [12]. Theorem 1.5 uses the Fock-space realization of G-independent semicircles from Bozejko-Speicher [3] together with a Cartier-Foata argument; it does not invoke the conclusion it seeks. The authors' own prior works [6,7,25] appear only in the introduction as contextual remarks about central limit theorems for epsilon-independence, not in any proof, so there is no load-bearing self-citation. A separate correctness concern exists at Section 2.3, Lemma 2.2, where the displayed complex-coefficient formula omits conjugates when expanding (S_G S_G^*)^p; this affects Theorem 1.1 as stated for complex coefficients, but it is an algebraic error, not a circular reduction, because the path-counting bounds are carried out for nonnegative real coefficients and do not assume the target norm. No circular step can be exhibited.

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

The central proofs rely on established prior results (G-independence combinatorics from [47], Cartier-Foata normal forms [5], Bożejko-Speicher Fock spaces [3], spectral radius of locally finite graphs [35,36], and Nica-Speicher norm convergence [37]). No free parameters are fitted; no new entities are postulated. The assumptions are domain-standard and are the natural building blocks for the claimed results.

assumptions (6)
  • domain assumption G-independent semicircle variables satisfy the moment formula τ(s_{i1}...s_{i2p}) = |NC_2(G,i)| (Lemma 2.1).
    Imported from Speicher-Wysoczański [47]; it is the foundation of the homomorphism expansion in Lemma 2.2 and all subsequent moment estimates.
  • standard math Every element of the trace monoid T(G) has a unique Cartier-Foata decomposition into a normal sequence of cliques (Lemma 2.4).
    Classical theorem of Cartier-Foata [5]; used in the induction in Proposition 4.1 and in the Fock space norm bound in Section 5.
  • domain assumption The Fock space operators s_i = l(x_i)+l*(x_i) form G-independent semicircle elements with faithful trace (Bożejko-Speicher [3]).
    Used in the operator-valued proof of Theorem 1.5 to realize the G-independent semicircles concretely and to compute the norm of Σ l(x_i)l*(x_i).
  • standard math For a tracial C*-probability space, ∥u∥_{2p}→∥u∥ as p→∞ (Nica-Speicher [37, Prop 3.17]).
    Used to pass from 2p-moment bounds to operator norm in Theorem 1.1, Corollary 1.2, and Theorem 1.4.
  • standard math For a locally finite graph, the spectral radius is the limit of closed-walk counts: lim ⟨A^{2p}e,e⟩^{1/(2p)} = ∥A∥ (Mohar [35,36]).
    Used in the proof of Theorem 1.4 to convert closed path growth to the adjacency spectral radius.
  • standard math The C*-algebra Cauchy-Schwarz inequality ∥Σ c_i d_i∥ ≤ ∥Σ c_i c_i*∥^{1/2}∥Σ d_i* d_i∥^{1/2} (Equation 5.1).
    Used in the operator-valued Khintchine proof (Theorem 1.5) to separate creation and annihilation parts.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Khintchine inequalities, trace monoids and Tur\'an-type problems." pith.science (2026). https://pith.science/paper/BKTTPKB3

@misc{pith2026250602517,
  author       = {Pith},
  title        = {Pith review of: Khintchine inequalities, trace monoids and Tur\'an-type problems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BKTTPKB3}},
  note         = {Machine review of arXiv:2506.02517}
}
abstract

We prove scalar and operator-valued Khintchine inequalities for mixtures of free and tensor-independent semicircle variables, interpolating between classical and free Khintchine-type inequalities. Specifically, we characterize the norm of sums of $G$-independent semicircle variables in terms of the spectral radius of the Cayley graph associated with the trace monoid determined by the graph $G$. Our approach relies on a precise correspondence between closed paths in trace monoids and the norms of such operator sums. This correspondence uncovers connections between non-commutative probability, combinatorial group theory, and extremal graph theory. In particular, we formulate Tur\'an-type extremal problems that govern maximal norm growth under classical commutation constraints, and identify the extremal configurations. We hope that the methods and connections developed here will be useful in the study of non-commutative structures constrained by combinatorial symmetries.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Strongly convergent matrix models for $q$-Gaussian algebras

    math.OA 2026-07 conditional novelty 8.0 of 10

    For |q| < √2−1, q-Gaussian families admit strongly convergent finite random matrix models whose allowed matrix-coefficient dimension exceeds the matrix dimension.

Reference graph

Works this paper leans on

53 extracted references · 50 canonical work pages · cited by 1 Pith paper

  1. [1]

    Matrix concentration in- equalities and free probability

    A. S. Bandeira, M. T. Boedihardjo, and R. van Handel. “Matrix concentration in- equalities and free probability”. In:Inventiones Mathematicae234 (2023)

    work page 2023

  2. [2]

    Sharp nonasymptotic bounds on the norm of random matrices with independent entries

    A. S. Bandeira and R. van Handel. “Sharp nonasymptotic bounds on the norm of random matrices with independent entries”. In:The Annals of Probability44 (2016)

    work page 2016

  3. [3]

    Completely positive maps on Coxeter groups, de- formed commutation relations, and operator spaces

    M. Bożejko and R. Speicher. “Completely positive maps on Coxeter groups, de- formed commutation relations, and operator spaces”. In:Mathematische Annalen 300 (1994). REFERENCES 17

    work page 1994

  4. [4]

    Norm of convolution by operator-valued functions on free groups

    A. Buchholz. “Norm of convolution by operator-valued functions on free groups”. In: Proceedings of the American Mathematical Society127 (1999)

    work page 1999

  5. [5]

    Cartier and D

    P. Cartier and D. Foata.Problèmes combinatoires de commutation et réarrange- ments. Vol. No. 85. Lecture Notes in Mathematics. Springer-Verlag, Berlin-New York, 1969

    work page 1969

  6. [6]

    Central limit theorem for $\epsilon$-independent products and higher-order tensors

    G. Cébron, P. O. Santos, and P. Youssef.Central limit theorem forϵ-independent products and higher-order tensors. 2025. arXiv:2504.10059 [math.PR]

    work page Pith review arXiv 2025

  7. [7]

    Graphon-Theoretic Approach to Central Limit Theorems for $\epsilon$-Independence

    G. Cébron, P. O. Santos, and P. Youssef.Graphon-Theoretic Approach to Central Limit Theorems forϵ-Independence. 2024. arXiv:2411.13062 [math.PR]

    work page Pith review arXiv 2024

  8. [8]

    Matrix models forε-free independence

    I. Charlesworth and B. Collins. “Matrix models forε-free independence”. In:Arch. Math. (Basel)116 (2021)

    work page 2021

Show all 53 references
  1. [9]

    Charlesworth et al.Random permutation matrix models for graph products

    I. Charlesworth et al.Random permutation matrix models for graph products. 2024. arXiv:2404.07350 [math.OA]

    2024 arXiv

  2. [10]

    Anintroductiontoright-angledArtingroups

    R.Charney.“Anintroductiontoright-angledArtingroups”.In:Geometriae Dedicata 125 (2007)

    2007

  3. [11]

    C.-F. Chen, J. Garza-Vargas, and R. van Handel.A new approach to strong conver- gence II. The classical ensembles. 2024. arXiv:2412.00593 [math.PR]

    2024 arXiv

  4. [12]

    Collins and A

    B. Collins and A. Miyagawa.Operator-valued Khintchine inequality forϵ-free semi- circles. 2025. arXiv:2503.10558 [math.FA]

    2025

  5. [13]

    Collins and W

    B. Collins and W. Yuan.Strong convergence for tensor GUE random matrices. 2024. arXiv:2407.09065 [math.PR]

    2024 arXiv

  6. [14]

    The spectrum of local random Hamiltonians

    B. Collins et al. “The spectrum of local random Hamiltonians”. In:Journal of Physics. A. Mathematical and Theoretical56 (2023)

    2023

  7. [15]

    Operator ideals

    J. Diestel, H. Jarchow, and A. Pietsch. “Operator ideals”. In:Handbook of the ge- ometry of Banach spaces, Vol. I. North-Holland, Amsterdam, 2001

    2001

  8. [16]

    Graph products of groups

    E. R. Green. “Graph products of groups”. PhD thesis. University of Leeds, 1990

    1990

  9. [17]

    An example of a non nuclear C *-algebra, which has the metric approximation property

    U. Haagerup. “An example of a non nuclear C *-algebra, which has the metric approximation property”. In:Inventiones Mathematicae50 (1978)

    1978

  10. [18]

    The best constants in the Khintchine inequality

    U. Haagerup. “The best constants in the Khintchine inequality”. In:Studia Mathe- matica70 (1981)

    1981

  11. [19]

    Bounded linear operators betweenC ∗-algebras

    U. Haagerup and G. Pisier. “Bounded linear operators betweenC ∗-algebras”. In: Duke Mathematical Journal71 (1993)

    1993

  12. [20]

    Sums of independent Banach space valued random vari- ables

    J. Hoffmann-Jørgensen. “Sums of independent Banach space valued random vari- ables”. In:Studia Math.52 (1974)

    1974

  13. [21]

    E. Y. Jin, C. M. Reidys, and R. R. Wang.Asymptotic analysis ofk-noncrossing matchings. 2008

    2008

  14. [22]

    Rapidly decreasing functions in reduced C*-algebras of groups

    P. Jolissaint. “Rapidly decreasing functions in reduced C*-algebras of groups”. In: Transactions of the American Mathematical Society317 (1990)

    1990

  15. [23]

    Strong Haagerup inequalities for freeR-diagonal ele- ments

    T. Kemp and R. Speicher. “Strong Haagerup inequalities for freeR-diagonal ele- ments”. In:Journal of Functional Analysis251 (2007)

    2007

  16. [24]

    Über dyadische Brüche

    A. Khintchine. “Über dyadische Brüche”. In:Mathematische Zeitschrift18 (1923)

    1923

  17. [25]

    Central Limit Theorem for tensor products of free variables

    C. Lancien, P. Oliveira Santos, and P. Youssef. “Central Limit Theorem for tensor products of free variables”. In:Canadian Journal of Mathematics(2024)

    2024

  18. [26]

    Isoperimetry and processes, Reprint of the 1991 edition

    M.LedouxandM.Talagrand.Probability in Banach spaces.ClassicsinMathematics. Isoperimetry and processes, Reprint of the 1991 edition. Springer-Verlag, Berlin, 2011

    1991

  19. [27]

    Absolutely summing operators inL p-spaces and their applications

    J. Lindenstrauss and A. Pełczyński. “Absolutely summing operators inL p-spaces and their applications”. In:Studia Mathematica29 (1968)

    1968

  20. [28]

    Inégalités de Khintchine dansCp (1< p <∞)

    F. Lust-Piquard. “Inégalités de Khintchine dansCp (1< p <∞)”. In:C. R. Acad. Sci. Paris Sér. I Math.303 (1986). 18 REFERENCES

    1986

  21. [29]

    NoncommutativeKhintchineandPaleyinequalities

    F.Lust-PiquardandG.Pisier.“NoncommutativeKhintchineandPaleyinequalities”. In:Arkiv för Matematik29 (1991)

    1991

  22. [30]

    Strongly convergent unitary representations of right- angled Artin groups

    M. Magee and J. Thomas. “Strongly convergent unitary representations of right- angled Artin groups”. In:Preprint arxiv2308 (2023)

    2023

  23. [31]

    Problem 28

    W. Mantel. “Problem 28”. In:Wiskundige Opgaven10 (1907)

    1907

  24. [32]

    M. B. Marcus and G. Pisier.Random Fourier series with applications to harmonic analysis. Vol. No. 101. Annals of Mathematics Studies. Princeton University Press, Princeton, 1981

    1981

  25. [33]

    V. D. Milman and G. Schechtman.Asymptotic theory of finite-dimensional normed spaces: Isoperimetric inequalities in Riemannian manifolds. Vol. 1200. Springer Sci- ence & Business Media, 1986

    1986

  26. [34]

    Λ-free probability

    W. Młotkowski. “Λ-free probability”. In:Infinite Dimensional Analysis, Quantum Probability and Related Topics07 (2004)

    2004

  27. [35]

    The spectrum of an infinite graph

    B. Mohar. “The spectrum of an infinite graph”. In:Linear Algebra and its Applica- tions48 (1982)

    1982

  28. [36]

    A Survey on spectra of infinite graphs

    B. Mohar and W. Woess. “A Survey on spectra of infinite graphs”. In:Bulletin of the London Mathematical Society21 (1989)

    1989

  29. [37]

    Nica and R

    A. Nica and R. Speicher.Lectures on the combinatorics of free probability. Vol. 13. Cambridge University Press, 2006

    2006

  30. [38]

    Sums of random Hermitian matrices and an inequality by Rudelson

    R. Oliveira. “Sums of random Hermitian matrices and an inequality by Rudelson”. In:Electronic Communications in Probability15 (2010)

    2010

  31. [39]

    On some series of functions,(1)

    R. E. A. C. Paley and A. Zygmund. “On some series of functions,(1)”. In:Mathe- matical Proceedings of the Cambridge Philosophical Society26 (1930)

    1930

  32. [40]

    Non-commutative Khintchine type inequalities associated with free groups

    J. Parcet and G. Pisier. “Non-commutative Khintchine type inequalities associated with free groups”. In:Indiana University mathematics journal(2005)

    2005

  33. [41]

    Grothendieck’s theorem, past and present

    G. Pisier. “Grothendieck’s theorem, past and present”. In:Bulletins of American Mathematical Society49 (2012)

    2012

  34. [42]

    Pisier.Introduction to operator space theory

    G. Pisier.Introduction to operator space theory. Cambridge University Press, 2003

    2003

  35. [43]

    Probabilistic methods in the geometry of Banach spaces

    G. Pisier. “Probabilistic methods in the geometry of Banach spaces”. In:Probability and analysis (Varenna, 1985). Vol. 1206. Lecture Notes in Math. Springer, Berlin, 1986

    1985

  36. [44]

    NoncommutativeLp-spaces

    G. Pisier and Q. Xu. “NoncommutativeLp-spaces”. In:Handbook of the geometry of Banach spaces, Vol. 2. North-Holland, Amsterdam, 2003

    2003

  37. [45]

    Random vectors in the isotropic position

    M. Rudelson. “Random vectors in the isotropic position”. In:Journal of Functional Analysis164 (1999)

    1999

  38. [46]

    Strong Haagerup inequalities with operator coefficients

    M. de la Salle. “Strong Haagerup inequalities with operator coefficients”. In:Journal of Functional Analysis257 (2009)

    2009

  39. [47]

    Mixtures of classical and free independence

    R. Speicher and J. Wysoczański. “Mixtures of classical and free independence”. en. In:Arch. Math.107 (2016)

    2016

  40. [48]

    An Introduction to Matrix Concentration Inequalities

    J. A. Tropp. “An Introduction to Matrix Concentration Inequalities”. In:Founda- tions and Trends®in Machine Learning8 (2015)

    2015

  41. [49]

    User-friendly tail bounds for sums of random matrices

    J. A. Tropp. “User-friendly tail bounds for sums of random matrices”. In:Founda- tions of Computational Mathematics12 (2011)

    2011

  42. [50]

    Egy gráfelméleti szélsőértékfeladatról

    P. Turán. “Egy gráfelméleti szélsőértékfeladatról”. Hungarian. In:Matematikai és Fizikai Lapok48 (1941)

    1941

  43. [51]

    Vershynin.High-dimensional probability: An introduction with applications in data science

    R. Vershynin.High-dimensional probability: An introduction with applications in data science. Cambridge University Press, 2018

    2018

  44. [52]

    Symmetries of some reduced free productC∗-algebras

    D. Voiculescu. “Symmetries of some reduced free productC∗-algebras”. In:Operator Algebras and their Connections with Topology and Ergodic Theory. Springer Berlin Heidelberg, 1985. REFERENCES 19

    1985

  45. [53]

    Zhao.Graph Theory and Additive Combinatorics: Exploring Structure and Ran- domness

    Y. Zhao.Graph Theory and Additive Combinatorics: Exploring Structure and Ran- domness. Cambridge University Press, 2023. Patrick Oliveira Santos. Division of Science, NYU Abu Dhabi, Abu Dhabi, UAE. Email address:po2150@nyu.edu Ragha vendra Tripathi. Division of Science, NYU Ab...

    2023

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.