Counterexamples to the Gleason problem
Ulf Backlund, Anders Fällström (1998)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Reinhardt domains and the Gleason problem”
Counterexamples to the Gleason problem
Necessary conditions for local convexifiability of pseudoconvex domains in
Kolář, Martin
Similarity:
Trivial generators for nontrivial fibres
Linus Carlsson (2008)
Mathematica Bohemica
Similarity:
Pseudoconvex domains are exhausted in such a way that we keep a part of the boundary fixed in all the domains of the exhaustion. This is used to solve a problem concerning whether the generators for the ideal of either the holomorphic functions continuous up to the boundary or the bounded holomorphic functions, vanishing at a point in where the fibre is nontrivial, has to exceed . This is shown not to be the case.
Convexity, C-convexity and Pseudoconvexity Изпъкналост, c-изпъкналост и псевдоизпъкналост
Nikolov, Nikolai (2011)
Union of Bulgarian Mathematicians
Similarity:
Николай М. Николов - Разгледани са характеризации на различни понятия за изпъкналост, като тези понятия са сравнени. We discuss different characterizations of various notions of convexity as well as we compare these notions. *2000 Mathematics Subject Classification: 32F17.