2000 character limit reached
Fischer decompositions for entire functions of sufficiently low order
Published 15 Mar 2024 in math.AP | (2403.10419v2)
Abstract: The existence of decompositions of the form $f=P\cdot q+r$ with $P_k{\ast}\left( D\right) r=0 $, where $f$ is entire, $P$ a polynomial and $P{\ast}_k$ the principal part of $P$ with its coefficients conjugated, was achieved in \cite{AlRe23} under certain restrictions on the order of $f$. Here we prove uniqueness, thereby obtaining Fischer decompositions, under conditions that sometimes match those required for existence, and sometimes are more restrictive, depending on the parameters involved.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.