Rigid characterizations of pseudoconvex domains
Nikolai Nikolov, Pascal J. Thomas

TL;DR
This paper characterizes pseudoconvex domains in complex space by examining the pseudoconvexity of largest balanced subdomains centered at each point, and explores similar characterizations for linearly convex domains.
Contribution
It provides a new characterization of pseudoconvex domains based on balanced subdomains, extending to linearly convex domains.
Findings
Pseudoconvexity of a domain is equivalent to the pseudoconvexity of all largest balanced subdomains.
Analogues of the characterization are established for linearly convex domains.
Abstract
We prove that an open set in is pseudoconvex if and only if for any the largest balanced domain centered at and contained in is pseudoconvex, and consider analogues of that characterization in the linearly convex case.
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.
