𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Carleman Formulas and on the Class of Holomorphic Functions Representable by Them

✍ Scribed by Lev Aizenberg; Alekos Vidras

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
285 KB
Volume
237
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a class of holomorphic functions repr
On a class of holomorphic functions representable by Carleman formulas in the disk from their values on the arc of the circle
✍ Lev Aizenberg; Alekos Vidras πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 218 KB πŸ‘ 1 views

## Abstract Let __D__ be a unit disk and__M__ be an open arc of the unit circle whose Lebesgue measure satisfies 0 < __l__ (__M__) < 2__Ο€__. Our first result characterizes the restriction of the holomorphic functions __f__ ∈ ℋ︁(__D__), which are in the Hardy class ℋ︁^1^ near the arc__M__ and are de

On the diagonalization of holomorphic ma
On the diagonalization of holomorphic matrix functions of several variables
✍ Dieter Heunemann πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 203 KB

## On the diagonalization of holomorphic matrix functions of several variables By DIETER HETTNEMANN in Berlin (Eingegangen am 10.7. 1979) Let X c C n be a domain of holomorphy, L(Ck) be the space of complex k x kmatrices and GL(Ck) be the group of the invertible complex k x k-matrices. Two holom

A class of 2D graphical representations
A class of 2D graphical representations of RNA secondary structures and the analysis of similarity based on them
✍ Yu-Hua Yao; Xu-Ying Nan; Tian-Ming Wang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 230 KB πŸ‘ 2 views

## Abstract Based on the concepts of cell and system of graphical representation, a class of 2D graphical representations of RNA secondary structures are given in terms of classifications of bases of nucleic acids. The representations can completely avoid loss of information associated with crossin

On the complexity of axiomatizations of
On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
✍ Tarek Sayed Ahmed πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## MSC (2010) Primary: 03G15 Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA Ξ± of representable quasi-polyadic equality algebras of any dimension Ξ±. Following Sain and Thompson in modifying AndrΓ©ka's methods of splitting,