Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fischer decompositions for entire functions of sufficiently low order (2403.10419v2)

Published 15 Mar 2024 in math.AP

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.

Summary

We haven't generated a summary for this paper yet.