Abstract
There is a fairly comprehensive theory of discrete analytic functions based on circle packing. In this theory, discrete analytic functions are represented as maps between circle packings that share combinatorial tangency patterns. Branching behavior, however, has until now been restricted by the need to place branch points at circle centers. In this paper, the authors introduce mechanisms for generalized branching which remove this restriction. Their use is illustrated by overcoming combinatorial obstructions to branching in the construction of a discrete Ahlfors function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
