Repository logo
  • Log In
    New user? Click here to register.Have you forgotten your password?
University College Dublin
    Colleges & Schools
    Statistics
    All of DSpace
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. College of Science
  3. School of Mathematics and Statistics
  4. Mathematics and Statistics Research Collection
  5. A Characterization of the Khavinson-Shapiro Conjecture Via Fischer Operators
 
  • Details
Options

A Characterization of the Khavinson-Shapiro Conjecture Via Fischer Operators

Author(s)
Render, Hermann  
Uri
http://hdl.handle.net/10197/9584
Date Issued
2016-10
Date Available
2019-01-07T14:04:27Z
Abstract
The Khavinson-Shapiro conjecture states that ellipsoids are the only bounded domains in euclidean space satisfying the following property (KS): the solution of the Dirichlet problem for polynomial data is polynomial. In this paper we show that property (KS) for a domain Ω is equivalent to the surjectivity of a Fischer operator associated to the domain Ω.
Type of Material
Journal Article
Publisher
Springer
Journal
Potential Analysis
Volume
45
Issue
3
Start Page
539
End Page
543
Copyright (Published Version)
2017 Springer
Subjects

Dirichlet problem

Harmonic extension

Khavinson-Shapiro con...

DOI
10.1007/s11118-016-9555-0
Language
English
Status of Item
Peer reviewed
This item is made available under a Creative Commons License
https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
File(s)
Loading...
Thumbnail Image
Name

2015RenderCharactKhavShapConj.pdf

Size

237.25 KB

Format

Adobe PDF

Checksum (MD5)

1d0e14f07a03e98399dff444c5561a1b

Owning collection
Mathematics and Statistics Research Collection

Item descriptive metadata is released under a CC-0 (public domain) license: https://creativecommons.org/public-domain/cc0/.
All other content is subject to copyright.

For all queries please contact research.repository@ucd.ie.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement