Logharmonic mappings on linearly connected domains
Sign Up to like & getrecommendations! Published in 2019 at "Analysis and Mathematical Physics"
DOI: 10.1007/s13324-019-00318-6
Abstract: A logharmonic mapping f is a mapping that is a solution of the nonlinear elliptic partial differential equation $$\dfrac{\overline{f_{ \overline{z}}}}{\overline{f}}=a\dfrac{f_{z}}{f}$$fz¯¯f¯=afzf. In this paper we investigate the univalence of logharmonic mappings of the form $$ f=zH\overline{G},$$f=zHG¯,… read more here.
Keywords: linearly connected; univalence; connected domains; logharmonic mappings ... See more keywords
Cubical Agda: A dependently typed programming language with univalence and higher inductive types
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Functional Programming"
DOI: 10.1017/s0956796821000034
Abstract: Abstract Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such… read more here.
Keywords: dependently typed; higher inductive; univalence; type theory ... See more keywords