Papers
Topics
Authors
Recent
Search
2000 character limit reached

Khintchine inequalities, trace monoids and Turán-type problems

Published 3 Jun 2025 in math.OA, math.CO, math.FA, and math.PR | (2506.02517v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.