Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
107 tokens/sec
Gemini 2.5 Pro Premium
58 tokens/sec
GPT-5 Medium
29 tokens/sec
GPT-5 High Premium
25 tokens/sec
GPT-4o
101 tokens/sec
DeepSeek R1 via Azure Premium
84 tokens/sec
GPT OSS 120B via Groq Premium
478 tokens/sec
Kimi K2 via Groq Premium
213 tokens/sec
2000 character limit reached

Carleman approximation on Riemann surfaces without critical points (2508.05765v1)

Published 7 Aug 2025 in math.CV

Abstract: We present the class of semi-admissible subsets of an open Riemann surface on which Carleman approximation by non-critical holomorphic functions is possible. In particular we characterize closed sets with empty interior on which continuous functions can be approximated by non-critical holomorphic ones. We also consider a different approach, which in some cases gives uniform approximation by non-critical holomorphic functions on more general sets than semi-admissible ones.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)

X Twitter Logo Streamline Icon: https://streamlinehq.com

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube