The support of the free additive convolution of multi-cut measures
Philippe Moreillon, Kevin Schnelli

TL;DR
This paper investigates the structure of the support of free additive convolutions of measures supported on multiple disjoint intervals, providing bounds on the number of connected components and generalizing previous results.
Contribution
It extends existing results to multi-cut measures, establishing bounds on support components for free additive convolutions and their semi-groups.
Findings
Derived bounds on the number of support components
Generalized previous single-cut results to multi-cut measures
Analyzed measures with power law behaviors at endpoints
Abstract
We consider the free additive convolution of two probability measures and , supported on respectively and disjoint bounded intervals on the real line, and derive a lower bound and an upper bound that is strictly smaller than , on the number of connected components in its support. We also obtain the corresponding results for the free additive convolution semi-group . Throughout the paper, we consider classes of probability measures with power law behaviors at the endpoints of their supports with exponents ranging from to . Our main theorem generalizes a result of Bao, Erd\H{o}s and Schnelli~[4] to the multi-cut setup.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Spectral Theory in Mathematical Physics · Limits and Structures in Graph Theory
